English
Related papers

Related papers: A Note on Minimal Additive Complements

200 papers

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

Number Theory · Mathematics 2022-11-29 Petr Kucheriaviy

Vaughan Pratt has introduced objects consisting of pairs $(A,W)$ where $A$ is a set and $W$ a set of subsets of $A,$ such that (i) $W$ contains $\emptyset$ and $A,$ (ii) if $C$ is a subset of $A\times A$ such that for every $a\in A,$ both…

Combinatorics · Mathematics 2021-10-15 George M. Bergman , Pace P. Nielsen

Two infinite sets $A$ and $B$ of nonnegative integers are called additive complements if their sumset contains every nonnegative integer. In 1964, Danzer constructed infinite additive complements $A$ and $B$ with $A(x)B(x) = (1 + o(1))x$ as…

Number Theory · Mathematics 2020-12-18 Sándor Z. Kiss , Csaba Sándor

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

Group Theory · Mathematics 2015-12-01 A. L. Agore , G. Militaru

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

Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $S \subseteq A$ of the smallest possible cardinality such the greatest common divisor of the elements of $S \cup B$ equals that of those of $A \cup B$. The…

Computational Complexity · Computer Science 2014-02-25 Joachim von zur Gathen , Igor E. Shparlinski

Let $A$ be an additive basis. We call ``essential subset'' of $A$ any finite subset $P$ of $A$ such that $A \setminus P$ is not an additive basis and that $P$ is minimal (for the inclusion order) to have this property. A recent theorem due…

Number Theory · Mathematics 2008-07-23 Bakir Farhi

The weak saturation number $\mathrm{wsat}(n,F)$ is the minimum number of edges in a graph on $n$ vertices such that all the missing edges can be activated sequentially so that each new edge creates a copy of $F$. A usual approach to prove a…

Combinatorics · Mathematics 2023-05-26 Nikolai Terekhov , Maksim Zhukovskii

We prove the minimality of the CW-complex structure for complements of hyperplane arrangements in $\mathbb C^n$ by using the theory of Lefschetz pencils and results on the variation maps within a pencil of hyperplanes. This also provides a…

Algebraic Geometry · Mathematics 2016-11-28 Mihai Tibar

The minimum completion (fill-in) problem is defined as follows: Given a graph family $\mathcal{F}$ (more generally, a property $\Pi$) and a graph $G$, the completion problem asks for the minimum number of non-edges needed to be added to $G$…

Data Structures and Algorithms · Computer Science 2023-02-02 Anna Mpanti , Stavros D. Nikolopoulos , Leonidas Palios

We consider restricted sumsets over field $F$. Let\begin{align*}C=\{a_1+\cdots+a_n:a_1\in A_1,\ldots,a_n\in A_n, a_i-a_j\notin S_{ij}\ \text{if}\ i\not=j\},\end{align*} where $S_{ij}(1\leqslant i\not=j\leqslant n)$ are finite subsets of $F$…

Number Theory · Mathematics 2014-02-17 Lilu Zhao

Let $A, B \subseteq \mathbb{N}$ be two finite sets of natural numbers. We say that $B$ is an additive divisor for $A$ if there exists some $C \subseteq \mathbb{N}$ with $A = B+C$. We prove that among those subsets of $\{0, 1, \ldots, k\}$…

Combinatorics · Mathematics 2024-09-24 Gal Gross

The excess of an element $w$ of a finite Coxeter group $W$ is the minimal value of $l(x) + l(y) - l(w)$, where $x$, $y$ are elements of $W$ such that $x^2 = y^2 = 1$ and $w = xy$. Every element of a finite Coxeter group is either an…

Group Theory · Mathematics 2015-08-28 Sarah B. Hart , Peter J. Rowley

We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…

Discrete Mathematics · Computer Science 2013-04-17 B. S. Kochkarev

For a set $S$ of (positive definite and integral) quadratic forms with bounded rank, a quadratic form $f$ is called $S$-universal if it represents all quadratic forms in $S$. A subset $S_0$ of $S$ is called an $S$-universality criterion set…

Number Theory · Mathematics 2020-09-10 Kyoungmin Kim , Jeongwon Lee , Byeong-Kweon Oh

A set $W$ of vertices of $G$ is said to be a weak total resolving set for $G$ if $W$ is a resolving set for $G$ as well as for each $w\in W$, there is at least one element in $W-\{w\}$ that resolves $w$ and $v$ for every $v\in V(G)- W$.…

Combinatorics · Mathematics 2014-08-05 Imran Javaid , Muhammad Salman , Mahr Murtaza , Farheen Iftikhar , Muhammad Imran

Let $R$ be a ring with $1$ and $\J(R)$ its Jacobson radical. Then $1+\J(R)$ is a normal subgroup of the group of units, $G(R)$. The existence of a complement to this subgroup was explored in a paper by Coleman and Easdown; in particular the…

Group Theory · Mathematics 2010-10-08 Stewart Wilcox

Let $\mathfrak{g}=\mathfrak{g}_{\bar 0}+\mathfrak{g}_{\bar 1}$ be a basic Lie superalgebra over $\mathbb{C}$, and $e$ a minimal nilpotent element in $\mathfrak{g}_{\bar 0}$. Set $W_\chi'$ to be the refined $W$-superalgebra associated with…

Representation Theory · Mathematics 2020-07-02 Yang Zeng , Bin Shu

Let $\mathbb{N}_0$ be the set of all non-negative integers, let $X\subset \mathbb{N}_0$ and $\mathcal{P}(X)$ be the the power set of $X$. An integer additive set-labeling (IASL) of a graph $G$ is an injective function $f:V(G)\to…

General Mathematics · Mathematics 2015-03-27 N. K. Sudev , K. P. Chithra , K. A. Germina

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

Combinatorics · Mathematics 2016-11-08 David Cushing , G. W. Stagg