Related papers: A theorem on roots of unity and a combinatorial pr…

Let $R$ be a ring with ${\bf 1}$ which is not commutative. Assume that a non-zero commutator in $R$ is not a zero divisor. Assume further that either $R$ is alternative, but not associative, or $R$ is associative and any commutator $v\in R$…

In order to find a suitable expression of an arbitrary square matrix over an arbitrary finite commutative ring, we prove that every such a matrix is always representable as a sum of a potent matrix and a nilpotent matrix of order at most…

A symmetric tensor is completely positive (CP) if it is a sum of tensor powers of nonnegative vectors. This paper characterizes completely positive binary tensors. We show that a binary tensor is completely positive if and only if it…

We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…

We consider polynomials in R[x] which map the set of nonnegative (element-wise) matrices of a given order into itself. Let n be a positive integer and define P(n)= {p in R[x] : p(A) is nonnegative (element-wise), for all A, A an n-by-n…

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

We prove that all injective maps on positive complex matrices which preserve order and shrink spectrum are implemented by unitary or antiunitary conjugations. We show by counterexamples that all assumptions are indispensable. The result…

Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…

In this paper we study combinatorial aspects of permutations of $\{1,\ldots,n\}$ and related topics. In particular, we prove that there is a unique permutation $\pi$ of $\{1,\ldots,n\}$ such that all the numbers $k+\pi(k)$ ($k=1,\ldots,n$)…

Chebotarev's theorem on roots of unity states that all minors of the Fourier matrix of prime size are non-vanishing. This result has been rediscovered several times and proved via different techniques. We follow the proof of Evans and…

Pourchet proved in 1971 that every nonnegative univariate polynomial with rational coefficients is a sum of five or fewer squares. Nonetheless, there are no known algorithms for constructing such a decomposition. The sole purpose of the…

A set $S\subseteq\{0,1\}^E$ of binary vectors, with positions indexed by $E$, is said to be a \textit{powerful code} if, for all $X\subseteq E$, the number of vectors in $S$ that are zero in the positions indexed by $X$ is a power of 2. By…

The well-known Leibniz theorem (Leibniz Criterion or alternating series test) of convergence of alternating series is generalized for the case when the absolute value of terms of series are "not absolutely monotonously" convergent to zero.…

We prove that for each multiplicative subgroup $A$ of finite index in $\mathbb{Q}^+$, the set of integers $a$ with $a, a+1 \in A$ is an IP-set. This generalizes a theorem of Hildebrand concerning completely multiplicative functions taking…

Recently, in [Bor4], Bor proved a main theorem dealing with $|\bar{N}, p_{n}|_{k}$ summability factors of infinite series. In the present paper, we have generalized that theorem for $|A, p_{n}|_{k}$ summability method by taking normal…

We introduce fusion algebras with not necessarily positive structure constants and without identity element. We prove that they are semisimple when tensored with $\mathbb{C}$ and that their characters satisfy orthogonality relations. Then…

Let $d(\cdot)$ denote the natural density on the positive integers. We characterize all sets $A,B$ with positive density satisfying $d(A+B)=d(A)+d(B)$, under the assumption that the two sets are not both contained in a proper finite union…

We provide a combinatorial interpretation of Lah numbers by means of planar networks. Henceforth, as a conesquence of Lindstr\"om's lemma, we conclude that the related Lah matrix possesses a remarkable property of total non-negativity.

A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…

For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…