English
Related papers

Related papers: The continuous postage stamp problem

200 papers

Let $G$ be a finite abeilian group. A sequence $S$ with terms from $G$ is zero-sum if the sum of terms in $S$ equals zero. It is a minimal zero-sum sequence if no proper, nontrivial subsequence is zero-sum. The maximal length of a minimal…

Number Theory · Mathematics 2008-01-25 Weidong Gao , Alfred Geroldinger , David J. Grynkiewicz

In this work we will show that if $F$ is a positive integer, then the set ${\mathrm{Arf}}(F)=\{S\mid S \mbox{ is an Arf numerical semigroup with Frobenius number } F\}$ verifies the following conditions: 1) $\Delta(F)=\{0,F+1,\rightarrow\}$…

Commutative Algebra · Mathematics 2023-03-23 M. A. Moreno-Frías , J. C. Rosales

We study the least doubling constant among all possible doubling measures defined on a (finite or infinite) graph $G$. We show that this constant can be estimated from below by $1+ r(A_G)$, where $r(A_G)$ is the spectral radius of the…

Combinatorics · Mathematics 2021-11-18 Estibalitz Durand-Cartagena , Javier Soria , Pedro Tradacete

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

Number Theory · Mathematics 2023-02-09 Aliaksei Semchankau

Let $\lambda$ be the Liouville function. Assuming the Generalised Riemann Hypothesis for Dirichlet $L$-functions (GRH), we show that for every sufficiently large even integer $N$ there are $a,b \geq 1$ such that $$ a+b = N \text{ and }…

Number Theory · Mathematics 2024-12-24 Alexander P. Mangerel

The main results in this thesis deal with the representation growth of certain classes of groups. In chapter $1$ we present the required preliminary theory. In chapter $2$ we introduce the Congruence Subgroup Problem for an algebraic group…

Group Theory · Mathematics 2016-12-20 Javier García-Rodríguez

Let $A \subset \mathbb R$ and $G \subset A \times A$. We prove that, for any $\lambda \in \mathbb R \setminus \{-1,0,1\}$, \[ \max \{|A+_G A|, |A+_G \lambda A|, |A\cdot_G A|\} \gg |G|^{6/11}. \]

Combinatorics · Mathematics 2020-10-06 Oliver Roche-Newton

Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\{1,2,\ldots,n-1\}$, let $N_{A,g}(S)$ denote the number of subsequences…

Number Theory · Mathematics 2019-01-04 Abílio Lemos , Allan O. Moura , Anderson T. Silva , B. K. Moriya

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

Number Theory · Mathematics 2018-05-30 Zeév Rudnick

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

Combinatorics · Mathematics 2026-05-11 Jasmin Katz , Xiaopan Lian , Alexandru Malekshahian , Andrey Shapiro

Two infinite sets $A$ and $B$ of non-negative integers are called \emph{perfect additive complements of non-negative integers}, if every non-negative integer can be uniquely expressed as the sum of elements from $A$ and $B$. In this paper,…

Number Theory · Mathematics 2023-10-11 Balázs Bárány , Jin-Hui Fang , Csaba Sándor

For a finite abelian group $(G,+)$, the constant $C(G)$ is defined to be the smallest natural number $k$ such that any sequence in $G$ having length $k$ will have a subsequence of consecutive terms whose sum is zero. For a subset…

Number Theory · Mathematics 2023-02-07 Santanu Mondal , Krishnendu Paul , Shameek Paul

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

Number Theory · Mathematics 2019-05-21 Pierre-Yves Bienvenu , François Hennecart

For any given real number $\alpha$ with bounded partial quotients, we construct explicitly continuum many real numbers $\beta$ with bounded partial quotients for which the pair $(\alpha, \beta)$ satisfies a strong form of the Littlewood…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

The stability number of a graph $G$, denoted as $\alpha(G)$, is the maximum size of an independent (stable) set in $G$. Semidefinite programming (SDP) methods, which originated from Lov\'asz's theta number and expanded through…

Optimization and Control · Mathematics 2025-09-11 Luis Felipe Vargas , Juan C. Vera , Peter J. C. Dickinson

For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…

Combinatorics · Mathematics 2014-09-23 Noga Alon , Tom Bohman , Hao Huang

We study statistical properties of random numerical semigroups of a given genus. We analyze the graph of a typical numerical semigroup, understood as a function from $\mathbb{N}$ to $\mathbb{N}$. If $S$ is a numerical semigroup of genus…

Combinatorics · Mathematics 2026-04-30 Maria Bras-Amorós , Nathan Kaplan , Deepesh Singhal

Given an integer mxn matrix A satisfying certain regularity assumptions, we consider the set F(A) of all integer vectors b such that the associated knapsack polytope P(A,b)={x: Ax=b, x>=0} contains an integer point. When m=1 the set F(A) is…

Optimization and Control · Mathematics 2009-11-24 Iskander Aliev , Martin Henk

We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof…

Data Structures and Algorithms · Computer Science 2022-12-01 Calvin Beideman , Karthekeyan Chandrasekaran , Weihang Wang