English
Related papers

Related papers: Maximal Sidon Sets and Matroids

200 papers

A family C of circuits of a matroid M is a linear class if, given a modular pair of circuits in C}, any circuit contained in the union of the pair is also in C. The pair (M,C) can be seen as a matroidal generalization of a biased graph. We…

Combinatorics · Mathematics 2007-05-23 Raul Cordovil , David Forge

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Given a nonnegative integer $h$, the $h$-fold sumset $hA$ is the set of all sums of $h$ elements of $A$, and the restricted $h$-fold sumset $h^\wedge A$ is the set of all…

Number Theory · Mathematics 2025-08-19 Vivekanand Goswami , Raj Kumar Mistri

Motivated by the geometry of certain hyperplane arrangements, Manin and Schechtman defined for each positive integer n a hierarchy of finite partially ordered sets B(n, k), indexed by positive integers k, called the higher Bruhat orders.…

Representation Theory · Mathematics 2015-08-14 Seth Shelley-Abrahamson , Suhas Vijaykumar

We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…

Combinatorics · Mathematics 2011-07-26 Michele D'Adderio , Luca Moci

Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_{\lambda}(2,3,v) can be defined as a vx(\lambda/3)\binom{v}{2} (0,1)-matrix with…

Combinatorics · Mathematics 2019-09-18 R. P. Anstee , Farzin Barekat

Let k be a field not of characteristic two and L be a set of almost all rational primes invertible in k. Suppose we have a variety X/k and strictly compatible system {M_ell -> X : ell in L} of constructible F_ell-sheaves. If the system is…

Number Theory · Mathematics 2007-05-23 Chris Hall

Let (G, *) be a semigroup, D subset of G, and n >= 2 be an integer. We say that (D, *) is an n-closed subset of G if a_1* ... *a_n in D for every a_1, ..., a_n in D. Hence every closed set is a 2-closed set. The concept of n-closed sets…

Group Theory · Mathematics 2011-07-27 Ayman Badawi

The growth-rate function for a minor-closed class $\mathcal{M}$ of matroids is the function $h$ where, for each non-negative integer $r$, $h(r)$ is the maximum number of elements of a simple matroid in $\mathcal{M}$ with rank at most $r$.…

Combinatorics · Mathematics 2016-04-18 Jim Geelen , Peter Nelson

Let $h,k \ge 2$ be integers. A set $A$ of positive integers is called asymptotic basis of order $k$ if every large enough positive integer can be written as the sum of $k$ terms from $A$. A set of positive integers $A$ is said to be a…

Number Theory · Mathematics 2022-03-01 Sándor Z. Kiss , Csaba Sándor

Erd\H{o}s Problem 30 asks for sharp asymptotics of the Sidon extremal function $h(N)$, and Singer's construction is the classical source of lower-bound examples matching the main term. We present a Lean 4 formalization of Singer's Sidon set…

Combinatorics · Mathematics 2026-05-13 David B. Hulak , Arthur F. Ramos , Ruy J. G. B. de Queiroz

The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set $A$ of positive numbers, one can find asymptotic lower bounds for $\max\{|A+A|,|A\cdot A|\}$ of the order of $|A|^{1+\delta}$ for every $\delta <1$. In…

Combinatorics · Mathematics 2013-05-07 J. A. Dias da Silva , Pedro J. Freitas

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. A submonoid $M$ generated by $k$ elements of $A^*$ is…

Formal Languages and Automata Theory · Computer Science 2019-06-10 Giuseppa Castiglione , Gabriele Fici , Antonio Restivo

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Sergei Konyagin , James Maynard , Carl Pomerance , Terence Tao

In this paper, we first give new generalizations for third-order Horadam $\{H_{n}^{(3)}\}_{n\in \mathbb{N}}$ and generalized Tribonacci $\{h_{n}^{(3)}\}_{n\in \mathbb{N}}$ sequences for classic Horadam and generalized Fibonacci numbers.…

Combinatorics · Mathematics 2019-01-01 Gamaliel Cerda-Morales

A saturated D-optimal design is a {+1,-1} square matrix of given order with maximal determinant. We search for saturated D-optimal designs of orders 19 and 37, and find that known matrices due to Smith, Cohn, Orrick and Solomon are optimal.…

Combinatorics · Mathematics 2015-03-13 Richard P. Brent , William Orrick , Judy-anne Osborn , Paul Zimmermann

A totally symmetric set is a subset of a group such that every permutation of the subset can be realized by conjugation in the group. The (non-)existence of large totally symmetric sets obstruct homomorphisms, so bounds on the sizes of…

Group Theory · Mathematics 2022-08-22 Noah Caplinger

In this paper, we establish some criteria to detect the presence of the maximal ideal $(x_1, \ldots, x_n)$ in the set of associated primes of powers of monomial ideals in the polynomial ring $K[x_1, \ldots, x_n]$. Furthermore, for each of…

Commutative Algebra · Mathematics 2026-05-25 Mehrdad Nasernejad , Jonathan Toledo

For a positive integer $n$, let $g(n)$ denote the infimum of all real numbers $L$ such that there exists a multiplicative Sidon set $A\subseteq\{1,2,\dots,n\}$ that intersects every interval $[x,x+L]\subseteq[1,n]$. S\'ark\"ozy asked for…

Number Theory · Mathematics 2026-05-05 Wouter van Doorn , Pietro Monticone , Quanyu Tang

Let $G$ be a finite group and $S$ a subset of $G$. Then $S$ is product-free if $S \cap SS = \emptyset$, and complete if $G^{\ast} \subseteq S \cup SS$. A product-free set is locally maximal if it is not contained in a strictly larger…

Combinatorics · Mathematics 2016-10-03 Chimere S. Anabanti , Grahame Erskine , Sarah B. Hart