English
Related papers

Related papers: Variations on the Bollob\'as set-pair theorem

200 papers

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

We say that a pair $(\mathcal{A},\mathcal{B})$ is a recovering pair if $\mathcal{A}$ and $\mathcal{B}$ are set systems on an $n$ element ground set, such that for every $A,A' \in \mathcal{A}$ and $B,B' \in \mathcal{B}$ we have that ($A…

Combinatorics · Mathematics 2015-10-27 Daniel Soltész

The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), ..., x+P_k(m), where x,m are…

Number Theory · Mathematics 2019-06-14 Thai Hoang Le , Julia Wolf

The symmetric inverse semigroup $I(X)$ on a set $X$ is the collection of all partial bijections between subsets of $X$ with composition as the algebraic operation. We study a minimal Hausdorff inverse semigroup topologies on $I(X)$. When…

General Topology · Mathematics 2020-12-08 J. Perez , C. Uzcategui

A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…

Combinatorics · Mathematics 2019-02-20 Tom Eccles

We introduce the notion of an invariantly universal pair (S,E) where S is an analytic quasi-order and E \subseteq S is an analytic equivalence relation. This means that for any analytic quasi-order R there is a Borel set B invariant under E…

Logic · Mathematics 2013-02-08 Riccardo Camerlo , Alberto Marcone , Luca Motto Ros

Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…

Combinatorics · Mathematics 2018-12-24 Pradipkumar H. Keskar , Priyanka Kumari

A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} ^*$ denote the classes of well orders and their inverses…

Logic · Mathematics 2017-11-21 Miloš S. Kurilić , Nenad Morača

We prove that if $(X, B+\mathbf{M})$ is a generalized klt pair with $K_X+B+\mathbf{M}_X$ nef and abundant, then $K_X+B+\mathbf{M}_X$ is semiample. More generally, we prove a generalized basepoint free theorem for generalized klt pairs.

Algebraic Geometry · Mathematics 2023-04-18 Priyankur Chaudhuri

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

Algebraic Geometry · Mathematics 2022-08-19 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

For two families $\mathcal{A}, \mathcal{B} \subseteq \mathcal{P}([k])$, we write $\mathcal{A}\vdash\mathcal{B}$ if $A\not\supseteq B$ for each two sets $A \in \mathcal{A}$ and $B \in \mathcal{B}$. $\mathcal{A}$ and $\mathcal{B}$ are called…

Combinatorics · Mathematics 2025-08-08 Maximilian Krone

An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given…

Data Structures and Algorithms · Computer Science 2015-06-03 Pratik Ghosal , Adam Kunysz , Katarzyna Paluch

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

Number Theory · Mathematics 2024-02-06 Mohan , Bhuwanesh Rao Patil , Ram Krishna Pandey

We prove that the union-closed sets conjecture is true for separating union-closed families $\mathcal{A}$ with $|\mathcal{A}| \leq 2\left(m+\frac{m}{\log_2(m)-\log_2\log_2(m)}\right)$ where $m$ denotes the number of elements in…

Combinatorics · Mathematics 2015-08-26 Jens Maßberg

A set of positive integers $A$ is called a $B_{h}[g]$ set if there are at most $g$ different sums of $h$ elements from $A$ with the same result. This definition has a generalization to abelian groups and the main problem related to this…

Number Theory · Mathematics 2014-12-22 Nidia Y. Caicedo , Carlos A. Gómez , Jhonny C. Gómez , Carlos A. Trujillo

A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…

Combinatorics · Mathematics 2018-03-28 Peter Nelson , Sophia Park

For any pair of real numbers $(i,j)$ with $0<i,j<1$ and $i+j=1$, we prove that the set of $p$-adic mixed $(i,j)$-badly approximable numbers $\bad_p(i, j)$ is 1/2-winning in the sense of Schmidt's game. This improves a recent result of…

Number Theory · Mathematics 2013-12-06 Yaqiao Li

An out-branching $B^+_u$ (in-branching $B^-_u$) in a digraph $D$ is a connected spanning subdigraph of $D$ in which every vertex except the vertex $u$, called the root, has in-degree (out-degree) one. A {\bf good $\mathbf{(u,v)}$-pair} in…

Combinatorics · Mathematics 2023-02-17 Joergen Bang-Jensen , Yun Wang

Many fundamental questions in additive number theory (such as Goldbach's conjecture, Fermat's last theorem, and the Twin Primes conjecture) can be expressed in the language of sum and difference sets. As a typical pair of elements…

Number Theory · Mathematics 2014-01-14 Thao Do , Archit Kulkarni , Steven J. Miller , David Moon , Jake Wellens

The two part Sperner theorem of Katona and Kleitman states that if $X$ is an $n$-element set with partition $X_1 \cup X_2$, and $\cF$ is a family of subsets of $X$ such that no two sets $A, B \in \cF$ satisfy $A \subset B$ (or $B \subset…

Combinatorics · Mathematics 2016-08-14 Dániel Gerbner , Péter L. Erdős , Nathan Lemons , Dhruv Mubayi , Cory Palmer , Balázs Patkós
‹ Prev 1 4 5 6 7 8 10 Next ›