中文
相关论文

相关论文: Two new results on maximal left-compressed interse…

200 篇论文

We prove an analogue of the classical Erd\H{o}s-Ko-Rado theorem for intersecting sets of permutations in finite 2-transitive groups. Given a finite group G acting faithfully and 2-transitively on the set X, we show that an intersecting set…

组合数学 · 数学 2015-07-24 Karen Meagher , Pablo Spiga , Pham Huu Tiep

Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…

计算机科学中的逻辑 · 计算机科学 2024-11-26 Sebastian Siebertz , Alexandre Vigny

A $2k$-matching is a perfect matching of the complete graph on $2k$ vertices. Two $2k$-matchings are defined to be $t$-intersecting if they have at least $t$ edges in common. The main result in this paper is that if $k \geq 3t/2+1$, then…

组合数学 · 数学 2010-06-08 Karen Meagher

The famous MLC Conjecture states that the Mandelbrot set is locally connected, and it is considered by many to be the central conjecture in one-dimensional complex dynamics. Among others, it implies density of hyperbolicity in the quadratic…

动力系统 · 数学 2018-01-08 Anna Miriam Benini

We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. A family $\mathcal{A}$ of sets is said to be \emph{$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects any other set in…

组合数学 · 数学 2013-01-01 Peter Borg

Let $\A\subset\binom{[n]}{r}$ be a compressed, intersecting family and let $X\subset[n]$. Let $\A(X)={A\in\A:A\cap X\ne\emptyset}$ and $\S_{n,r}=\binom{[n]}{r}({1})$. Motivated by the Erd\H{o}s-Ko-Rado theorem, Borg asked for which…

组合数学 · 数学 2012-10-30 Benjamin Bond

We investigate the asymptotic version of the Erd\H{o}s-Ko-Rado theorem for the random $k$-uniform hypergraph $\mathcal{H}^k(n,p)$. For $2 \leq k(n) \leq n/2$, let $N=\binom{n}k$ and $D=\binom{n-k}k$. We show that with probability tending to…

组合数学 · 数学 2017-04-26 Marcelo M. Gauy , Hiêp Hàn , Igor C. Oliveira

An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erd\H{o}s--Ko--Rado theorem: when $n> 2k$, every non-trivial intersecting family…

组合数学 · 数学 2017-05-30 Peter Frankl , Jie Han , Hao Huang , Yi Zhao

We establish a new class of $L^2$-weighted elliptic estimates on smooth two-manifolds for a family of weights satisfying an equation with explicit constants. This family includes weights that are comparable to the product of positive powers…

偏微分方程分析 · 数学 2025-04-08 Aria Halavati

For a family of sets $\mathcal{F}$, let $\omega(\mathcal{F}):=\sum_{\{A,B\}\subset \mathcal{F}}|A\cap B|$. In this paper, we prove that provided $n$ is sufficiently large, for any $\mathcal{F}\subset \binom{[n]}{k}$ with $|\mathcal{F}|=m$,…

组合数学 · 数学 2025-07-18 Sumin Huang , Gyula O. H. Katona , Erfei Yue

Logarithmic Conformal Field Theories (LCFT) play a key role, for instance, in the description of critical geometrical problems (percolation, self avoiding walks, etc.), or of critical points in several classes of disordered systems…

高能物理 - 理论 · 物理学 2013-11-22 A. M. Gainutdinov , J. L. Jacobsen , N. Read , H. Saleur , R. Vasseur

Let $\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets. The Erd\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, asserts the maximum…

组合数学 · 数学 2026-03-11 Tapas Kumar Mishra

Let $\omega(\mathcal{F})=\sum_{\{A,B\}\subset\mathcal{F}}|A\cap B|$ and $\omega(\mathcal{A},\mathcal{B})=\sum_{(A,B)\in \mathcal{A}\times \mathcal{B}}|A\cap B|$. A family $\mathcal{F}$ is intersecting if $F_1\cap F_2\neq \emptyset$ for any…

组合数学 · 数学 2024-02-27 Sumin Huang

We say a family of sets is intersecting if any two of its sets intersect, and we say it is trivially intersecting if there is an element which appears in every set of the family. In this paper we study the maximum size of a non-trivially…

组合数学 · 数学 2019-07-01 Matthew Kwan , Benny Sudakov , Pedro Vieira

A collection of sets is {\em intersecting} if every two members have nonempty intersection. We describe the structure of intersecting families of $r$-sets of an $n$-set whose size is quite a bit smaller than the maximum ${n-1 \choose r-1}$…

组合数学 · 数学 2016-02-08 Alexandr Kostochka , Dhruv Mubayi

The $\mathit{growth\ rate\ function}$ for a nonempty minor-closed class of matroids $\mathcal{M}$ is the function $h_{\mathcal{M}}(n)$ whose value at an integer $n \ge 0$ is defined to be the maximum number of elements in a simple matroid…

组合数学 · 数学 2014-10-29 Jim Geelen , Peter Nelson

A $(k,\ell)$-partition is a set partition which has $\ell$ blocks each of size $k$. Two uniform set partitions $P$ and $Q$ are said to be partially $t$-intersecting if there exist blocks $P_{i}$ in $P$ and $Q_{j}$ in $Q$ such that $\left|…

组合数学 · 数学 2021-08-18 Karen Meagher , Mahsa N. Shirazi , Brett Stevens

We consider maximum principles and related estimates for linear second order elliptic partial differential operators in n-dimensional Euclidean space, which improve previous results, with H-J Kuo, through sharp Lp dependence on the drift…

偏微分方程分析 · 数学 2024-03-28 Neil S. Trudinger

For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all its $k$-subsets. Two families of sets $\mathcal A$ and $\mathcal B$ are called cross-intersecting if $A\cap B \neq \emptyset$ holds for all $A\in\mathcal A$,…

组合数学 · 数学 2019-05-21 Peter Frankl , Andrey Kupavskii

The Katz-Sarnak philosophy states that statistics of zeros of $L$-function families near the central point as the conductors tend to infinity agree with those of eigenvalues of random matrix ensembles as the matrix size tends to infinity.…