English
Related papers

Related papers: The asymptotic existence of BIBDs having a nesting

200 papers

Erd\"os conjectured the existence of an infinite Sidon sequence of positive integers which is also an asymptotic basis of order 3. We make progress towards this conjecture in several directions. First we prove the conjecture for all cyclic…

Number Theory · Mathematics 2013-04-25 Javier Cilleruelo

In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph $G$ with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-'…

Data Structures and Algorithms · Computer Science 2016-03-10 Megasthenis Asteris , Anastasios Kyrillidis , Dimitris Papailiopoulos , Alexandros G. Dimakis

Given a family $\mathcal F$ of $k$-element sets, $S_1,\ldots,S_r\in\mathcal F$ form an {\em $r$-sunflower} if $S_i \cap S_j =S_{i'} \cap S_{j'}$ for all $i \neq j$ and $i' \neq j'$. According to a famous conjecture of Erd\H os and Rado…

Combinatorics · Mathematics 2021-03-29 Jacob Fox , Janos Pach , Andrew Suk

We show that given integers $N$, $d$ and $n$ such that ${N\ge2}$, ${(N,d,n)\ne(2,2,5)}$, and ${N+1\le n\le\tbinom{d+N}{N}}$, there is a family of $n$ monomials in $K[X_0,\ldots,X_N]$ of degree $d$ such that their syzygy bundle is stable.…

Algebraic Geometry · Mathematics 2017-11-16 Pedro Macias Marques , Rosa María Miró-Roig

Let $\varphi (x_{1}, \ldots, x_{h})=c_{1} x_{1}+\cdots+c_{h} x_{h}$ be a linear form with coefficients in a field $\mathbf{F}$, and let $V$ be a vector space over $\mathbf{F}$. A nonempty subset $A$ of $V$ is a $\varphi$-Sidon set if…

Number Theory · Mathematics 2021-12-01 Csaba Sándor , Quan-Hui Yang , Jun-Yu Zhou

In the paper we study inverse semigroups $\mathscr{B}(G)$, $\mathscr{B}^+(G)$, $\bar{\mathscr{B}}(G)$ and $\bar{\mathscr{B}}\,^+(G)$ which are generated by partial monotone injective translations of a positive cone of a linearly ordered…

Group Theory · Mathematics 2012-01-04 Oleg Gutik , Dušan Pagon , Kateryna Pavlyk

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

Group Theory · Mathematics 2010-04-22 Ben Fairbairn

This paper investigates $2$-$(v,5,\lambda)$ designs $\mathcal{D}$ admitting a block-transitive automorphism group $G$. We first prove that if $G$ is point-imprimitive, then $v$ must be one of 16, 21, or 81. We further provide a complete…

Group Theory · Mathematics 2025-05-26 Chuhan Lei , Xiaoqin Zhan

For some families of two-bridge knots, including double-twist knots with genus at least four, we determine precisely the set of integers $n>1$ such that the fundamental group of the $n$-fold cyclic branched cover of the 3-sphere along these…

Geometric Topology · Mathematics 2020-02-26 Hannah Turner

An ordered matching of size $n$ is a graph on a linearly ordered vertex set $V$, $|V|=2n$, consisting of $n$ pairwise disjoint edges. There are three different ordered matchings of size two on $V=\{1,2,3,4\}$: an alignment…

Combinatorics · Mathematics 2024-04-25 Andrzej Dudek , Jarosław Grytczuk , Andrzej Ruciński

In the first half of this article, we review the Steinberg theory for double flag varieties for symmetric pairs. For a special case of the symmetric space of type AIII, we will consider $ X = GL_{2n}/P_{(n,n)} \times GL_n / B_n^+ \times…

Representation Theory · Mathematics 2021-05-14 Lucas Fresse , Kyo Nishiyama

Let $n$, $s$, and $k$ be positive integers. We say that a sequence $f_1,\dots,f_s$ of nonnegative integers is satisfying if for any collection of $s$ families $\mathcal F_1,\dots,\mathcal F_s\subseteq [n]^k$ such that $|\mathcal F_i|=f_i$…

Combinatorics · Mathematics 2025-08-12 Pitchayut Saengrungkongka

We construct a stable homotopy type invariant for any Legendrian submanifold in a jet bundle equipped with a linear-at-infinity generating family. We show that this spectrum lifts the generating family homology groups. When the generating…

Symplectic Geometry · Mathematics 2025-06-11 Hiro Lee Tanaka , Lisa Traynor

A partial $(n,k,t)_\lambda$-system is a pair $(X,\mathcal{B})$ where $X$ is an $n$-set of vertices and $\mathcal{B}$ is a collection of $k$-subsets of $X$ called blocks such that each $t$-set of vertices is a subset of at most $\lambda$…

Combinatorics · Mathematics 2023-11-23 Daniel Horsley , Padraig Ó Catháin

We consider hereditary classes of graphs equipped with a total order. We provide multiple equivalent characterisations of those classes which have bounded twin-width. In particular, we prove a grid theorem for classes of ordered graphs…

Logic in Computer Science · Computer Science 2021-07-07 Pierre Simon , Szymon Toruńczyk

Our purpose in this paper is to construct new examples of twisted Brill Noether loci on curves of genus g greater than 2 with negative expected dimension. We begin by completing the proof of Butler's conjecture for coherent systems of…

Algebraic Geometry · Mathematics 2026-04-21 L. Brambila-Paz , P. E. Newstead

The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer…

Dynamical Systems · Mathematics 2012-04-23 Keenan Monks , Kenneth G. Monks , Kenneth M. Monks , Maria Monks

Let $\pi$ and $\lambda$ be two set partitions with the same number of blocks. Assume $\pi$ is a partition of $[n]$. For any integer $l, m \geq 0$, let $\mathcal{T}(\pi, l)$ be the set of partitions of $[n+l]$ whose restrictions to the last…

Combinatorics · Mathematics 2007-10-10 Svetlana Poznanovik , Catherine Yan

We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…

Data Structures and Algorithms · Computer Science 2019-10-10 Giulio Cerbai , Lapo Cioni , Luca Ferrari

A graph is almost bipartite if it contains exactly one odd cycle, and it is Konig-Egervary if the sum of the independence number and the matching number equals the order of the graph. We introduce the class of Bipartite-Almost Bipartite…

Combinatorics · Mathematics 2026-03-12 Kevin Pereyra