中文
相关论文

相关论文: Sunflower Bound with a Sub-Logarithmic Base

200 篇论文

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

群论 · 数学 2007-05-23 A. Lubotzky , N. Nikolov

A well known generalisation of Dirac's theorem states that if a graph $G$ on $n\ge 4k$ vertices has minimum degree at least $n/2$ then $G$ contains a $2$-factor consisting of exactly $k$ cycles. This is easily seen to be tight in terms of…

组合数学 · 数学 2020-03-10 Matija Bucić , Erik Jahn , Alexey Pokrovskiy , Benny Sudakov

Let $m$, $n$, and $k$ be integers satisfying $0 < k \leq n < 2k \leq m$. A family of sets $\mathcal{F}$ is called an $(m,n,k)$-intersecting family if $\binom{[n]}{k} \subseteq \mathcal{F} \subseteq \binom{[m]}{k}$ and any pair of members of…

组合数学 · 数学 2013-04-09 Wei-Tian Li , Bor-Liang Chen , Kuo-Ching Huang , Ko-Wei Lih

A d-partite hypergraph is called *fractionally balanced* if there exists a non-negative, not identically zero, function on its edge set that has constant degrees in each vertex side. Using a topological version of Hall's theorem we prove…

组合数学 · 数学 2022-08-16 Ron Aharoni , Eli Berger , Joseph Briggs , Erel Segal-Halevi , Shira Zerbib

We obtain a complete classification of components of strata of holomorphic and meromorphic k-differentials. We show that, when genus is at least two and outside of explicit exceptions when k < 4, there is one primitive nonhyperelliptic…

代数几何 · 数学 2026-04-30 Paul Apisa , Juliet Aygun

A family ${\mathcal A}$ of $k$-subsets of $\{1,2,\dots, N\}$ is a Sidon system if the sumsets $A+B$, $A,B\in \mathcal{A}$ are pairwise distinct. We show that the largest cardinality $F_k(N)$ of a Sidon system of $k$-subsets of $[N]$…

组合数学 · 数学 2020-06-18 Javier Cilleruelo , Oriol Serra , Maximilian Wötzel

Recall that in a laminar family, any two sets are either disjoint or contained one in the other. Here, a parametrized weakening of this condition is introduced. Let us say that a set system $\mathcal{F} \subseteq 2^X$ is $t$-laminar if $A,B…

组合数学 · 数学 2014-06-13 Peter Dukes

The Links-Gould invariant of links $LG^{2,1}$ is a two-variable generalization of the Alexander-Conway polynomial. Using representation theory of $U_{q}\mathfrak{gl}(2 \vert 1)$, we prove that the degree of the Links-Gould polynomial…

几何拓扑 · 数学 2026-05-25 Ben-Michael Kohli , Guillaume Tahar

For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…

组合数学 · 数学 2022-10-21 Peter Frankl , Jian Wang

Let $r_k(n)$ denote the maximum cardinality of a set $A \subset \{1,2, \dots, n \}$ such that $A$ does not contain a $k$-term arithmetic progression. In this paper, we give a method of constructing such a set and prove the lower bound…

组合数学 · 数学 2017-11-21 Vladislav Taranchuk

Given a fixed positive integer $k$, the $k$-planar local crossing number of a graph $G$, denoted by $\text{LCR}_k(G)$, is the minimum positive integer $L$ such that $G$ can be decomposed into $k$ subgraphs, each of which can be drawn in a…

组合数学 · 数学 2018-04-09 John Asplund , Thao do , Arran Hamm , Vishesh Jain

A set $Q$ in $\mathbb{Z}_+^d$ is a lower set if $(k_1,\dots,k_d)\in Q$ implies $(l_1,\dots,l_d)\in Q$ whenever $0\le l_i\le k_i$ for all $i$. We derive new and refine known results regarding the cardinality of the lower sets of size $n$ in…

数值分析 · 数学 2025-04-15 F. Dai , A. Prymak , A. Shadrin , V. Temlyakov , S. Tikhonov

We consider families F of sequences converging to +infinity that F satisfies the following condition (C): (C): if an open set U in the real line is unbounded above then there exists a sequence belonging to F, which has an infinite number of…

逻辑 · 数学 2016-09-06 Apoloniusz Tyszka

In this paper, we give a lower bound for the maximum size of a $k$-colored sum-free set in $\mathbb{Z}_m^n$, where $k\geq 3$ and $m\geq 2$ are fixed and $n$ tends to infinity. If $m$ is a prime power, this lower bound matches (up to lower…

组合数学 · 数学 2018-12-26 László Miklós Lovász , Lisa Sauermann

We establish a sharp lower-bound for the number of conjugacy classes $k(A_n)$ in the alternating group $A_n$, for $n \geq 3$. Namely, we show that $k\left(A_n\right) \geq \frac{k\left(A_7\right)}{\log_2\left|A_7\right|} \cdot…

群论 · 数学 2023-10-19 Xandru Mifsud

A $k$-crossing family in a point set $S$ in general position is a set of $k$ segments spanned by points of $S$ such that all $k$ segments mutually cross. In this short note we present two statements on crossing families which are based on…

计算几何 · 计算机科学 2022-10-03 Oswin Aichholzer , Jan Kynčl , Manfred Scheucher , Birgit Vogtenhuber , Pavel Valtr

The concordance genus of a knot K is the minimum Seifert genus of all knots smoothly concordant to K. Concordance genus is bounded below by the 4-ball genus and above by the Seifert genus. We give a lower bound for the concordance genus of…

几何拓扑 · 数学 2013-10-29 Jennifer Hom

Let K be a multiquadratic number field. We investigate the average dimension of 2-Selmer groups over K for the family of all elliptic curves over the rational numbers (ordered by height). We give upper and lower bounds for this average. In…

数论 · 数学 2024-01-18 Ross Paterson

Given a family $S$ of $k$--subsets of $[n]$, its lower shadow $\Delta(S)$ is the family of $(k-1)$--subsets which are contained in at least one set in $S$. The celebrated Kruskal--Katona theorem gives the minimum cardinality of $\Delta(S)$…

组合数学 · 数学 2023-04-12 Oriol Serra , Lluís Vena

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…

组合数学 · 数学 2015-08-26 Jens Maßberg