Related papers: Factorisation in the semiring of finite dynamical …
In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…
We discuss the large $N$ factorization properties of five-dimensional supersymmetric partition functions for CFT with a holographic dual. We consider partition functions on manifolds of the form $\mathcal{M}= \mathcal{M}_3 \times…
Factorized dynamics in soliton cellular automata with quantum group symmetry is identified with a motion of particles and anti-particles exhibiting pair creation and annihilation. An embedding scheme is presented showing that the…
Differential systems with a Fuchsian linear part are studied in regions including all the singularities in the complex plane of these equations. Such systems are not necessarily analytically equivalent to their linear part (they are not…
Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…
We introduce the {\it Ellis semigroup} of a nonautonomous discrete dynamical system $(X,f_{1,\infty})$ when $X$ is a metric compact space. The underlying set of this semigroup is the pointwise closure of $\{f\sp{n}_1 \, |\, n\in…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical…
In the first paper (part I) of this series of two, we introduce four novel definitions of the ODT problems: three for size-constrained trees and one for depth-constrained trees. These definitions are stated unambiguously through executable…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
We present a new approach to factor rotation for functional data. This is achieved by rotating the functional principal components toward a predefined space of periodic functions designed to decompose the total variation into components…
We extend a factorization due to Krein to arbitrary analytic functions from the upper half-plane to itself. The factorization represents every such function as a product of fractional linear factors times a function which, generally, has…
The work is devoted to constructing a wide class of differential-functional dynamical systems, whose rich algebraic structure makes their integrability analytically effective. In particular, there is analyzed in detail the operator Lax type…
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…
We propose a practicable method for describing linear dynamics of different finite Fermi systems. The method is based on a general self-consistent procedure for factorization of the two-body residual interaction. It is relevant for diverse…
In this paper the concept of $\mathbb{F}$-functorial of a finite group was introduced. These functorials have many properties of the Fitting subgroup of a soluble group and the generalized Fitting subgroup of a finite group. It was shown…
In this paper we give a concept of multi-dimensional-time dynamical system (MDTDS). Such dynamical system is generated by a finite family of functions $\{f_i\}$. The multi-dimensional-time space is taken as a free group. Using the subgroups…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
We discuss ground state factorization schemes in spin $S$ arrays with general $XYZ$ couplings under general magnetic fields, not necessarily uniform or transverse. It is first shown that given arbitrary spin alignment directions at each…
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…