English
Related papers

Related papers: Standard monomials and extremal point sets

200 papers

In a recent breakthrough, Adiprasito, Avvakumov, and Karasev constructed a triangulation of the $n$-dimensional real projective space with a subexponential number of vertices. They reduced the problem to finding a small downward closed…

Combinatorics · Mathematics 2022-08-17 Peter Frankl , János Pach , Dömötör Pálvölgyi

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz

Families $\mathcal{A}_1, \mathcal{A}_2, ..., \mathcal{A}_k$ of sets are said to be \emph{cross-intersecting} if for any $i$ and $j$ in $\{1, 2, ..., k\}$ with $i \neq j$, any set in $\mathcal{A}_i$ intersects any set in $\mathcal{A}_j$. For…

Combinatorics · Mathematics 2011-03-22 Peter Borg

A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…

Combinatorics · Mathematics 2021-01-25 Peter Borg , Carl Feghali

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

The union-closed sets conjecture states that if a family of sets $\mathcal{A} \neq \{\emptyset\}$ is union-closed, then there is an element which belongs to at least half the sets in $\mathcal{A}$. In 2001, D. Reimer showed that the average…

Combinatorics · Mathematics 2017-04-25 Abigail Raz

We introduce the notion of a separator for a morphism of schemes f:T\to S; in particular, it is universal among morphisms from T to separated S-schemes. A separator is a local isomorphism; this property conveys the intuition of gluing some…

Algebraic Geometry · Mathematics 2015-10-23 Daniel Ferrand , Bruno Kahn

The joint spectral radius of a bounded set of $d \times d$ real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn…

Optimization and Control · Mathematics 2017-05-24 Kevin G. Hare , Ian D. Morris , Nikita Sidorov

Let $\mathfrak A$ be an alphabet and $W$ be a set of words in the free monoid ${\mathfrak A}^*$. Let $S(W)$ denote the Rees quotient over the ideal of ${\mathfrak A}^*$ consisting of all words that are not subwords of words in $W$. A set of…

Group Theory · Mathematics 2020-03-25 Olga Sapir

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

Combinatorics · Mathematics 2009-03-12 Jozsef Solymosi , Konrad J. Swanepoel

The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…

Combinatorics · Mathematics 2025-12-03 Cory H. Colbert

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

Combinatorics · Mathematics 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

In this article, we introduce the concept of normal families of bicomplex holomorphic functions to obtain a bicomplex Montel theorem. Moreover, we give a general definition of Fatou and Julia sets for bicomplex polynomials and we obtain a…

Complex Variables · Mathematics 2011-01-20 K. S. Charak , D. Rochon , N. Sharma

A collection of disjoint subsets ${\cal A}=\{A_1,A_2,\dotsc,A_m\}$ of a finite abelian group is said to have the \emph{bimodal} property if, for any non-zero group element $\delta$, either $\delta$ never occurs as a difference between an…

Combinatorics · Mathematics 2019-03-29 Sophie Huczynska , Maura B. Paterson

Let $D_n$ be the dihedral group with $2n$ elements, and suppose $n$ is greater than one. We call ring system a finite $D_n$-symmetric set of points in $\mathbb{R}^2$. Ring systems have been used as models for planets surrounded by rings,…

Dynamical Systems · Mathematics 2017-05-09 Eduardo S. G. Leandro

A mechanism of supersymmetry breaking in two or four-dimensions is given, in which the breaking is related to the Fermat's last theorem. It is shown that supersymmetry is exact at some irrational number points in parameter space, while it…

High Energy Physics - Theory · Physics 2015-06-26 Hitoshi Nishino

A uniform algebra $A$ on its Shilov boundary $X$ is {\em maximal} if $A$ is not $C(X)$ and there is no uniform algebra properly contained between $A$ and $C(X)$. It is {\em essentially pervasive} if $A$ is dense in $C(F)$ whenever $F$ is a…

Functional Analysis · Mathematics 2014-02-11 Pamela Gorkin , Anthony G. O'Farrell

Frankl's conjecture, also known as the union-closed sets conjecture, can be equivalently expressed in terms of intersection-closed set families by considering the complements of sets. It posits that any family of sets closed under…

Combinatorics · Mathematics 2025-04-21 Masahiro Hachimori , Kenji Kashiwabara

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

Combinatorics · Mathematics 2018-11-22 Sammy Luo

Let $(\mathcal{F},\mathcal{G})$ be a pair of families of $[n]$, where $[n]=\{1,2,...,n\}$. If $A\not\subset B$ and $B\not\subset A$ hold for all $A\in\mathcal{F}$ and $B\in\mathcal{G}$, then $(\mathcal{F},\mathcal{G})$ is called a…

Combinatorics · Mathematics 2023-07-12 Junyao Pan
‹ Prev 1 8 9 10 Next ›