Related papers: Factorization theorems and canonical representatio…
We show that any joint probability mass function (PMF) can be expressed as a product of parity check factors and factors of degree one with the help of some auxiliary variables, if the alphabet size is appropriate for defining a parity…
A generalization of the factorization technique is shown to be a powerful algebraic tool to discover further properties of a class of integrable systems in Quantum Mechanics. The method is applied in the study of radial oscillator, Morse…
In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on…
Among (conformal) quantum field theories, the rational conformal field theories are singled out by the fact that their correlators can be constructed from a modular tensor category C with a distinguished object, a symmetric special…
In this paper we prove a few propositions concerning factorizations of morphisms in pro categories, the most important of which solves an open problem of Isaksen concerning the existence of certain types of functorial factorizations. On our…
The notion of Lyndon word and Lyndon factorization has shown to have unexpected applications in theory as well in developing novel algorithms on words. A counterpart to these notions are those of inverse Lyndon word and inverse Lyndon…
The Boolean matrix factorization problem consists in approximating a matrix by the Boolean product of two smaller Boolean matrices. To obtain optimal solutions when the matrices to be factorized are small, we propose SAT and MaxSAT…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this…
We propose a natural definition of a category of matrix factorizations for nonaffine Landau-Ginzburg models. For any LG-model we construct a fully faithful functor from the category of matrix factorizations defined in this way to the…
Rational transformations of polynomials are extensively studied in the context of finite fields, especially for the construction of irreducible polynomials. In this paper, we consider the factorization of rational transformations with…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…
Let $G_n= \prod_{k=0}^n \binom{n}{k},$ the product of the elements of the $n$-th row of Pascal's triangle. This paper studies the partial factorizations of $G_n$ given by the product $G(n,x)$ of all prime factors $p$ of $G_n$ having $p \le…
The Theory of Functional Connections (TFC) is a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The functionals derived from this method, called \emph{constrained expressions},…
The freedom associated with the definition of parton distribution functions is analyzed and formulae governing the dependence of parton distribution functions and hard scattering cross-sections on unphysical quantities associated with the…
In the present article, a new method for the evaluation of fractional derivatives of arbitrary real order is proposed. Numerous but inequivalent formulations have been given in the past. Some of them exhibit unsatisfactory properties such…