相关论文: A Bollob\'as-type problem: from root systems to Er…

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

A family $\F$ of sets is said to be intersecting if any two sets in $\F$ have nonempty intersection. The celebrated Erd{\H o}s-Ko-Rado theorem determines the size and structure of the largest intersecting family of $k$-sets on an $n$-set…

We continue our investigation of Erd\H{o}s-Ko-Rado (EKR) sets of flags in spherical buildings. In previous work, we used the theory of buildings and Iwahori-Hecke algebras to obtain upper bounds on their size. As the next step towards the…

Let $X$ be an $n$--element finite set, $0<k\leq n/2$ an integer. Suppose that $\{A_1,A_2\} $ and $\{B_1,B_2\} $ are pairs of disjoint $k$-element subsets of $X$ (that is, $|A_1|=|A_2|=|B_1|=|B_2|=k$, $A_1\cap A_2=\emptyset$, $B_1\cap…

We give an improved upper bound for the Gr\"unbaum--Hadwiger--Ramos problem: Let $d,n,k \in \mathbb{N}$ such that $d \geq 2^n(1+2^{k-1})$. Given $2^{n+1}$ masses on $\mathbb{R}^d$, there exist $k$ hyperplanes in $\mathbb{R}^d$ that…

The Kneser graph ${\rm KG}_{n,k}$ is a graph whose vertex set is the family of all $k$-subsets of $[n]$ and two vertices are adjacent if their corresponding subsets are disjoint. The classical Erd\H{o}s-Ko-Rado theorem determines the…

A family of sets is intersecting if no two of its members are disjoint, and has the Erd\H{o}s-Ko-Rado property (or is EKR) if each of its largest intersecting subfamilies has nonempty intersection. Denote by $\mathcal{H}_k(n,p)$ the random…

Rigid graph theory is an active area with many open problems, especially regarding embeddings in $\mathbb{R}^d$ or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number…

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

A perfect matching of a complete graph $K_{2n}$ is a 1-regular subgraph that contains all the vertices. Two perfect matchings intersect if they share an edge. It is known that if $\mathcal{F}$ is family of intersecting perfect matchings of…

We give a proof of the Erd\H{o}s-Ko-Rado Theorem using the Borel Fixed Point Theorem from algebraic group theory. This perspective gives a strong analogy between the Erd\H{o}s-Ko-Rado Theorem and (generalizations of) the Gerstenhaber…

We study a variant of the Erd\H{o}s Matching Problem in random hypergraphs. Let $\mathcal{K}_p(n,k)$ denote the Erd\H{o}s-R\'enyi random $k$-uniform hypergraph on $n$ vertices where each possible edge is included with probability $p$. We…

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The \emph{minimum positive co-degree} of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of…

How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input…

For a homogeneous polynomial of $n$ variables, we present a new method to compute the roots of Bernstein-Sato polynomial supported at the origin, assuming that general hyperplane sections of the associated projective hypersurface have at…

This paper proves a stability result for a variation of the Erd\H{o}s-Ko-Rado theorem in the context of polynomials over finite fields. Let $\mathcal F$ be a family of polynomials of degree at most $k \geq 3$ in $\mathbb F_q[X]$. Call…

We present a quite efficient method to calculate the roots of Bernstein-Sato polynomial for a defining polynomial $f$ of a projective hypersurface $Z\subset{\mathbb P}^{n-1}$ of degree $d$ having only weighted homogeneous isolated…

Let $\{(A_i,B_i)\}_{i=1}^m$ be a set pair system. F\"{u}redi, Gy\'{a}rf\'{a}s and Kir\'{a}ly called it {\em $1$-cross intersecting} if $|A_i\cap B_j|$ is $1$ when $i\neq j$ and $0$ if $i=j$. They studied such systems and their…

We give estimates for the zero loci of Bernstein-Sato ideals. An upper bound is proved as a multivariate generalisation of the upper bound by Lichtin for the roots of Bernstein-Sato polynomials. The lower bounds generalise the fact that…

This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…