中文
相关论文

相关论文: The Asymptotic Bound of the Lubell Function for Di…

200 篇论文

Let $G$ be a finite abelian group of order $n$, and for each $a\in G$ and integer $1\le h\le n$ let $\mathcal{F}_a(h)$ denote the family of all $h$-element subsets of $G$ whose sum is $a$. A problem posed by Katona and Makar-Limanov is to…

组合数学 · 数学 2025-09-11 Jing Wang

We combine here Tao's slice-rank bounding method and Gr\"obner basis techniques and apply here to the Erd\H{o}s-Rado Sunflower Conjecture. Let $\frac{3k}{2}\leq n\leq 3k$ be integers. We prove that if $\mbox{$\cal F$}$ be a $k$-uniform…

组合数学 · 数学 2017-03-17 Gábor Hegedüs

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = A+A = \{a + b \ | \ a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. We prove that the number of sumsets in $\mathbb{F}_2^n$ is asymptotically…

组合数学 · 数学 2024-04-17 Noga Alon , Or Zamir

The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…

组合数学 · 数学 2023-05-24 Lei Yu

Given an abstract group $G$, we study the function $ab_n(G) := \sup_{|G:H| \leq n} |H/[H,H]|$. If $G$ has no abelian composition factors, then $ab_n(G)$ is bounded by a polynomial: as a consequence, we find a sharp upper bound for the…

群论 · 数学 2022-10-10 Luca Sabatini

For a fixed poset $\mathcal P$ we say that a family $\mathcal F\subseteq\mathcal P([n])$ is $\mathcal P$-saturated if it does not contain an induced copy of $\mathcal P$, but whenever we add a new set to $\mathcal F$, we form an induced…

组合数学 · 数学 2026-03-10 Maria-Romina Ivan , Sean Jaffe

Let $A_1,\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\cdots=|A_n|\ge2$. Concerning the two new kinds of restricted sumsets $$L(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n,\ \text{and}\…

数论 · 数学 2022-10-24 Han Wang , Zhi-Wei Sun

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

组合数学 · 数学 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

组合数学 · 数学 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

组合数学 · 数学 2019-03-21 Christian Elsholtz , Péter Pál Pach

The objective of this paper is to obtain asymptotic results for shifted sums of multiplicative functions of the form $g \ast 1$, where the function $g$ satisfies the Ramanujan conjecture and has conjectured upper bounds on square moments of…

数论 · 数学 2025-07-08 Jiseong Kim

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…

数论 · 数学 2016-06-03 R. Balasubramanian , Gyan Prakash , D. S. Ramana

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

动力系统 · 数学 2025-04-14 Dimitrios Charamaras , Ioannis Kousek , Andreas Mountakis , Tristán Radić

What is the smallest size of a family of subsets of $[n]$ such that it does not contain an induced copy of $Q_2$ as a poset (known as the \textit{diamond}), but adding a new set creates such a copy? It is easy to see that a maximal chain…

组合数学 · 数学 2026-04-09 Maria-Romina Ivan , Sean Jaffe

Let $\mathcal{F}$ be a family of subsets of a ground set $\{1,\ldots,n\}$ with $|\mathcal{F}|=m$, and let $\mathcal{F}^{\updownarrow}$ denote the family of all subsets of $\{1,\ldots,n\}$ that are subsets or supersets of sets in…

组合数学 · 数学 2023-11-22 Adam Gowty , Daniel Horsley , Adam Mammoliti

We study subsets of $\mathbb{F}_p^n$ that do not contain progressions of length $k$. We denote by $r_k(\mathbb{F}_p^n)$ the cardinality of such subsets containing a maximal number of elements. In this paper we focus on the case $k=p$ and…

Let $\es$ be the family of analytic and univalent functions $f$ in the unit disk $\D$ with the normalization $f(0)=f'(0)-1=0$, and let $\gamma_n(f)=\gamma_n$ denote the logarithmic coefficients of $f\in {\es}$. In this paper, we study…

复变函数 · 数学 2018-11-06 S. Ponnusamy , N. L. Sharma , K. -J. Wirths

Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for $D>2$ is sunflower-free if for every distinct triple $x,y,z\in \mbox{$\cal F$}$ there exists…

组合数学 · 数学 2018-05-14 Gábor Hegedűs

For any group G of order n, a subset A of G is said to be product-free if there is no solution of the equation ab=c with a,b,c in A. Previous results of Gowers showed that the size of any product-free subset of G is at most n/d^(1/3), where…

群论 · 数学 2008-04-07 Kiran S. Kedlaya , Xuancheng Shao

Let $\mathfrak{F}_n$ be the set of all cuspidal automorphic representations $\pi$ of $\mathrm{GL}_n$ with unitary central character over a number field $F$. We prove the first unconditional zero density estimate for the set…

数论 · 数学 2024-04-04 Peter Humphries , Jesse Thorner