English
Related papers

Related papers: Ramsey growth in some NIP structures

200 papers

We consider when finite families $F \subseteq \mathbb{C}[t]$ of bounded degree polynomials, or more generally of bounded complexity finite-to-finite correspondences on $\mathbb{C}$, can exhibit non-expansion of the form $|F(A)| =…

Combinatorics · Mathematics 2025-11-04 Martin Bays , Tingxiang Zou

Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that the sumset $NA$ has predictable size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in some finite cone other than all…

Combinatorics · Mathematics 2024-06-06 Andrew Granville , Jack Smith , Aled Walker

Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…

Combinatorics · Mathematics 2014-04-30 Mano Vikash Janardhanan

We prove new bounds for Ramsey numbers for book graphs $B_n$. In particular, we show that $R(B_{n-1},B_n) = 4n-1$ for an infinite family of $n$ using a block-circulant construction similar to Paley graphs. We obtain improved bounds for…

Combinatorics · Mathematics 2025-12-24 William J. Wesley

Let k be an algebraically closed field. Given an extension A : B of finite-dimensional k- algebras, we establish criteria ensuring that the representation-theoretic notion of polynomial growth is preserved under ascent and descent. These…

Representation Theory · Mathematics 2012-05-09 Rolf Farnsteiner

The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number $\varphi_R(n)$, possibly infinite, of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures…

Combinatorics · Mathematics 2014-02-14 Maurice Pouzet , Nicolas M. Thiéry

The nonnegative and positive semidefinite (PSD-) ranks are closely connected to the nonnegative and positive semidefinite extension complexities of a polytope, which are the minimal dimensions of linear and SDP programs which represent this…

Computational Complexity · Computer Science 2017-04-24 Andrii Riazanov , Mikhail Vyalyiy

The relational width of a finite structure, if bounded, is always (1,1) or (2,3). In this paper we study the relational width of first-order expansions of finitely bounded homogeneous binary cores where binary cores are structures with…

Logic in Computer Science · Computer Science 2020-05-11 Michał Wrona

We prove essentially sharp bounds for Ramsey numbers of ordered hypergraph matchings, inroduced recently by Dudek, Grytczuk, and Ruci\'{n}ski. Namely, for any $r \ge 2$ and $n \ge 2$, we show that any collection $\mathcal H$ of $n$ pairwise…

Combinatorics · Mathematics 2025-07-21 Lisa Sauermann , Dmitrii Zakharov

Built upon the proposal of Kaplan et.al. [hep-lat/0206109], we construct noncommutative lattice gauge theory with manifest supersymmetry. We show that such theory is naturally implementable via orbifold conditions generalizing those used by…

High Energy Physics - Lattice · Physics 2009-11-10 Jun Nishimura , Soo-Jong Rey , Fumihiko Sugino

We establish upper bounds on the size of the largest subset of $\{1,2,\dots,N\}$ lacking nonzero differences of the form $h(p_1,\dots,p_{\ell})$, where $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ is a fixed polynomial satisfying appropriate…

Number Theory · Mathematics 2024-05-03 John R. Doyle , Alex Rice

A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form $x$, $x+d$, $x+d^2$. We obtain a multidimensional version of this result, which can be regarded as a first step towards…

Number Theory · Mathematics 2024-07-12 Sarah Peluse , Sean Prendiville , Xuancheng Shao

The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…

Combinatorics · Mathematics 2020-12-02 Leonardo N. Coregliano , Alexander A. Razborov

We investigate interactions between Ramsey theory, topological dynamics, and model theory. We introduce various Ramsey-like properties for first order theories and characterize them in terms of the appropriate dynamical properties of the…

Logic · Mathematics 2021-11-23 Krzysztof Krupinski , Junguk Lee , Slavko Moconja

In this paper, we will develop a significantly more general notion of classical Ramsey numbers (extending most other graph-theoretic generalizations) and make some preliminary characterizations of these new Ramsey numbers using simple…

Combinatorics · Mathematics 2025-02-07 Bryce Alan Christopherson

The purpose of this article is to connect the notion of the amenability of a discrete group with a new form of structural Ramsey theory. The Ramsey theoretic reformulation of amenability constitutes a considerable weakening of the Folner…

Group Theory · Mathematics 2011-10-21 Justin Tatch Moore

We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Ne\v{s}et\v{r}il and Ossona de Mendez as a model for sparsity in graphs, is a…

Combinatorics · Mathematics 2019-02-11 Gwenaël Joret , Piotr Micek , Veit Wiechert

We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…

Combinatorics · Mathematics 2010-05-26 Manuel Bodirsky , Diana Piguet

Structures of multilinear maps are characterized by invariants. In this paper we introduce two invariants, named the isotropy index and the completeness index. These invariants capture the tensorial structure of the kernel of a multilinear…

Combinatorics · Mathematics 2025-11-03 Qiyuan Chen , Ke Ye

In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…

Number Theory · Mathematics 2024-09-16 Raf Cluckers , Itay Glazer
‹ Prev 1 8 9 10 Next ›