Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
The present paper is concerned with the various algebraic structures supported by the set of Turán densities.We prove that the set of Turán densities of finite families of r-graphs is a non-trivial commutative semigroup, and as a consequence we construct explicit irrational densities for any r ≥ 3. The proof relies on a technique recently developed by Pikhurko.We also show that the set of all Turán densities forms a graded ring, and from this we obtain a short proof of a theorem of Peng on jumps of hypergraphs.Finally, we prove that the set of Turán densities of families of r-graphs has positive Lebesgue measure if and only if it contains an open interval. This is a simple consequence of Steinhaus's theorem.
The present paper is concerned with the various algebraic structures supported by the set of Turán densities.We prove that the set of Turán densities of finite families of r-graphs is a non-trivial commutative semigroup, and as a consequence we construct explicit irrational densities for any r ≥ 3. The proof relies on a technique recently developed by Pikhurko.We also show that the set of all Turán densities forms a graded ring, and from this we obtain a short proof of a theorem of Peng on jumps of hypergraphs.Finally, we prove that the set of Turán densities of families of r-graphs has positive Lebesgue measure if and only if it contains an open interval. This is a simple consequence of Steinhaus's theorem.
Let Ω n {\Omega }_{n} denote the set of all doubly stochastic matrices of order n n . Lih and Wang conjectured that for n ≥ 3 n\ge 3 , per ( t J n + ( 1 − t ) A ) ≤ t \left(t{J}_{n}+\left(1-t)A)\le t per J n + ( 1 − t ) {J}_{n}+\left(1-t) per A A , for all A ∈ Ω n A\in {\Omega }_{n} and all t ∈ [ 0.5 , 1 ] t\in \left[0.5,1] , where J n {J}_{n} is the n × n n\times n matrix with each entry equal to 1 n \frac{1}{n} . This conjecture was proved partially for n ≤ 5 n\le 5 . Let K n {K}_{n} denote the set of nonnegative n × n n\times n matrices whose elements have sum n n . Let ϕ \phi be a real valued function defined on K n {K}_{n} by ϕ ( X ) = ∏ i = 1 n r i + ∏ j = 1 n c j \phi \left(X)={\prod }_{i=1}^{n}{r}_{i}+{\prod }_{j=1}^{n}{c}_{j} - per X X for X ∈ K n X\in {K}_{n} with row sum vector ( r 1 , r 2 , … r n ) \left({r}_{1},{r}_{2},\ldots {r}_{n}) and column sum vector ( c 1 , c 2 , … c n ) \left({c}_{1},{c}_{2},\ldots {c}_{n}) . A matrix A ∈ K n A\in {K}_{n} is called a ϕ \phi -maximizing matrix if ϕ ( A ) ≥ ϕ ( X ) \phi \left(A)\ge \phi \left(X) for all X ∈ K n X\in {K}_{n} . Dittert conjectured that J n {J}_{n} is the unique ϕ \phi -maximizing matrix on K n {K}_{n} . Sinkhorn proved the conjecture for n = 2 n=2 and Hwang proved it for n = 3 n=3 . In this article, we prove the Lih and Wang partially for n = 6 n=6 . It is also proved that if A A is a ϕ \phi -maximizing matrix on K 4 {K}_{4} , then A A is fully indecomposable.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.