English
Related papers

Related papers: The asymptotic existence of BIBDs having a nesting

200 papers

A general study of the fermionic structure of the 331 models with \beta arbitrary shows the possibility of obtaining 331 vector-like models with mirror fermions. On one hand, the existence of mirror fermions gives a possible way to fit the…

High Energy Physics - Phenomenology · Physics 2007-05-23 Rodolfo A. Diaz , R. Martinez , F. Ochoa

A family $\mathcal{F}\subset 2^G$ of subsets of an abelian group $G$ is a Sidon system if the sumsets $A+B$ with $A,B\in \mathcal{F}$ are pairwise distinct. Cilleruelo, Serra and the author previously proved that the maximum size $F_k(n)$…

Combinatorics · Mathematics 2024-02-20 Maximilian Wötzel

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Combinatorics · Mathematics 2023-03-22 Marco Buratti , Dieter Jungnickel

It was proved in 2009 that any partial Steiner triple system of order $u$ has an embedding of order $v$ for each admissible integer $v\geq 2u+1$. This result is best-possible in the sense that, for each $u\geq 9$, there exists a partial…

Combinatorics · Mathematics 2014-02-13 Daniel Horsley

We provide combinatorial and numerical criteria to characterize affine type A bow diagrams giving rise to a non-empty bow variety. The key idea is to prove that such diagrams correspond to supersymmetric brane systems in type IIB string…

Representation Theory · Mathematics 2025-04-29 Tiziano Gaibisso

A set of $N$ permutations of $\{1,2,\dots,v\}$ is $(N,v,t)$-suitable if each symbol precedes each subset of $t-1$ others in at least one permutation. The central problems are to determine the smallest $N$ for which such a set exists for…

Combinatorics · Mathematics 2016-12-02 Justin H. C. Chan , Jonathan Jedwab

Let $k$ be a number field and $B$ be a central simple algebra over $k$ of dimension $p^2$ where $p$ is prime. In the case that $p=2$ we assume that $B$ is not totally definite. In this paper we study sets of pairwise nonisomorphic maximal…

Number Theory · Mathematics 2014-09-04 Benjamin Linowitz

Square Heffter arrays are $n\times n$ arrays such that each row and each column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…

Combinatorics · Mathematics 2019-07-29 K. Burrage , Nicholas J. Cavenagh , D. Donovan , E. Ş. Yazıcı

A \emph{set partition} of the set $[n]=\{1,...c,n\}$ is a collection of disjoint blocks $B_1,B_2,...c, B_d$ whose union is $[n]$. We choose the ordering of the blocks so that they satisfy $\min B_1<\min B_2<...b<\min B_d$. We represent such…

Combinatorics · Mathematics 2007-05-23 Vit Jelinek , Toufik Mansour

We introduce an analogue of the Novikov Conjecture on higher signatures in the context of the algebraic geometry of (nonsingular) complex projective varieties. This conjecture asserts that certain "higher Todd genera" are birational…

Algebraic Geometry · Mathematics 2011-03-10 Jonathan Rosenberg

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

Discrete Mathematics · Computer Science 2016-06-24 Dmitry N. Kozlov

Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…

Combinatorics · Mathematics 2021-03-24 William M. Kantor

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

Combinatorics · Mathematics 2014-02-26 Gareth A. Jones

A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain…

Combinatorics · Mathematics 2020-07-02 Shachar Lovett , Sankeerth Rao , Alexander Vardy

Let $\phi(k)$ be the minimum number of vertices in a non-$k$-choosable $k$-chromatic graph. The Ohba conjecture, confirmed by Noel, Reed and Wu, asserts that $\phi(k) \ge 2k+2$. This bound is tight if $k$ is even. If $k$ is odd, then it is…

Combinatorics · Mathematics 2019-10-29 Jialu Zhu , Xuding Zhu

We prove Brauer's k(B)-Conjecture for the 3-blocks with abelian defect groups of rank at most 5 and for all 3-blocks of defect at most 4. For this purpose we develop a computer algorithm to construct isotypies based on a method of Usami and…

Representation Theory · Mathematics 2019-11-26 Cesare G. Ardito , Benjamin Sambale

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

Combinatorics · Mathematics 2024-12-13 Ishay Haviv , Sam Mattheus , Aleksa Milojević , Yuval Wigderson

We give an explicit family of polynomial maps called center unstable H\'enon-like maps and prove that they exhibits blenders for some parametervalues. Using this family, we also prove the occurrence of blenders near certain non-transverse…

Dynamical Systems · Mathematics 2014-03-05 Lorenzo J. Díaz , Shin Kiriki , Katsutoshi Shinohara

We propose a new approach to studies on partial Steiner triple systems consisting in determining complete graphs contained in them. We establish the structure which complete graphs yield in a minimal PSTS that contains them. As a by-product…

Combinatorics · Mathematics 2014-10-30 M. Prażmowska , K. Prażmowski

A $(v, k, \lambda)$ symmetric design is said to have the symmetric difference property (SDP) if the symmetric difference of any three blocks is either a block or the complement of a block. Symmetric designs fulfilling this property have the…

Combinatorics · Mathematics 2021-11-12 Andrew Clickard