Related papers: On Generalized Addition Chains

Let $G$ be a finite, simple, connected graph. An arithmetical structure on $G$ is a pair of positive integer vectors $\mathbf{d},\mathbf{r}$ such that $(\mathrm{diag}(\mathbf{d})-A)\mathbf{r}=0$, where $A$ is the adjacency matrix of $G$. We…

Consider the sequence $\mathcal{V}(2,n)$ constructed in a greedy fashion by setting $a_1 = 2$, $a_2 = n$ and defining $a_{m+1}$ as the smallest integer larger than $a_m$ that can be written as the sum of two (not necessarily distinct)…

Let $p_n$ denote the $n$-th prime, and for any $k \geq 1$ and sufficiently large $X$, define the quantity $$ G_k(X) := \max_{p_{n+k} \leq X} \min( p_{n+1}-p_n, \dots, p_{n+k}-p_{n+k-1} ),$$ which measures the occurrence of chains of $k$…

What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and…

Aronson's sequence 1, 4, 11, 16, ... is defined by the English sentence ``t is the first, fourth, eleventh, sixteenth, ... letter of this sentence.'' This paper introduces some numerical analogues, such as: a(n) is taken to be the smallest…

Vector addition systems are an important model in theoretical computer science and have been used in a variety of areas. In this paper, we consider vector addition systems with states over a parameterized initial configuration. For these…

We introduce the chain geometry $\Sigma(K,R)$ over a ring $R$ with a distinguished subfield $K$, thus extending the usual concept where $R$ has to be an algebra over $K$. A chain is uniquely determined by three of its points, if, and only…

$G$ be an additive finite abelian group. The Davenport constant $\mathsf D(G)$ is the smallest integer $t$ such that every sequence (multiset) $S$ over $G$ of length $|S|\ge t$ has a non-empty zero-sum subsequence. Recently, B. Girard…

For a finite group $G$ and positive integer $g$, a $g$-additive basis is a subset of $G$ whose pairwise sums cover each element of $G$ at least $g$ times, with $g$-difference bases defined similarly using pairwise differences. While prior…

Let $\Gamma$ be a chain of cycles of genus $g$. Let $d$,$r$ be integers with $1 \leq r \leq g-2$ and $2r\leq d \leq g-3+r$. Then $w^r_d(\Gamma)=d-2r$ implies $\Gamma$ is hyperelliptic. For each $g \geq 2r+3$ there exist non-hyperelliptic…

Let $H$ be a Krull monoid with class group $G$ and suppose that each class contains a prime divisor. Then every element $a \in H$ has a factorization into irreducible elements, and the set $\mathsf L (a)$ of all possible factorization…

The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some…

Suppose that a random n-bit number V is multiplied by an odd constant M, greater than or equal to 3, by adding shifted versions of the number V corresponding to the 1s in the binary representation of the constant M. Suppose further that the…

An L- sequence of a graph $G $ is a sequence of distinct vertices $S = \{v_1, ... , v_k\}$ such that $N[v_i] \setminus \cup_{j=1}^{i-1} N(v_j) \neq \emptyset$. The length of the longest L-sequence is called the L-Grundy domination number,…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

For positive integers m and r, one can easily show there exist integers N such that for every map D:{1,2,...,N} -> {1,2,...,r} there exist 2m integers x_1 < ... < x_m < y_1 < ... < y_m which satisfy: (a) D(x_1) = ... = D(x_m), (b) D(y_1) =…

The notion of a $\delta$-generic sequence of P-points is introduced in this paper. It is proved assuming the Continuum Hypothesis that for each $\delta < {\omega}_{2}$, any $\delta$-generic sequence of P-points can be extended to an…

Given any $n \in \mathbb{Z}^{+}$, we constructively prove the existence of covering paths and circuits in the plane which are characterized by the same link length of the minimum-link covering trails for the two-dimensional grid $G_n^2 :=…

The Ulam sequence is defined as $a_1 =1, a_2 = 2$ and $a_n$ being the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives $$1, 2, 3, 4, 6, 8, 11, 13, 16, 18, 26, 28, 36, 38, 47,…

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…