English
Related papers

Related papers: How to drive our families mad

200 papers

Let $p$ a large enough prime number. When $A$ is a subset of $\mathbb{F}_p\smallsetminus\{0\}$ of cardinality $|A|> (p+1)/3$, then an application of Cauchy-Davenport Theorem gives $\mathbb{F}_p\smallsetminus\{0\}\subset A(A+A)$. In this…

Number Theory · Mathematics 2019-05-29 Pierre-Yves Bienvenu , François Hennecart , Ilya Shkredov

We show that the family ${\cal F}_k$ of all meromorphic functions $f$ in a domain $D$ satisfying $$\frac{|f^{(k)}|}{1+|f|}(z)\ge C \qquad \mbox{ for all } z\in D$$ (where $k$ is a natural number and $C>0$) is quasi-normal. The proof relies…

Complex Variables · Mathematics 2017-11-15 Jürgen Grahl , Shahar Nevo

Hereditarily finite sets (sets which are finite and have only hereditarily finite sets as members) are basic mathematical and computational objects, and also stand at the basis of some programming languages. This raises the need for…

Logic in Computer Science · Computer Science 2014-11-11 Giorgio Audrito , Alexandru I. Tomescu , Stephan Wagner

For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl…

Combinatorics · Mathematics 2024-12-02 Yan zilong , Peng Yuejian

We prove that the cohomology groups of a definably compact set over an o-minimal expansion of a group are finitely generated and invariant under elementary extensions and expansions of the language. We also study the cohomology of the…

Logic · Mathematics 2010-09-28 Alessandro Berarducci , Antongiulio Fornasiero

In this short note, we address two problems in extremal set theory regarding intersecting families. The first problem is a question posed by Kupavskii: is it true that given two disjoint cross-intersecting families $\mathcal{A}, \mathcal{B}…

Combinatorics · Mathematics 2018-05-01 Hao Huang

A non-nilpotent variety of algebras is almost nilpotent if any proper subvariety is nilpotent. Let the base field be of characteristic zero. It has been shown that for associative or Lie algebras only one such variety exists. Here we…

Rings and Algebras · Mathematics 2017-01-24 S. Mishchenko , A. Valenti

We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length…

Logic · Mathematics 2026-03-13 Farmer Schlutzenberg

We examine a parameterized family of functions F_a, all of which are continuous and some of which are nowhere or almost nowhere differentiable, we explore the behavior of F'_a and F"_a almost everywhere for different values of a, focusing…

Dynamical Systems · Mathematics 2016-02-04 Joey McCollum

Let $n$, $k$ and $t$ be positive integers, and let $\mathcal{F}$ be a collection of $k$-subsets of $[n]=\{1,2,\dots,n\}$. The $t$-covering number $\tau_t(\mathcal{F})$ of $\mathcal{F}$ is defined as the minimum size of a set $T$ such that…

Combinatorics · Mathematics 2026-05-20 Yu Zhu , Benjian Lv , Kaishun Wang

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

Algebraic Geometry · Mathematics 2013-10-22 Abdallah Assi

A disjoint $(v,k,k-1)$ difference family in an additive group $G$ is a partition of $G\setminus\{0\}$ into sets of size $k$ whose lists of differences cover, altogether, every non-zero element of $G$ exactly $k-1$ times. The main purpose of…

Combinatorics · Mathematics 2017-05-16 Marco Buratti

We show that there is an effectively closed maximal eventually different family of functions in spaces of the form $\prod_n F(n)$ for $F\colon \mathbb{N} \to \mathbb{N}\cup\{\mathbb{N}\}$ and give an exact criterion for when there exists an…

Logic · Mathematics 2022-10-11 David Schrittesser

A family $\mathcal{A}$ of sets is said to be \emph{$t$-intersecting} if any two sets in $\mathcal{A}$ have at least $t$ common elements. A central problem in extremal set theory is to determine the size or structure of a largest…

Combinatorics · Mathematics 2011-07-01 Peter Borg

We consider a family, $\mathcal{F}$, of subsets of an $n$-set such that the cardinality of the symmetric difference of any two elements $F,F'\in\mathcal{F}$ is not a multiple of 4. We prove that the maximal size of $\mathcal{F}$ is bounded…

Combinatorics · Mathematics 2014-03-28 Sophie Morier-Genoud , Valentin Ovsienko

We prove that if two families $\mathcal{F} \subseteq \binom{[n]}{k}$ and $\mathcal{F}' \subseteq \binom{[n]}{k'}$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert \geq \ell^2t - \ell +1$ for every choice of distinct $F_1,…

Combinatorics · Mathematics 2026-01-29 Jiangdong Ai , Ming Chen , Seokbeom Kim , Hyunwoo Lee

Let $3\le d\le k$ and $\nu\ge 0$ be fixed and $\mathcal{F}\subset\binom{[n]}{k}$. The matching number of $\mathcal{F}$, denoted by $\nu(\mathcal{F})$, is the maximum number of pairwise disjoint sets in $\mathcal{F}$, and $\mathcal{F}$ is…

Combinatorics · Mathematics 2019-11-11 Xizhi Liu

We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label…

Representation Theory · Mathematics 2014-10-09 Rowena Paget , Mark Wildon

Let $\mathcal{F}$ be a family of $k$-dimensional subspaces of an $n$-dimensional vector space. Write $\mathcal{D}_{\mathcal{F}}(H;t)=\{F\in \mathcal{F}\colon \dim(F\cap H)\leq t \}$ for a subspace $H$. The family $\mathcal{F}$ is called…

Combinatorics · Mathematics 2024-12-19 Shuhui Yu , Lijun Ji

This paper defines weak-$\alpha$-supermodularity for set functions. Many optimization objectives in machine learning and data mining seek to minimize such functions under cardinality constrains. We prove that such problems benefit from a…

Data Structures and Algorithms · Computer Science 2015-02-24 Christos Boutsidis , Edo Liberty , Maxim Sviridenko