Related papers: Factorisation in the semiring of finite dynamical …
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
In a previous work we showcased the factorization method to find the symmetries of superintegrable systems with spherical separability in flat spaces. Here we analyze the same problem, but in constant curvature spaces along the examples of…
In this article, a novel Finite Time Stability (FTS) analysis of Fractional-Order Time Delay Systems (FOTDSs) is proposed. By using the fixed point approach, sufficient conditions for the robust FTS of FOTDSs have been established. Two…
We give a number of explicit matrix-algorithms for analysis/synthesis in multi-phase filtering; i.e., the operation on discrete-time signals which allow a separation into frequency-band components, one for each of the ranges of bands, say…
Orders in an algebraic number field form a class of rings which are of special historical interest to the field of factorization theory. One of the primary tools used to study factorization is elasticity - a measure of how badly unique…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
Flow and Diffusion Distributed Structures (FDS) are stationary spatially periodic patterns that can be observed in reaction-diffusion-advection systems. These structures arise when the flow rate exceeds a certain bifurcation point provided…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
An integral domain (or a commutative cancellative monoid) is atomic if every nonzero nonunit element is the product of irreducibles, and it satisfies the ACCP if every ascending chain of principal ideals eventually stabilizes. The interplay…
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…
Given a join semilattice $S$ with a minimum $\hat{0}$, the quarks (also called atoms in order theory) are the elements that cover $\hat{0}$, and for each $x \in S \setminus \{\hat{0}\}$ a factorization (into quarks) of $x$ is a minimal set…
We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…
The fast assembling of stiffness and mass matrices is a key issue in isogeometric analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one…
The factorization theorems of quantum chromodynamics (QCD) apply equally well to most simple quantum field theories that require renormalization but where direct calculations are much more straightforward. Working with these simpler…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…
This paper deals with the fault detection and isolation (FDI) problem for linear structured systems in which the system matrices are given by zero/nonzero/arbitrary pattern matrices. In this paper, we follow a geometric approach to verify…
Linear finite dynamical systems play an important role, for example, in coding theory and simulations. Methods for analyzing such systems are often restricted to cases in which the system is defined over a field %and usually strive to…
We present in a simple terms the theory of the factorizing operator introduced recently by Maillet and Sanches de Santos for the spin - 1/2 chains. We obtain the explicit expressions for the matrix elements of the factorizing operator in…