中文
相关论文

相关论文: Kruskal-Katona type Problem

200 篇论文

For a positive integer $r$, let $G(r)$ be the smallest $N$ such that, whenever the edges of the Cartesian product $K_N \times K_N$ are $r$-coloured, then there is a rectangle in which both pairs of opposite edges receive the same colour. In…

组合数学 · 数学 2018-09-26 Luka Milićević

Let Q_K=(Q,<_Q)$ be a strongly K-dense linear order of size K for a suitable cardinal K. We prove, for all integers m > 1 that there is a finite value t_m^+ such that the set of all m-tuples from Q can be divided into t_m^+ many classes,…

逻辑 · 数学 2007-05-23 M. Dzamonja , J. Larson , W. Mitchell

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

数据结构与算法 · 计算机科学 2020-02-10 Mario Pennacchioni , Emanuele Munarini , Marco Mesiti

Let $\mathcal{A}$ be a finite-dimensional subspace of $C(\mathcal{X};\mathbb{R})$, where $\mathcal{X}$ is a locally compact Hausdorff space, and $\mathsf{A}=\{f_1,\dots,f_m\}$ a basis of $\mathcal{A}$. A sequence $s=(s_j)_{j=1}^m$ is called…

泛函分析 · 数学 2018-04-20 Philipp J. di Dio , Konrad Schmüdgen

Balogh and Bollob\'as [{\em Combinatorica 25, 2005}] prove that for any $k$ there is a constant $f(k)$ such that any set system with at least $f(k)$ sets reduces to a $k$-star, an $k$-costar or an $k$-chain. They proved $f(k)<(2k)^{2^k}$.…

组合数学 · 数学 2014-09-30 Richard P. Anstee , Linyuan Lu

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…

组合数学 · 数学 2014-03-03 Kaushik Majumder

Let $K \subset {\mathbb R}^n$ be a compact definable set in an o-minimal structure over $\mathbb R$, e.g., a semi-algebraic or a subanalytic set. A definable family $\{ S_\delta|\> 0< \delta \in {\mathbb R} \}$ of compact subsets of $K$, is…

代数几何 · 数学 2017-05-17 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

How large can a family \cal A \subset \cal P [n] be if it does not contain A,B with |A\setminus B| = 1? Our aim in this paper is to show that any such family has size at most \frac{2+o(1)}{n} \binom {n}{\lfloor n/2\rfloor }. This is tight…

组合数学 · 数学 2013-11-25 Imre Leader , Eoin Long

Let $\crs(K_n)$ be the minimum number of crossings over all rectilinear drawings of the complete graph on $n$ vertices on the plane. In this paper we prove that $\crs(K_n) < 0.380473\binom{n}{4}+\Theta(n^3)$; improving thus on the previous…

组合数学 · 数学 2014-03-07 Ruy Fabila-Monroy , Jorge López

Given integers $k\geq1$ and $n\geq0$, there is a unique way of writing $n$ as $n=\binom{n_{k}}{k}+\binom{n_{k-1}}{k-1}+...+\binom{n_{1}}{1}$ so that $0\leq n_{1}<...<n_{k-1}<n_{k}$. Using this representation, the \emph{Kruskal-Macaulay…

组合数学 · 数学 2009-04-27 Bernardo M. Ábrego , Silvia Fernández-Merchant , Bernardo Llano

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

组合数学 · 数学 2024-12-13 Ishay Haviv , Sam Mattheus , Aleksa Milojević , Yuval Wigderson

Let $X,X_1,X_2,\ldots$ be i.i.d. mean zero random vectors with values in a separable Banach space $B$, $S_n=X_1+\cdots+X_n$ for $n\ge1$, and assume $\{c_n:n\ge1\}$ is a suitably regular sequence of constants. Furthermore, let…

概率论 · 数学 2014-03-28 Uwe Einmahl , Jim Kuelbs

A set $A$ $t$-intersects a set $B$ if $A$ and $B$ have at least $t$ common elements. Families $\mathcal{A}_1, \mathcal{A}_2, \dots, \mathcal{A}_k$ of sets are cross-$t$-intersecting if, for every $i$ and $j$ in $\{1, 2, \dots, k\}$ with $i…

组合数学 · 数学 2018-05-15 Peter Borg

We consider an extended variant of the classical coupon collector's problem with infinite number of collections. An arriving coupon is placed in the $r^{th}$ collection, $r\ge0$, if $r$ is the smallest index such that the corresponding…

概率论 · 数学 2020-02-04 Andrii Ilienko

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any…

数论 · 数学 2010-04-19 Mariah Hamel , Neil Lyall , Katherine Thompson , Nathan Walters

By Hacon-McKernan-Xu, there is a positive lower bound in each dimension for the volume of all klt varieties with ample canonical class. We show that these bounds must go to zero extremely fast as the dimension increases, by constructing a…

代数几何 · 数学 2021-11-01 Burt Totaro , Chengxi Wang

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of…

交换代数 · 数学 2016-10-19 Qinghai Zhong

In this paper we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset $A$ of $\mathbb{Z}_n\setminus \{0\}$ of size $k$ such that $\sum_{z\in A} z\not= 0$, it is…

组合数学 · 数学 2020-04-24 Simone Costa , Marco Antonio Pellegrini

Intersecting families and blocking sets feature prominently in extremal combinatorics. We examine the following generalization of an intersecting family investigated by Hajnal, Rothschild, and others. If $s \geq 1$, $k \geq 2$, and $u \geq…

组合数学 · 数学 2021-01-07 Brian Chan

We prove that for $d\ge 2,\, k\ge 2$, if the Hausdorff dimension of a compact set $E\subset \mathbb{R}^d$ is greater than $\frac{d^2}{2d-1}$, then, for any given $r > 0$, there exist $(x^1, \dots, x^{k+1})\in E^{k+1}$, $(y^1, \dots,…

经典分析与常微分方程 · 数学 2024-05-07 P. Bhowmik , A. Greenleaf , A. Iosevich , S. Mkrtchyan , F. Rakhmonov