English
Related papers

Related papers: New bounds for the same-type lemma

200 papers

We introduce the notion of "special superpolynomials" by putting q=1 in the formulas for reduced superpolynomials. In this way we obtain a generalization of special HOMFLY polynomials depending on one extra parameter t. Special HOMFLY are…

High Energy Physics - Theory · Physics 2014-07-24 Anton Morozov

We prove several results concerning finitely generated submonoids of the free monoid. These results generalize those known for free submonoids. We prove in particular that if $X=Y\circ Z$ is a composition of finite sets of words with $Y$…

Formal Languages and Automata Theory · Computer Science 2022-07-28 Dominique Perrin , Andrew Ryzhikov

Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…

Algebraic Topology · Mathematics 2016-10-10 Martin Čadek , Marek Krčál , Lukáš Vokřínek

We show that any finite $S \subset \mathbb{R}^d$ in general position has arbitrarily large supersets $T \supseteq S$ in general position with the property that $T$ contains no empty convex polygon, or hole, with $C_d$ points, where $C_d$ is…

Combinatorics · Mathematics 2022-11-11 David Conlon , Jeck Lim

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

We introduce a multiplicity Tutte polynomial M(x,y), with applications to zonotopes and toric arrangements. We prove that M(x,y) satisfies a deletion-restriction recurrence and has positive coefficients. The characteristic polynomial and…

Combinatorics · Mathematics 2010-11-10 Luca Moci

Fix a prime $p\geq 11$. We show that there exists a positive integer $m$ such that any subset of $\mathbb{F}_p^n\times\mathbb{F}_p^n$ containing no nontrivial configurations of the form $(x,y),(x,y+z),(x,y+2z),(x+z,y)$ must have density…

Combinatorics · Mathematics 2023-12-14 Sarah Peluse

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…

Number Theory · Mathematics 2026-03-25 Dante Bonolis , Lillian B. Pierce

If $\vf_1, ... \vf_m\colon\Z\to\Z^\ell$ are polynomials with zero constant terms and $E\subset\Z^\ell$ has positive upper Banach density, then we show that the set $E\cap (E-\vf_1(p-1))\cap\...\cap (E-\vf_m(p-1))$ is nonempty for some prime…

Dynamical Systems · Mathematics 2011-08-19 Nikos Frantzikinakis , Bernard Host , Bryna Kra

We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…

Combinatorics · Mathematics 2015-09-02 Fabrício S. Benevides , Dániel Gerbner , Cory T. Palmer , Dominik K. Vu

We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…

Symbolic Computation · Computer Science 2025-01-27 Louis Gaillard , Mohab Safey El Din

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

Combinatorics · Mathematics 2011-08-12 Stefko Miklavic , Paul Terwilliger

Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…

Algebraic Geometry · Mathematics 2016-10-11 Saugata Basu , Marie-Francoise Roy

In this paper we characterize real bivariate polynomials which have a small range over large Cartesian products. We show that for every constant-degree bivariate real polynomial $f$, either $|f(A,B)|=\Omega(n^{4/3})$, for every pair of…

Computational Geometry · Computer Science 2014-03-20 Orit E. Raz , Micha Sharir , József Solymosi

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

Number Theory · Mathematics 2021-11-30 P Vanchinathan , Krithika M

In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+\alpha$ vertices and $d+1+\beta$ facets is bounded by a constant independent of $d$.

Combinatorics · Mathematics 2015-03-16 Arnau Padrol

We prove some results on when functions on compact sets $K \subset \mathbb C$ can be approximated by polynomials avoiding values in given sets. We also prove some higher dimensional analogues. In particular we prove that a continuous…

Classical Analysis and ODEs · Mathematics 2021-08-17 Johan Andersson

We consider a wide class of linear boundary-value problems for systems of $m$ ordinary differential equations of order $r$, known as general boundary-value problems. Their solutions $y:[a,b]\to \mathbb{C}^{m}$ belong to the Sobolev space…

Classical Analysis and ODEs · Mathematics 2021-01-27 A. A. Murach , O. B. Pelekhata , V. O. Soldatov

Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…

Commutative Algebra · Mathematics 2019-05-14 Daniel Erman , Steven V Sam , Andrew Snowden

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi
‹ Prev 1 8 9 10 Next ›