Related papers: Factorisation in the semiring of finite dynamical …
One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After "normalization," a sum of products has a natural graphical representation, called a normal…
Let $\mathcal{F}=\{F_{\alpha}: \alpha\in \mathcal{A}\}$ be a family of infinite graphs, together with $\Lambda$. The Factorization Problem $FP(\mathcal{F}, \Lambda)$ asks whether $\mathcal{F}$ can be realized as a factorization of…
A class of two-dimensional superintegrable systems on a constant curvature surface is considered as the natural generalization of some well known one-dimensional factorized systems. By using standard methods to find the shape-invariant…
A remarkable connection has been established for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degree D…
A subset $S$ of an integral domain $R$ is called a semidomain provided that the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities. The study of factorizations in integral domains was initiated by Anderson, Anderson, and…
Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible…
A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…
We investigate the dynamic behavior of finite-size systems close to a first-order transition (FOT). We develop a dynamic finite-size scaling (DFSS) theory for the dynamic behavior in the coexistence region where different phases coexist. It…
The representation theory of finite groups began with Frobenius's factorization of Dedekind's group determinant. In this paper, we consider the case of the semigroup determinant. The semigroup determinant is nonzero if and only if the…
Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…
Consider an input-output system where the output is the tracking error given some desired reference signal. It is natural to consider under what conditions the problem has an exact solution, that is, the tracking error is exactly the zero…
We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…
We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…
Symmetric nonnegative matrix factorization (NMF), a special but important class of the general NMF, is demonstrated to be useful for data analysis and in particular for various clustering tasks. Unfortunately, designing fast algorithms for…
Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…
We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups.…
Given a saturated fusion system $\mathcal{F}$ over a finite $p$-group $S$, we provide criteria to determine when uniqueness of factorization into irreducible $\mathcal{F}$--invariant representations holds. We use them to prove uniqueness of…
A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…
Matrix factorization exploits the idea that, in complex high-dimensional data, the actual signal typically lies in lower-dimensional structures. These lower dimensional objects provide useful insight, with interpretability favored by sparse…