English
Related papers

Related papers: Thresholds for $(n,q,2)$-Steiner Systems via Refin…

200 papers

In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…

Combinatorics · Mathematics 2025-08-01 Michelle Delcourt , Cicely , Henderson , Thomas Lesgourgues , Luke Postle

We find the (unique) largest subset of $\{0, 1, 2\}^n$ such that it contains no two elements, one of which is coordinatewise greater than the other, but strictly greater on at most $k$ coordinates. To do so, we decompose the cube into…

Combinatorics · Mathematics 2025-10-01 Yaël Dillies , Matthew Johnson , Aleksandra Kowalska

We prove that if $G$ is a finitely generated group and $Z$ is a uniformly recurrent subgroup of $G$ then there exists a minimal system $(X,G)$ with $Z$ as its stability system. This answers a query of Glasner and Weiss \cite{GW} in the case…

Dynamical Systems · Mathematics 2017-02-07 Gabor Elek

Let $H(n, q^2)$ be a non-degenerate Hermitian variety of $PG(n, q^2)$, $n \ge 2$. Let NU$(n+1, q^2)$ be the graph whose vertices are the points of $PG(n, q^2) \setminus H(n, q^2)$ and two vertices $P_1$, $P_2$ are adjacent if the line…

Combinatorics · Mathematics 2021-06-16 Ferdinand Ihringer , Francesco Pavese , Valentino Smaldore

In this paper, using the well-known Karlsson-Minton formula, we mainly establish two divisibility results concerning truncated hypergeometric series. Let $n>2$ and $q>0$ be integers with $2\mid n$ or $2\nmid q$. We show that…

Number Theory · Mathematics 2020-02-25 Chen Wang , Wei Xia

For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…

Combinatorics · Mathematics 2008-04-07 Raphael Yuster

An interesting, and still wide open, conjecture of Reiner and Stanton predicts that certain "strange" symmetric differences of $q$-binomial coefficients are always nonnegative and unimodal. We extend their conjecture to a broader, and…

Combinatorics · Mathematics 2019-09-30 Richard P. Stanley , Fabrizio Zanello

This paper is concerned with extensions of geometric stability theory to some nonelementary classes. We prove the following theorem: Theorem: Let C be a large homogeneous model of a stable diagram D. Let p, q in S_D(A), where p is…

Logic · Mathematics 2007-05-23 Tapani Hyttinen , Olivier Lessmann , Saharon Shelah

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

Number Theory · Mathematics 2021-10-22 He-Xia Ni

We consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field and its subgraph $\Gamma(n,k)_q$ formed by non-degenerate linear $[n,k]_q$ codes. We assume that $1<k<n-1$. It is…

Combinatorics · Mathematics 2022-09-30 Mark Pankov

We investigate the generalized involution models of the projective reflection groups $G(r,p,q,n)$. This family of groups parametrizes all quotients of the complex reflection groups $G(r,p,n)$ by scalar subgroups. Our classification is…

Combinatorics · Mathematics 2014-07-01 Fabrizio Caselli , Eric Marberg

We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…

Combinatorics · Mathematics 2013-01-10 Philippe Cara , Sara Rottey , Geertrui Van de Voorde

We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ conditioned on triangle-freeness? Can we efficiently approximate the probability that $G(n,p)$…

Data Structures and Algorithms · Computer Science 2024-10-31 Matthew Jenssen , Will Perkins , Aditya Potukuchi , Michael Simkin

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

Combinatorics · Mathematics 2009-06-16 Victor Reiner , Dennis Stanton

The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…

Combinatorics · Mathematics 2020-08-12 Fengming Dong , Jun Ge , Helin Gong , Bo Ning , Zhangdong Ouyang , Eng Guan Tay

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

Combinatorics · Mathematics 2026-03-02 Michael Krivelevich , Alan Lew , Peleg Michaeli

If $N \subset P,Q \subset M$ are type II_1 factors with $N' \cap M = C id$ and $[M:N]$ finite we show that restrictions on the standard invariants of the elementary inclusions $N \subset P$, $N \subset Q$, $P \subset M$ and $Q \subset M$…

Operator Algebras · Mathematics 2007-05-23 Pinhas Grossman , Vaughan F. R. Jones

As a natural generalization of the Legendre symbol, the $q$-th power residue symbol $(a/p)_q$ is defined for primes $p$ and $q$ with $p\equiv 1 \bmod q$. In this paper, we generalize the second supplementary law by providing an explicit…

Number Theory · Mathematics 2025-06-10 Yoshinosuke Hirakawa , Tomokazu Kashio , Ryutaro Sekigawa , Naoaki Takada , Shuji Yamamoto

We show that a random subset of the rank-$n$ projective geometry $\text{PG}(n-1,q)$ is, with high probability, not $(b,c)$-decomposable: if $k$ is its colouring number, it does not admit a partition of its ground set into classes of size at…

Combinatorics · Mathematics 2022-08-11 Jorn van der Pol

We study the isomorphism problem for random hypergraphs. We show that it is solvable in polynomial time for the binomial random $k$-uniform hypergraph $H_{n,p;k}$, for a wide range of $p$. We also show that it is solvable w.h.p. for random…

Combinatorics · Mathematics 2021-03-11 Debsoumya Chakraborti , Alan Frieze , Simi Haber , Mihir Hasabnis