Displaying similar documents to “Covering energy of posets and its bounds”

A new lower bound for the football pool problem for 7 matches

Laurent Habsieger (1996)

Journal de théorie des nombres de Bordeaux

Similarity:

Let K 3 ( 7 , 1 ) denote the minimum cardinality of a ternary code of length 7 and covering radius one. In a previous paper, we improved on the lower bound K 3 ( 7 , 1 ) 147 by showing that K 3 ( 7 , 1 ) 150 . In this note, we prove that K 3 ( 7 , 1 ) 153 .

Secure domination and secure total domination in graphs

William F. Klostermeyer, Christina M. Mynhardt (2008)

Discussiones Mathematicae Graph Theory

Similarity:

A secure (total) dominating set of a graph G = (V,E) is a (total) dominating set X ⊆ V with the property that for each u ∈ V-X, there exists x ∈ X adjacent to u such that ( X - x ) u is (total) dominating. The smallest cardinality of a secure (total) dominating set is the secure (total) domination number γ s ( G ) ( γ s t ( G ) ) . We characterize graphs with equal total and secure total domination numbers. We show that if G has minimum degree at least two, then γ s t ( G ) γ s ( G ) . We also show that γ s t ( G ) is at most twice the clique covering...

A lower bound sequence for the minimum eigenvalue of Hadamard product of an M -matrix and its inverse

Wenlong Zeng, Jianzhou Liu (2022)

Czechoslovak Mathematical Journal

Similarity:

We propose a lower bound sequence for the minimum eigenvalue of Hadamard product of an M -matrix and its inverse, in terms of an S -type eigenvalues inclusion set and inequality scaling techniques. In addition, it is proved that the lower bound sequence converges. Several numerical experiments are given to demonstrate that the lower bound sequence is sharper than some existing ones in most cases.

Erratum to the paper "On the disc theorem" (Ann. Polon. Math. 55 (1991), 1-10)

Cabiria Andreian Cazacu (1992)

Annales Polonici Mathematici

Similarity:

Due to a technical error, part of a sentence was omitted on the top of page 8. The first line should read: “where f p k , p = a l or b l , means the number of folds of the covering ( δ k ' ' , T | , Δ l ' ' ) ending at p, i.e. covering a neighbourhood of p in a l b l without covering p itself”.

On Ponomarev-Systems

Ying Ge, Lin Shou (2007)

Bollettino dell'Unione Matematica Italiana

Similarity:

In this paper the relations of mappings and families of subsets are investigated in Ponomarev-systems, and the following results are obtained. (1) f is a sequence-covering (resp. 1-sequence-covering) mapping iff 𝒫 is a csf -network (resp. snf -network) of X for a Ponomarev-system ( f , M , X , 𝒫 ) ; (2) f is a sequence-covering (resp. 1-sequence-covering) mapping iff every 𝒫 n is a cs-cover (resp. wsn-cover) of X for a Ponomarev-system ( f , M , X , { 𝒫 n } ) . As applications of these results, some relations between sequence-covering...

Lower semicontinuous envelopes in W 1 , 1 × L p

Ana Margarida Ribeiro, Elvira Zappale (2014)

Banach Center Publications

Similarity:

The lower semicontinuity of functionals of the type Ω f ( x , u , v , u ) d x with respect to the ( W 1 , 1 × L p ) -weak* topology is studied. Moreover, in absence of lower semicontinuity, an integral representation in W 1 , 1 × L p for the lower semicontinuous envelope is also provided.

Vortex collisions and energy-dissipation rates in the Ginzburg–Landau heat flow. Part I: Study of the perturbed Ginzburg–Landau equation

Sylvia Serfaty (2007)

Journal of the European Mathematical Society

Similarity:

We study vortices for solutions of the perturbed Ginzburg–Landau equations Δ u + ( u / ε 2 ) ( 1 | u | 2 ) = f ε where f ε is estimated in L 2 . We prove upper bounds for the Ginzburg–Landau energy in terms of f ε L 2 , and obtain lower bounds for f ε L 2 in terms of the vortices when these form “unbalanced clusters” where i d i 2 ( i d i ) 2 . These results will serve in Part II of this paper to provide estimates on the energy-dissipation rates for solutions of the Ginzburg–Landau heat flow, which allow one to study various phenomena occurring in this flow,...

Combinatorics of open covers (VII): Groupability

Ljubiša D. R. Kočinac, Marion Scheepers (2003)

Fundamenta Mathematicae

Similarity:

We use Ramseyan partition relations to characterize: ∙ the classical covering property of Hurewicz; ∙ the covering property of Gerlits and Nagy; ∙ the combinatorial cardinal numbers and add(ℳ ). Let X be a T 31 / 2 -space. In [9] we showed that C p ( X ) has countable strong fan tightness as well as the Reznichenko property if, and only if, all finite powers of X have the Gerlits-Nagy covering property. Now we show that the following are equivalent: 1. C p ( X ) has countable fan tightness and the Reznichenko...

