English
Related papers

Related papers: Improved bound for the $k$-variate Elekes--R\'onya…

200 papers

A tensor defined over a finite field $\mathbb{F}$ has low analytic rank if the distribution of its values differs significantly from the uniform distribution. An order $d$ tensor has partition rank 1 if it can be written as a product of two…

Combinatorics · Mathematics 2020-05-19 Oliver Janzer

Given $s \ge k\ge 3$, let $h^{(k)}(s)$ be the minimum $t$ such that there exist arbitrarily large $k$-uniform hypergraphs $H$ whose independence number is at most polylogarithmic in the number of vertices and in which every $s$ vertices…

Combinatorics · Mathematics 2020-05-13 Dhruv Mubayi , Alexander Razborov

Suppose $F$ is an infinite field and let $f \in F\{X_1, \dots,X_m\}$ be a noncommutative polynomial. Partially answering a query of Makar-Limanov, we show that there are numbers $d$ and $m'$ such that, if $F$ is closed under taking $d$th…

Rings and Algebras · Mathematics 2026-03-02 Louis H. Rowen , Uzi Vishne

For $2\leq s<t$, the Erd\H{o}s-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function,…

Combinatorics · Mathematics 2024-02-06 Oliver Janzer , Benny Sudakov

We show that there exists $c>0$ such that any subset of $\{1, \dots, N\}$ of density at least $(\log\log{N})^{-c}$ contains a nontrivial progression of the form $x,x+y,x+y^2$. This is the first quantitatively effective version of the…

Number Theory · Mathematics 2022-01-10 Sarah Peluse , Sean Prendiville

This paper axiomatizes, in a two-stage setup, a new theory for decision under risk and ambiguity. The axiomatized preference relation $\succeq$ on the space $\tilde{V}$ of random variables induces an ambiguity index $c$ on the space…

Optimization and Control · Mathematics 2026-03-24 Roger J. A. Laeven , Mitja Stadje

Consider a homogeneous polynomial $p(z_1,...,z_n)$ of degree $n$ in $n$ complex variables . Assume that this polynomial satisfies the property : \\ $|p(z_1,...,z_n)| \geq \prod_{1 \leq i \leq n} Re(z_i)$ on the domain $\{(z_1,...,z_n) :…

Combinatorics · Mathematics 2007-05-23 Leonid Gurvits

Let $f,g \in k[x]$ be nonconstant polynomials over a number field $k$. We count $S$-integer inputs $a$ for which $f(a)$ has a $k$-rational preimage under $g$, after removing the polynomial graph components $Y=h(X)$ with $f=g\circ h$. The…

Number Theory · Mathematics 2026-05-14 Henry Shin

Chang's lemma (Duke Mathematical Journal, 2002) is a classical result with applications across several areas in mathematics and computer science. For a Boolean function $f$ that takes values in {-1,1} let $r(f)$ denote its Fourier rank. For…

Computational Complexity · Computer Science 2021-05-25 Sourav Chakraborty , Nikhil S. Mande , Rajat Mittal , Tulasimohan Molli , Manaswi Paraashar , Swagato Sanyal

We prove hypergraph variants of the celebrated Alon-Roichman theorem on spectral expansion of sparse random Cayley graphs. One of these variants implies that for every prime $p\geq 3$ and any $\varepsilon > 0$, there exists a set of…

Combinatorics · Mathematics 2016-11-17 Jop Briët , Shravas Rao

In this paper, we obtain new bounds for the tensor rank of multiplication in any extension of $\F_2$. In particular, it also enables us to obtain the best known asymptotic bound. In this aim, we use the generalized algorithm of type…

Algebraic Geometry · Mathematics 2015-12-31 Stéphane Ballet , Julia Pieltant

We compute the rate of exponential growth of the free inverse monoid of rank $r$ (and hence an upper bound on the corresponding rate for all $r$-generated inverse monoids and semigroups). This turns out to be an algebraic number strictly…

Group Theory · Mathematics 2024-07-16 Mark Kambites , Carl-Fredrik Nyberg-Brodda , Nóra Szakács , Richard Webb

Let $C\subseteq \{1,\ldots,k\}^n$ be such that for any $k$ distinct elements of $C$ there exists a coordinate where they all differ simultaneously. Fredman and Koml\'os studied upper and lower bounds on the largest cardinality of such a set…

Combinatorics · Mathematics 2020-02-26 Simone Costa , Marco Dalai

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

Optimization and Control · Mathematics 2024-07-25 Boulos El Hilany , Elias Tsigaridas

Let $R=K[t;\sigma]$ be a skew polynomial ring, where $K$ is a cyclic Galois field extension of degree $n$ with Galois group generated by $\sigma$. We show that two irreducible similar skew polynomials $f,g\in R$ are similar if and only if…

Rings and Algebras · Mathematics 2025-11-25 Susanne Pumpluen

Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemer\'edi's theorem with random differences is bounded from above by $N^{1-\frac{2}{k} + o(1)}$ for length-$k$ progressions. This…

Combinatorics · Mathematics 2024-11-06 Jop Briët , Davi Castro-Silva

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

Number Theory · Mathematics 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…

Data Structures and Algorithms · Computer Science 2018-09-24 V. Arvind , Abhranil Chatterjee , Rajit Datta , Partha Mukhopadhyay

We prove the following conjecture of Shkredov and Solymosi: every subset $A \subset \mathbf{Z}^2$ such that $\sum_{a\in A\setminus\{0\}} 1/\left\|a\right\|^{2} = +\infty$ contains the three vertices of an isosceles right triangle. To do…

Combinatorics · Mathematics 2022-12-02 Cédric Pilatte

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

Combinatorics · Mathematics 2017-12-07 Jesse Geneson
‹ Prev 1 8 9 10 Next ›