中文
相关论文

相关论文: On Sums of Generating Sets in (Z_2)^n

200 篇论文

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

数据结构与算法 · 计算机科学 2024-02-06 Xi Chen , Shivam Nadimpalli , Tim Randolph , Rocco A. Servedio , Or Zamir

We study the coupling constant renormalization of gauge theories with an infinite multiplet of fermions, using the zeta function method to make sense of the infinite sums over fermions. If the gauge group K is the maximal compact subgroup…

高能物理 - 理论 · 物理学 2024-03-29 S. G. Rajeev

In a recent paper we proved that if (*)=\inf_{|z_k|=1}\max_{v=1,...,n^2-n} |\sum_{k=1}^n z_k^v|, then (*)=\sqrt{n-1} if n-1 is a prime power. We proved that a construction of Fabrykowski gives minimal systems (z_1,...,z_n) to this problem.…

数论 · 数学 2007-05-23 Johan Andersson

A natural generalization of base B expansions is Zeckendorf's Theorem: every integer can be uniquely written as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, with $F_{n+1} = F_n + F_{n-1}$ and $F_1=1, F_2=2$. If instead we allow the…

Let $(G, +)$ be an abelian group. In 2004, Eliahou and Kervaire found an explicit formula for the smallest possible cardinality of the sumset $A+A$, where $A \subseteq G$ has fixed cardinality $r$. We consider instead the smallest possible…

组合数学 · 数学 2017-03-30 Mitchell Lee

We examine the large systole problem, which concerns compact hyperbolic Riemannian surfaces whose systole, the length of the shortest noncontractible loops, grows logarithmically in genus. The generalization of a construction of Buser and…

微分几何 · 数学 2014-09-12 Shotaro Makisumi

For $\delta>0$ sufficiently small and $A\subset \mathbb{Z}^k$ with $|A+A|\le (2^k+\delta)|A|$, we show either $A$ is covered by $m_k(\delta)$ parallel hyperplanes, or satisfies $|\widehat{\operatorname{co}}(A)\setminus A|\le c_k\delta |A|$,…

数论 · 数学 2022-12-07 Peter van Hintum , Hunter Spink , Marius Tiba

In this paper, we consider the sum-product problem of obtaining lower bounds for the size of the set $$\frac{A+A}{A+A}:=\left \{ \frac{a+b}{c+d} : a,b,c,d \in A, c+d \neq 0 \right\},$$ for an arbitrary finite set $A$ of real numbers. The…

组合数学 · 数学 2017-05-17 Oliver Roche-Newton

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

组合数学 · 数学 2025-01-13 Jagannath Bhanja

We prove a sharp bound for the minimal doubling of a small measurable subset of a compact connected Lie group. Namely, let $G$ be a compact connected Lie group of dimension $d_G$, we show that for for all measurable subsets $A$, we have…

群论 · 数学 2024-05-24 Simon Machado

We determine the structure of a finite subset $A$ of an abelian group given that $|2A|<3(1-\epsilon)|A|$, $\epsilon>0$; namely, we show that $A$ is contained either in a "small" one-dimensional coset progression, or in a union of fewer than…

数论 · 数学 2020-10-27 Vsevolod F. Lev

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

组合数学 · 数学 2023-01-31 Marcelo Campos , Matthew Coulson , Oriol Serra , Maximilian Wötzel

In this note it is established that, for any finite set $A$ of real numbers, there exist two elements $a,b \in A$ such that $$|(a+A)(b+A)| \gg \frac{|A|^2}{\log |A|}.$$ In particular, it follows that $|(A+A)(A+A)| \gg \frac{|A|^2}{\log…

组合数学 · 数学 2015-02-20 Oliver Roche-Newton

Let $G = (G,+)$ be a compact connected abelian group, and let $\mu_G$ denote its probability Haar measure. A theorem of Kneser (generalising previous results of Macbeath and Raikov) establishes the bound $$ \mu_G(A + B) \geq \min(…

组合数学 · 数学 2018-07-03 Terence Tao

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…

数论 · 数学 2018-05-15 F. V. Weinstein

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 prove a sharp stability result concerning how close homothetic sets attaining near-equality in the Brunn-Minkowski inequality are to being convex. In particular, resolving a conjecture of Figalli and Jerison, we show there are universal…

度量几何 · 数学 2020-04-17 Peter van Hintum , Hunter Spink , Marius Tiba

We show that a topologically generating set $S$ of a connected compact Lie group $G$ of size larger than a fixed polynomial in the rank of $G$ must be redundant (i.e., some proper subset of $S$ still topologically generates $G$). Similar…

群论 · 数学 2026-04-24 Tal Cohen , Itamar Vigdorovich

In this paper we prove that every set $A\subset\mathbb{Z}$ satisfying the inequality $\sum_{x}\min(1_A*1_A(x),t)\le(2+\delta)t|A|$ for $t$ and $\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use…

组合数学 · 数学 2015-06-02 Przemysław Mazur

We define the positive diameter of a finite group $G$ with respect to a generating set $A\subset G$ to be the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A$. This…

群论 · 数学 2009-11-17 Benjamin Klopsch , Vsevolod F. Lev