Upper bounds for the domination numbers of toroidal queens graphs

Christina M. Mynhardt (2003)

Discussiones Mathematicae Graph Theory

Similarity:

We determine upper bounds for γ ( Q n t ) and i ( Q t ) , the domination and independent domination numbers, respectively, of the graph Q t obtained from the moves of queens on the n×n chessboard drawn on the torus.

Upper bounds on the length of a shortest closed geodesic and quantitative Hurewicz theorem

Alexander Nabutovsky, Regina Rotman (2003)

Journal of the European Mathematical Society

Similarity:

In this paper we present two upper bounds on the length of a shortest closed geodesic on compact Riemannian manifolds. The first upper bound depends on an upper bound on sectional curvature and an upper bound on the volume of the manifold. The second upper bound will be given in terms of a lower bound on sectional curvature, an upper bound on the diameter and a lower bound on the volume. The related questions that will also be studied are the following: given a contractible k -dimensional...

Diagonalization in proof complexity

Jan Krajíček (2004)

Fundamenta Mathematicae

Similarity:

We study diagonalization in the context of implicit proofs of [10]. We prove that at least one of the following three conjectures is true: ∙ There is a function f: 0,1* → 0,1 computable in that has circuit complexity 2 Ω ( n ) . ∙ ≠ co . ∙ There is no p-optimal propositional proof system. We note that a variant of the statement (either ≠ co or ∩ co contains a function 2 Ω ( n ) hard on average) seems to have a bearing on the existence of good proof complexity generators. In particular, we prove that...

On the angles between certain arithmetically defined subspaces of 𝐂 n

Robert Brooks (1987)

Annales de l'institut Fourier

Similarity:

If { v i } and { w j } are two families of unitary bases for C n , and θ is a fixed number, let V n and W n be subspaces of C n spanned by [ θ · n ] vectors in { v i } and { w j } respectively. We study the angle between V n and W n as n goes to infinity. We show that when { v i } and { w j } arise in certain arithmetically defined families, the angles between V n and W n may either tend to 0 or be bounded away from zero, depending on the behavior of an associated eigenvalue problem.

On the optimality and sharpness of Laguerre's lower bound on the smallest eigenvalue of a symmetric positive definite matrix

Yusaku Yamamoto (2017)

Applications of Mathematics

Similarity:

Lower bounds on the smallest eigenvalue of a symmetric positive definite matrix A m × m play an important role in condition number estimation and in iterative methods for singular value computation. In particular, the bounds based on Tr ( A - 1 ) and Tr ( A - 2 ) have attracted attention recently, because they can be computed in O ( m ) operations when A is tridiagonal. In this paper, we focus on these bounds and investigate their properties in detail. First, we consider the problem of finding the optimal bound that...

On distance Laplacian energy in terms of graph invariants

Hilal A. Ganie, Rezwan Ul Shaban, Bilal A. Rather, Shariefuddin Pirzada (2023)

Czechoslovak Mathematical Journal

Similarity:

For a simple connected graph G of order n having distance Laplacian eigenvalues ρ 1 L ρ 2 L ρ n L , the distance Laplacian energy DLE ( G ) is defined as DLE ( G ) = i = 1 n | ρ i L - 2 W ( G ) / n | , where W ( G ) is the Wiener index of G . We obtain a relationship between the Laplacian energy and the distance Laplacian energy for graphs with diameter 2. We obtain lower bounds for the distance Laplacian energy DLE ( G ) in terms of the order n , the Wiener index W ( G ) , the independence number, the vertex connectivity number and other given parameters. We characterize the...

Involutions of 3-dimensional handlebodies

Andrea Pantaleoni, Riccardo Piergallini (2011)

Fundamenta Mathematicae

Similarity:

We study the orientation preserving involutions of the orientable 3-dimensional handlebody H g , for any genus g. A complete classification of such involutions is given in terms of their fixed points.

On star covering properties related to countable compactness and pseudocompactness

Marcelo D. Passos, Heides L. Santana, Samuel G. da Silva (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We prove a number of results on star covering properties which may be regarded as either generalizations or specializations of topological properties related to the ones mentioned in the title of the paper. For instance, we give a new, entirely combinatorial proof of the fact that Ψ -spaces constructed from infinite almost disjoint families are not star-compact. By going a little further we conclude that if X is a star-compact space within a certain class, then X is neither first countable...

Effective decomposition of σ-continuous Borel functions

Gabriel Debs (2014)

Fundamenta Mathematicae

Similarity:

We prove that if a Δ¹₁ function f with Σ¹₁ domain X is σ-continuous then one can find a Δ¹₁ covering ( A ) n ω of X such that f | A is continuous for all n. This is an effective version of a recent result by Pawlikowski and Sabok, generalizing an earlier result of Solecki.