Related papers: $\alpha$-$\beta$-Factorization and the Binary Case…
In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…
Commutative hypercomplex algebras offer significant advantages over traditional quaternions due to their compatibility with linear algebra techniques and efficient computational implementation, which is crucial for broad applicability. This…
This note is an attempt to attack a conjecture of Fraenkel and Simpson stated in 1998 concerning the number of distinct squares in a finite word. By counting the number of (right-)special factors, we give an upper bound of the number of…
In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into…
Given an element $f$ in a regular local ring, we study matrix factorizations of $f$ with $d \ge 2$ factors, that is, we study tuples of square matrices $(\varphi_1,\varphi_2,\dots,\varphi_d)$ such that their product is $f$ times an identity…
A remarkable feature of Schur functions -- the common eigenfunctions of cut-and-join operators from $W_\infty$ -- is that they factorize at the peculiar two-parametric topological locus in the space of time-variables, what is known as the…
Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…
We will use analytic function theory and Fourier analysis to establish a characterization for some classical umbral calculus, which will focus on the generalization of the evaluation function. Although we cannot cover all the umbral…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
This paper begins with a comprehensive overview of combinatorics on words and symbolic dynamics, covering their historical origins, fundamental concepts, and interconnections. Building upon this foundation, we introduce novel mathematical…
In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…
We equip the space of lattice cones with a coproduct which makes it a connected cograded colagebra. The exponential sum and exponential integral on lattice cones can be viewed as linear maps on this space with values in the space of…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
This article introduces new multiplicative updates for nonnegative matrix factorization with the $\beta$-divergence and sparse regularization of one of the two factors (say, the activation matrix). It is well known that the norm of the…
We show that the objective function of conventional k-means clustering can be expressed as the Frobenius norm of the difference of a data matrix and a low rank approximation of that data matrix. In short, we show that k-means clustering is…
We show that the Christensen-Sinclair factorization theorem, when the underlying Hilbert spaces are finite dimensional, is an instance of strong duality of semidefinite programming. This gives an elementary proof of the result and also…
In The factorization of the Giry monad (arXiv:1707.00488v2) the author considers two $\sigma$-algebras on convex spaces of functions to the unit interval. One of them is generated by the Boolean subobjects and the other is the…
Let $R=\oplus_{\Gamma\in\Gamma}R_{\gamma}$ be a $\Gamma$-graded $K$-algebra over a field $K$, where $\Gamma$ is a totally ordered semigroup, and let $I$ be an ideal of $R$. Considering the $\Gamma$-grading filtration $FR$ of $R$ and the…