English
Related papers

Related papers: On disjoint $(v,k,k-1)$ difference families

200 papers

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

Combinatorics · Mathematics 2023-05-11 Faye Jackson , Misheel Otgonbayar

We say that a family of $k$-subsets of an $n$-element set is intersecting, if any two of its sets intersect. In this paper we study different extremal properties of intersecting families, as well as the structure of large intersecting…

Combinatorics · Mathematics 2019-02-06 Andrey Kupavskii

One method of constructing $(a^2+1, 2,a, 1)$-SEDFs (i.e., strong external difference families) in $\mathbb{Z}_{a^2+1}$ makes use of $\alpha$-valuations of complete bipartite graphs $K_{a,a}$. We explore this approach and we provide a…

Combinatorics · Mathematics 2024-06-14 Donald L. Kreher , Maura B. Paterson , Douglas R. Stinson

Two finite words $u$ and $v$ are $k$-binomially equivalent if, for each word $x$ of length at most $k$, $x$ appears the same number of times as a subsequence (i.e., as a scattered subword) of both $u$ and $v$. This notion generalizes…

Formal Languages and Automata Theory · Computer Science 2020-02-03 Marie Lejeune , Michel Rigo , Matthieu Rosenfeld

In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$,…

Combinatorics · Mathematics 2026-02-24 Jie Wen , Benjian Lv

A new family of solutions of the Jacobi partial differential equations for finite-dimensional Poisson systems is investigated. This family is mathematically remarkable, as the functional dependences of the solutions appear to be associated…

Mathematical Physics · Physics 2019-10-22 Benito Hernández-Bermejo

Following the work of Totaro and Pereira, we study sufficient conditions under which collections of pairwise-disjoint divisors on a variety over an algebraically closed field are contained in the fibers of a morphism to a curve. We prove…

Algebraic Geometry · Mathematics 2016-01-21 Fedor A. Bogomolov , Alena Pirutka , Aaron Michael Silberstein

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…

Combinatorics · Mathematics 2015-09-02 Fabrício S. Benevides , Dániel Gerbner , Cory T. Palmer , Dominik K. Vu

We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…

Logic · Mathematics 2011-11-01 Dilip Raghavan , Saharon Shelah

In this paper we study two directions of extending the classical Erd\H os-Ko-Rado theorem which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…

Combinatorics · Mathematics 2019-05-31 Peter Frankl , Andrey Kupavskii

Let $A$ be an integral $k$-algebra of finite type over a field $k$ of characteristic zero. Let ${\cal{F}}$ be a family of $k$-derivations on $A$ and $M_{\cal{F}}$ the $A$-module spanned by ${\cal{F}}$. In this paper, we generalize a result…

Commutative Algebra · Mathematics 2007-05-23 Philippe Bonnet

In this paper we study the derived categories of coherent sheaves on Grassmannians $\operatorname{Gr}(k,n),$ defined over the ring of integers. We prove that the category $D^b(\operatorname{Gr}(k,n))$ has a semi-orthogonal decomposition,…

Algebraic Geometry · Mathematics 2025-02-10 Alexander I. Efimov

Let $S_{g}$ denote the genus $g$ closed orientable surface. For $k\in \mathbb{N}$, a $k$-system is a collection of pairwise non-homotopic simple closed curves such that no two intersect more than $k$ times. Juvan-Malni\v{c}-Mohar…

Geometric Topology · Mathematics 2016-02-25 Tarik Aougab

For an integer $d \geq 2$, a family $\mathcal{F}$ of sets is $\textit{$d$-wise intersecting}$ if for any distinct sets $A_1,A_2,\dots,A_d \in \mathcal{F}$, $A_1 \cap A_2 \cap \dots \cap A_d \neq \emptyset$, and $\textit{non-trivial}$ if…

Combinatorics · Mathematics 2019-11-05 Jason O'Neill , Jacques Verstraete

A generalization of the Davenport constant is investigated. For a finite abelian group $G$ and a positive integer $k$, let $D_k(G)$ denote the smallest $\ell$ such that each sequence over $G$ of length at least $\ell$ has $k$ disjoint…

Number Theory · Mathematics 2010-08-05 Michael Freeze , Wolfgang A. Schmid

A family $\mathcal{F}$ on ground set $\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if every collection of $k$ sets in $\mathcal{F}$ has non-empty intersection, and no other set can be added to $\mathcal{F}$ while maintaining this…

Combinatorics · Mathematics 2022-06-30 József Balogh , Ce Chen , Haoran Luo

For a positive integer $d\geq 2$, a family $\mathcal F\subseteq \binom{[n]}{k}$ is said to be d-wise intersecting if $|F_1\cap F_2\cap \dots\cap F_d|\geq 1$ for all $F_1, F_2, \dots ,F_d\in \mathcal F$. A d-wise intersecting family…

Combinatorics · Mathematics 2023-06-08 Menglong Zhang , Tao Feng

We study a generalized class of weighted $k$-regular partitions defined by \[ \sum_{n=0}^{\infty} c_{k, r_1, r_2}(n) q^n = \prod_{n=1}^{\infty} \frac{(1 - q^{nk})^{r_1}}{(1 - q^n)^{r_2}}, \] which extends the classical $k$-regular partition…

Number Theory · Mathematics 2025-12-05 Debika Banerjee , Ben Kane

A $k$-modal sequence is a sequence of real numbers that can be partitioned into $k+1$ (possibly empty) monotone sections such that adjacent sections have opposite monotonicities. For every positive integer $k$, we prove that any sequence of…

Combinatorics · Mathematics 2024-03-21 Zijian Xu