Related papers: Block Stanley decompositions I. Elementary and gno…
This paper deals with linear time-varying, delay systems. Extensions of the concept of differential flatness \cite{Fliess_95} to this context have been first proposed in \cite{Mounier_95,Fliess_96} (see also \cite{Rudolph_03,Chyzak_05}), by…
We demonstrate that linear degeneracy is a necessary condition for quasilinear systems of Jordan block type to possess first-order Hamiltonian structures. Multi-Hamiltonian formulation of linearly degenerate systems governing…
Markov process is widely applied in almost all aspects of literature, especially important for understanding non-equilibrium processes. We introduce a decomposition to general Markov process in this paper. This decomposition decomposes the…
The new method of multivariate data analysis based on the complements of classical probability distribution to quantum state and Schmidt decomposition is presented. We considered Schmidt formalism application to problems of statistical…
We prove that every flat nonlinear discrete-time system can be decomposed by coordinate transformations into a smaller-dimensional subsystem and an endogenous dynamic feedback. For flat continuous-time systems, no comparable result is…
We consider all radiative corrections to the total electron-positron cross section showing how the renormalization group equation can be used to sum the logarithmic contributions in two ways. First of all, one can sum leading-log etc.…
We review Stanley's seminal work on the number of reduced words of the longest element of the symmetric group and his Stanley symmetric functions. We shed new light on this by giving a crystal theoretic interpretation in terms of decreasing…
We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any pre-existing structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into "system"…
Contraction analysis establishes exponential incremental convergence of a nonlinear system by solving a linear matrix inequality for a contraction metric, and has become a standard resource for solving problems in nonlinear control and…
An elementary introduction to Khovanov construction of superpolynomials. Despite its technical complexity, this method remains the only source of a definition of superpolynomials from the first principles and therefore is important for…
In 1954, Alston S. Householder published \textit{Principles of Numerical Analysis}, one of the first modern treatments on matrix decomposition that favored a (block) LU decomposition-the factorization of a matrix into the product of lower…
The decomposition of large unitary matrices into smaller ones is important, because it provides ways to realization of classical and quantum information processing schemes. Today, most of the methods use planar meshes of tunable two-channel…
We propose a class of very simple modifications of gradient descent and stochastic gradient descent. We show that when applied to a large variety of machine learning problems, ranging from logistic regression to deep neural nets, the…
These notes are not intended to substitute for a course in linear algebra on reduction of endomorphisms nor an exhaustive presentation of the Dunford's decomposition. We will limit ourselves to the case where the base is R or C, and the…
In this paper, we give new explicit representations of the Hilbert scheme of $\mu$ points in $\PP^{r}$ as a projective subvariety of a Grassmanniann variety. This new explicit description of the Hilbert scheme is simpler than the previous…
Constrained orthogonal polynomials have been recently introduced in the study of the Hohenberg-Kohn functional to provide basis functions satisfying particle number conservation for an expansion of the particle density. More generally, we…
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple…
For an inner form $\mathrm{G}$ of a general linear group or classical group over a non-archimedean local field of odd residue characteristic, we decompose the category of smooth representations on $\mathbb{Z}[\mu_{p^{\infty}},1/p]$-modules…
In this paper we study local Hamiltonian operators for multi-component evolutionary differential-difference equations. We address two main problems: the first one is the classification of low order operators for the two-component case. On…
In this paper a geometric field theory of dislocation dynamics and finite plasticity in single crystals is formulated. Starting from the multiplicative decomposition of the deformation gradient into elastic and plastic parts, we use…