English
Related papers

Related papers: New bounds on Simonyi's conjecture

200 papers

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

Number Theory · Mathematics 2025-11-25 Chenghui Ren

For $\lambda \in \mathbb{Z}$, let $\lambda \cdot A = \{ \lambda a : a \in A\}$. Suppose $r, h\in \mathbb{Z}$ are sufficiently large and comparable to each other. We prove that if $|A+A| \le K |A|$ and $\lambda_1, \ldots, \lambda_h \le 2^r$,…

Combinatorics · Mathematics 2017-08-29 Albert Bush , Yi Zhao

For a block B of a finite group G there are well-known orthogonality relations for the generalized decomposition numbers. We refine these relations by expressing the generalized decomposition numbers with respect to an integral basis of a…

Representation Theory · Mathematics 2015-11-23 Benjamin Sambale

Take a set of balls in $\mathbb R^d$. We find a subset of pairwise disjoint balls whose combined perimeter controls the perimeter of the union of the original balls. This can be seen as a boundary version of the Vitali covering lemma. We…

Classical Analysis and ODEs · Mathematics 2025-07-22 Julian Weigt

We prove two conjectures in this paper. The first conjecture is by Lund, Pham and Thu: Given a Borel set $A\subset \mathbb{R}^n$ such that $\dim A\in (k,k+1]$ for some $k\in\{1,\dots,n-1\}$. For $0<s<k$, we have \[ \text{dim}(\{y\in…

Classical Analysis and ODEs · Mathematics 2024-03-04 Paige Bright , Shengwen Gan

A conjecture of Marton, widely known as the polynomial Freiman-Ruzsa conjecture, was recently proved by Gowers, Green, Manners and Tao for any bounded-torsion Abelian group $G$. In this paper we show a few simple modifications that improve…

Combinatorics · Mathematics 2024-04-16 Jyun-Jie Liao

Let $G$ be a finite non-solvable group. We prove that there exists a proper subgroup $A$ of $G$ such that $G$ is the product of three conjugates of $A$, thus replacing an earlier upper bound of $36$ with the smallest possible value. The…

Group Theory · Mathematics 2015-01-26 John Cannon , Martino Garonzi , Dan Levy , Attila Maróti , Iulian I. Simion

In this note, pointwise best-possible (lower and upper) bounds on the set of copulas with a given value of the Gini's gamma coefficient are established. It is shown that, unlike the best-possible bounds on the set of copulas with a given…

Statistics Theory · Mathematics 2025-01-14 Manuel Úbeda-Flores

Let $I$ be an intersection of three monomial prime ideals of a polynomial algebra $S$ over a field. We give a special Stanley decomposition of $I$ which provides a lower bound of the Stanley depth of $I$, greater than or equal to $\depth\…

Commutative Algebra · Mathematics 2010-11-09 Adrian Popescu

We produce a criterion for open sets in projective $n$-space over a separably closed field to have \'etale cohomological dimension bounded by $2n-3$. We use the criterion to exhibit a scheme for which \'etale cohomological dimension is…

Commutative Algebra · Mathematics 2010-12-01 Manoj Kummini , Uli Walther

R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…

Combinatorics · Mathematics 2016-10-10 Gabor Hegedüs

A new upper bound on the relative entropy is derived as a function of the total variation distance for probability measures defined on a common finite alphabet. The bound improves a previously reported bound by Csisz\'ar and Talata. It is…

Information Theory · Computer Science 2015-10-20 Igal Sason , Sergio Verdu

We say that two graphs on the same vertex set are $G$-creating if their union (the union of their edges) contains $G$ as a subgraph. Let $H_n(G)$ be the maximum number of pairwise $G$-creating Hamiltonian paths of $K_n$. Cohen, Fachini and…

Combinatorics · Mathematics 2024-11-18 Gergely Harcos , Daniel Soltész

Feigin and Shoikhet conjectured in math/0610410 that successive quotients $B_m(A_n)$ of the lower central series filtration of a free associative algebra $A_n$ have polynomial growth. In this paper we give a proof of this conjecture, using…

Rings and Algebras · Mathematics 2008-03-27 G. Dobrovolska , P. Etingof

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Data Structures and Algorithms · Computer Science 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer

Let $G$ be a finite group and $\psi(G) = \sum_{g \in G} o(g)$, where $o(g)$ denotes the order of $g \in G$. First, we prove that if $G$ is a group of order $n$ and $\psi(G) >31\psi(C_n)/77$, where $C_n$ is the cyclic group of order $n$,…

Group Theory · Mathematics 2021-01-27 Morteza Baniasad Azad , Behrooz Khosravi

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

Combinatorics · Mathematics 2025-07-15 Vuong Bui

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

Data Structures and Algorithms · Computer Science 2021-11-03 Haotian Jiang , Victor Reis

In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\pi^{2/3})n^{2/3} +O(n^{1/3}…

Genomics · Quantitative Biology 2011-01-19 Cynthia Vinzant

This paper gives a sharp upper bound for the Betti numbers of a finitely generated multigraded $R$-module, where $R=\Bbbk [x_{1},...,x_{m}]$ is the polynomial ring over a field $\Bbbk$ in $m$ variables. The bound is given in terms of the…

Commutative Algebra · Mathematics 2007-05-23 Amanda Beecher