Related papers: On Generalized Addition Chains

An arithmetical structure on a finite and connected graph G is a pair (d, r) of positive integer vectors such that r is primitive (the gcd of its entries is 1) and (diag(d) - A)r = 0, where A is the adjacency matrix of G. In this article,…

In this paper, we develop some new classes of methods to study the Scholz conjecture on addition chains. It turns out that the exponents of numbers of the form $2^n-1$ largely determine the length of the shortest addition chain for the…

The sequence a_1,...,a_m is a common subsequence in the set of permutations S = {p_1,...,p_k} on [n] if it is a subsequence of p_i(1),...,p_i(n) and p_j(1),...,p_j(n) for some distinct p_i, p_j in S. Recently, Beame and Huynh-Ngoc (2008)…

For chains of regular injections A_p -> A_(p-1) -> ... -> A_1 -> A_0 of Hopf algebras the sets of maximal extended Jordanian twists F_E are considered. We prove that under certain conditions there exists for A_0 the twist composed by the…

Let A be a set of nonnegative integers. For every nonnegative integer n and positive integer h, let r_{A}(n,h) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,..., a_h are elements of A and…

A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…

In this paper, we prove a criterion for complexity in $g$-ary expansions of a rational fraction $a/b<1$ with gcd$(a,b)=1$. We prove that for any purely periodic proper fraction $a/b$ and all $j\geq 1$, each sequence of $j$ digits occurs in…

This paper reformulates the problem of finding a longest common increasing subsequence of the two given input sequences in a very succinct way. An extremely simple linear space algorithm based on the new formula can find a longest common…

Let $G$ be a finite group written multiplicatively. By a sequence over $G$, we mean a finite sequence of terms from $G$ which is unordered, repetition of terms allowed, and we say that it is a product-one sequence if its terms can be…

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2\leq k\leq n$. For a set $S$ of $k$ vertices of $G$, let $\kappa (S)$ denote the maximum number $\ell$ of edge-disjoint trees $T_1,T_2,...,T_\ell$ in $G$…

Given a set of $t$ words of length $n$ over a $k$-letter alphabet, it is proved that there exists a common subsequence among two of them of length at least $\frac{n}{k}+cn^{1-1/(t-k-2)}$, for some $c>0$ depending on $k$ and $t$. This is…

Let $G=(\mathbb Z/n\mathbb Z) \oplus (\mathbb Z/n\mathbb Z)$. Let $\mathsf {s}_{\leq k}(G)$ be the smallest integer $\ell$ such that every sequence of $\ell$ terms from $G$, with repetition allowed, has a nonempty zero-sum subsequence with…

This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.

The Ulam sequence is given by $a_1 =1, a_2 = 2$, and then, for $n \geq 3$, the element $a_n$ is defined as the smallest integer that can be written as the sum of two distinct earlier elements in a unique way. This gives the sequence $1, 2,…

For a graph $G$ spanning a metric space, the dilation of a pair of points is the ratio of their distance in the shortest path graph metric to their distance in the metric space. Given a graph $G$ and a budget $k$, a classic problem is to…

For a finite abelian group $G$ and a positive integer $k$, let $\mathsf{D}_k(G)$ denote the smallest integer $\ell$ such that each sequence over $G$ of length at least $\ell$ has $k$ disjoint nontrivial zero-sum subsequences. It is known…

Let $G$ denote a distance-regular graph with diameter $D\ge 3$, valency $k$, and intersection numbers $a_i$, $b_i$, $c_i$. By a {\it pseudo cosine sequence} of $G$ we mean a sequence of real numbers $s_0, s_1, ..., s_D$ such that $s_0=1$…

Let G be a finite additive abelian group with exponent exp(G)=n>1 and let A be a nonempty subset of {1,...,n-1}. In this paper, we investigate the smallest positive integer $m$, denoted by s_A(G), such that any sequence {c_i}_{i=1}^m with…

Let $s$ be a finite sequence over a field of length $n$. It is well-known that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with…

Let $G$ be a connected Lie group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. In this paper, we introduce the notion of the length…