Related papers: Decomposition theorem for invertible substitutions…
In this paper, we consider infinite words that arise as fixed points of primitive substitutions on a finite alphabet and finite colorings of their factors. Any such infinite word exhibits a "hierarchal structure" that will allow us to…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…
The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization.…
An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…
We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a…
The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…
We provide a decomposition that is sufficient in showing when a symmetric tridiagonal matrix $A$ is completely positive. Our decomposition can be applied to a wide range of matrices. We give alternate proofs for a number of related results…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
We describe all degenerations of three dimensional anticommutative algebras $\mathfrak{Acom}_3$ and of three dimensional Leibniz algebras $\mathfrak{Leib}_3$ over $\mathbb{C}.$ In particular, we describe all irreducible components and rigid…
We prove Horrocks' theorem for the odd elementary orthogonal group, which gives a decomposition of an orthogonal matrix with entries from a polynomial ring $R[X]$, over a commutative ring $R$ in which 2 is invertible, as a product of an…
We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…
We investigate a notion of inverse for neutrices inspired by Van den Berg and Koudjeti's decomposition of a neutrix as the product of a real number and an idempotent neutrix. We end up with an algebraic structure that can be characterized…
Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…
Tilings and point sets arising from substitutions are classical mathematical models of quasicrystals. Their hierarchical structure allows one to obtain concrete answers regarding spectral questions tied to the underlying measures and…
Let A be an idempotent algebra on a 3-element domain D that omits a G-set for a factor. Suppose A is not \alpha\beta-projective (for some alpha, beta subsets of D) and is not collapsible. It follows that A is switchable. We prove that, for…
We construct a supercharacter theory for the group of invertible elements of a reduced algebra. For the case of the triangular group, we obtain the formula for values of supercharacters on superclasses.