Related papers: The sepr-sets of sign patterns
A survey of recent results in elementary number theory is presented in this paper. Special attention is given to structure and asymptotic properties of certain families of positive integers.
We study {\em sign-restricted matrices} (SRMs), a class of rectangular $(0, \pm 1)$-matrices generalizing the alternating sign matrices (ASMs). In an SRM each partial column sum, starting from row 1, equals 0 or 1, and each partial row sum,…
A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point-disjoint blocks. We prove that if a partial Steiner triple…
It is well known that Thom-Boardman symbols are realized by non-increasing sequences of nonnegative integers. A natural question is whether the converse is also true. In this paper we answer this question affirmatively, that is, for any…
A signed magic array, $SMA(m, n;s,t)$, is an $m \times n$ array with the same number of filled cells $s$ in each row and the same number of filled cells $t$ in each column, filled with a certain set of numbers that is symmetric about the…
We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.
It is known that any symmetric matrix $M$ with entries in $\R[x]$ and which is positive semi-definite for any substitution of $x\in\R$, has a Smith normal form whose diagonal coefficients are constant sign polynomials in $\R[x]$. We…
In this paper we formally define the family of sequences know as "Pea Pattern". We then analyse its behaviour and conditions for fixed and periodic points. The paper ends with a list of fixed points and cycles.
An alternating sign matrix is a square matrix satisfying (i) all entries are equal to 1, -1 or 0; (ii) every row and column has sum 1; (iii) in every row and column the non-zero entries alternate in sign. The 8-element group of symmetries…
Consider the set of scalars $\alpha$ for which the $\alpha$th Hadamard power of any $n\times n$ positive semi-definite (p.s.d.) matrix with non-negative entries is p.s.d. It is known that this set is of the form $\{0, 1, \dots, n-3\}\cup…
A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…
Finding separable certificates of stability is important for tractability of analysis methods for large-scale networked systems. In this paper we consider the question of when a nonlinear system which is contracting, i.e. all solutions are…
For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
To render a sequence testable, namely capable of identifying and detecting errors, it is necessary to apply a transformation that increases its length by introducing statistical dependence among symbols, as commonly exemplified by the…
Using an asymmetric associative network with synchronous updating, it is possible to recall a sequence of patterns. To obtain a stable sequence generation with a large storage capacity, we introduce a threshold that eliminates the…
The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets…
In this note we describe a method for finding prime numbers as fixed points of particularly simple sequences. Some basic calculations show that success rates for identifying primes this way are over 99.9%. In particular, it seems that the…
The paper makes the observation that all orders of information entropy are equal in signals composed of repeating units of distinct symbols where the units can be classified as a member of a symmetry group. This leads to an improved metric…
We consider the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. First a number of foundational results on…