English
Related papers

Related papers: Definable $(\omega, 2)$-theorem for families with …

200 papers

Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…

Combinatorics · Mathematics 2013-05-06 Richard P. Anstee , Linyuan Lu

A family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the…

Combinatorics · Mathematics 2007-05-23 Robert Morris

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

Logic · Mathematics 2016-07-07 Frank Olaf Wagner

Let $f : X \to S$ be a family of smooth projective algebraic varieties over a smooth connected quasi-projective base $S$, and let $\mathbb{V} = R^{2k} f_{*} \mathbb{Z}(k)$ be the integral variation of Hodge structure coming from degree $2k$…

Algebraic Geometry · Mathematics 2023-08-21 David Urbanik

We show that any formula with two free variables in a VC-minimal theory has VC-codensity at most two. Modifying the argument slightly, we give a new proof of the fact that, in a VC-minimal theory where acl = dcl, the VC-codensity of a…

Logic · Mathematics 2014-09-30 Vincent Guingona

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

Combinatorics · Mathematics 2010-10-06 Vikram Kamat

In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…

Logic in Computer Science · Computer Science 2011-02-02 Wil Dekkers

We give examples of $\mathrm{NIP}$ structures in which new algebraic structure appears in the Shelah completion. In particular we construct a weakly o-minimal structure $\mathscr{M}$ such that $\mathscr{M}$ does not interpret an infinite…

Logic · Mathematics 2026-05-13 Erik Walsberg

A collection of sets $\Fscr$ has the $(p,q)$-property if out of every $p$ elements of $\Fscr$ there are $q$ that have a point in common. A transversal of a collection of sets $\Fscr$ is a set $A$ that intersects every member of $\Fscr$.…

Combinatorics · Mathematics 2012-01-04 Tobias Muller

We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…

Logic · Mathematics 2022-08-23 Will Johnson

The prepotential of N=2* supersymmetric theories with unitary gauge groups in an Omega-background satisfies a modular anomaly equation that can be recursively solved order by order in an expansion for small mass. By requiring that S-duality…

High Energy Physics - Theory · Physics 2015-10-23 M. Billo , M. Frau , F. Fucito , A. Lerda , J. F. Morales

This is the second in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…

Combinatorics · Mathematics 2024-03-22 Joshua Nevin

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

Combinatorics · Mathematics 2025-04-02 Ramesh Prasad Panda

Let $k\geq 2$ and $n\geq 3(k-1)$. Let $\mathcal{F}$ and $\mathcal{G}$ be families of $k$-element subsets of an $n$-element set. Suppose that $|F\cap G|\geq 2$ for all $F\in\mathcal{F}$ and $G\in\mathcal{G}$. We show that…

Combinatorics · Mathematics 2025-03-20 Hajime Tanaka , Norihide Tokushige

Let $k$ be an integer. We prove a rough structure theorem for separations of order at most $k$ in finite and infinite vertex transitive graphs. Let $G = (V,E)$ be a vertex transitive graph, let $A \subseteq V$ be a finite vertex-set with…

Combinatorics · Mathematics 2011-10-24 Matt DeVos , Bojan Mohar

A $2-(n,4,\lambda)$ design $(\Omega, \mathcal{B})$ is said to be supersimple if distinct lines intersect in at most two points. From such a design, one can construct a certain subset of Sym$(\Omega)$ called a "Conway groupoid". The…

Group Theory · Mathematics 2015-10-23 Nick Gill , Neil I. Gillespie , Cheryl E. Praeger , Jason Semeraro

Katona's intersection theorem states that every intersecting family $\mathcal F\subseteq[n]^{(k)}$ satisfies $\vert\partial\mathcal F\vert\geq\vert\mathcal F\vert$, where $\partial\mathcal F=\{F\setminus x:x\in F\in\mathcal F\}$ is the…

Combinatorics · Mathematics 2022-06-10 Marcelo Sales , Bjarne Schülke

Let $n\in\omega$. The weak choice principle $\operatorname{RC}_n$ states that for every infinite set $x$ there is an infinite subset $y\subseteq x$ with a choice function on $[y]^n:=\{z\subseteq y\mid \lvert z\rvert =n\}$.…

Logic · Mathematics 2021-01-20 Lorenz Halbeisen , Salome Schumacher

Let $N$ be a normal subgroup of a finite group $G$. For a faithful $N$-set $\Delta$, applying the university embedding theorem one can construct a faithful $G$-set $\Omega$. In this short note, it is proved that if the $2$-closure of $N$ in…

Group Theory · Mathematics 2022-02-23 Gang Chen , Qing Ren

Let $\mathcal{A}$ and $\matchcal{B}$ denote two families of subsets of an $n$-element set. The pair $(\mathcal{A},\mathcal{B})$ is said to be $\ell$-cross-intersecting iff $|A\cap B| = \ell$ for all $A\in\mathcal{A}$ and $B\in\mathcal{B}$.…

Combinatorics · Mathematics 2007-05-23 Noga Alon , Eyal Lubetzky
‹ Prev 1 8 9 10 Next ›