English
Related papers

Related papers: Common and Sidorenko equations in Abelian groups

200 papers

A linear equation with coefficients in $\mathbb{F}_q$ is common if the number of monochromatic solutions in any two-coloring of $\mathbb{F}_q^n$ is asymptotically (as $n \to \infty$) at least the number expected in a random two-coloring.…

Combinatorics · Mathematics 2020-12-16 Jacob Fox , Huy Tuan Pham , Yufei Zhao

A system of linear equations in $\mathbb{F}_p^n$ is \textit{common} if every two-colouring of $\mathbb{F}_p^n$ yields at least as many monochromatic solutions as a random two-colouring, asymptotically as $n \to \infty$. By analogy to the…

Combinatorics · Mathematics 2022-10-31 Daniel Altman

A linear configuration is said to be common in $G$ if every 2-coloring of $G$ yields at least the number of monochromatic instances of a randomly chosen coloring. Saad and Wolf asked whether, analogously to a result by Thomason in graph…

Combinatorics · Mathematics 2021-09-13 Leo Versteegen

A system of linear equations $L$ over $\mathbb{F}_q$ is common if the number of monochromatic solutions to $L$ in any two-colouring of $\mathbb{F}_q^n$ is asymptotically at least the expected number of monochromatic solutions in a random…

Combinatorics · Mathematics 2022-10-11 Nina Kamčev , Anita Liebenau , Natasha Morrison

A system of linear equations $L$ is common over $\mathbb{F}_p$ if, as $n\to\infty$, any 2-coloring of $\mathbb{F}_p^n$ gives asymptotically at least as many monochromatic solutions to $L$ as a random 2-coloring. The notion of common linear…

Combinatorics · Mathematics 2024-05-22 Dingding Dong , Anqi Li , Yufei Zhao

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

Number Theory · Mathematics 2014-05-09 Hamed Hatami , Pooya Hatami , Shachar Lovett

A system of linear equations in $\mathbb{F}_p^n$ is \textit{Sidorenko} if any subset of $\mathbb{F}_p^n$ contains at least as many solutions to the system as a random set of the same density, asymptotically as $n\to \infty$. A system of…

Combinatorics · Mathematics 2026-01-14 Daniel Altman

Let $G$ be a finite abelian group with exponent $n$, and let $r$ be a positive integer. Let $A$ be a $k\times m$ matrix with integer entries. We show that if $A$ satisfies some natural conditions and $|G|$ is large enough then, for each…

Combinatorics · Mathematics 2012-03-13 Oriol Serra , Lluís Vena

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We…

Combinatorics · Mathematics 2025-09-16 Natalie Behague , Natasha Morrison , Jonathan A. Noel

Recently it was shown that the category of cocommutative Hopf algebras over an arbitrary field $\Bbbk$ is semi-abelian. We extend this result to the category of cocommutative color Hopf algebras, i.e. of cocommutative Hopf monoids in the…

Category Theory · Mathematics 2023-05-09 Andrea Sciandra

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…

Number Theory · Mathematics 2014-02-26 W. T. Gowers , J. Wolf

Let p be a prime. We prove that if a finite group G has non-abelian Sylow p-subgroups, and the class size of every p-element in G is coprime to p; then G contains a simple group as a subquotient which exhibits the same property. In addition…

Group Theory · Mathematics 2016-11-25 Julian Brough

Let S be a smooth irreducible curve defined over a number field k and consider an abelian scheme A over S and a curve C inside A, both defined over k. In previous works, we proved that when A is a fibered product of elliptic schemes, if C…

Number Theory · Mathematics 2023-02-13 Fabrizio Barroero , Laura Capuano

A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…

Artificial Intelligence · Computer Science 2011-07-25 Thierry Boy de la Tour , Mnacho Echenim

A topological group $X$ is defined to have $compact$ $exponent$ if for some number $n\in\mathbb N$ the set $\{x^n:x\in X\}$ has compact closure in $X$. Any such number $n$ will be called a compact exponent of $X$. Our principal result…

General Topology · Mathematics 2021-11-01 Taras Banakh

Let $G$ be a semiabelian variety and $C$ a curve in $G$ that is not contained in a proper algebraic subgroup of $G$. In this situation, conjectures of Pink and Zilber imply that there are at most finitely many points contained in the…

Number Theory · Mathematics 2022-09-20 Fabrizio Barroero , Lars Kühne , Harry Schmidt

Let $A$ be an abelian variety over $\mathbb{F}_q$. Let $h_A(t)$ be the characteristic polynomial of $A$. Rybakov showed that if $h_A(t)$ is squarefree and $G$ is any finite group with $|G| = h_A(1)$, then $G = A'(\mathbb{F}_q)$ for some…

Number Theory · Mathematics 2016-12-13 Patrick Meisner

Let $\Gamma$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $\Gamma$-colorable if for some fixed orientation of $G$ and every edge labeling $\ell:E(G)\rightarrow \Gamma$, there exists a vertex coloring $c$ by the…

Combinatorics · Mathematics 2023-12-05 Bartłomiej Bosek , Jarosław Grytczuk , Grzegorz Gutowski , Oriol Serra , Mariusz Zając

The bilinear Bogolyubov argument for $\mathbb{F}_p^n$ states that if we start with a dense set $A \subseteq \mathbb{F}_p^n \times \mathbb{F}_p^n$ and carry out sufficiently many steps where we replace every row or every column of $A$ by the…

Combinatorics · Mathematics 2024-12-30 L. Milićević
‹ Prev 1 2 3 10 Next ›