Related papers: An Analytic Proof of the Matrix Spectral Factoriza…
The explicit evaluation of the partition function in the Schwarzian theory is presented.
It is proved that each of compact linear groups of one special type admits a semialgebraic continuous factorization map onto a real vector space.
In this paper, we revisit implicit regularization from the ground up using notions from dynamical systems and invariant subspaces of Morse functions. The key contributions are a new criterion for implicit regularization---a leading…
The strong factorization conjecture states that a proper birational map between smooth algebraic varieties over a field of characteristic zero can be factored as a sequence of smooth blowups followed by a sequence of smooth blowdowns. We…
We show that Fueter's theorem holds for a more general class of quaternionic functions than those constructed by the Fueter's method.
The zeta function of a motive over a finite field is multiplicative with respect to the direct sum of motives. It has beautiful analytic properties, as were predicted by the Weil conjectures. There is also a multiplicative zeta function,…
In [2] a new factorization for infinite Hessenberg banded matrices was introduced. In this note we prove that this kind of factorization can also be used for finite matrices. In addition, a new method for solving banded linear systems is…
In this paper we present parallel theories on constructing Wiener algebras in the bicomplex setting. With the appropriate symmetry condition, the bicomplex matrix valued case can be seen as a complex valued case and, in this matrix valued…
We apply the factorization and vector bundle propositionerty of the sheaves of conformal blocks on $\overline{\mathscr{M}}_{g,n}$. defined by vertex operator algebras (VOAs) and give geometric proofs of essential results in the…
We consider certain scalar product of symmetric functions which is parameterized by a function $r$ and an integer $n$. One the one hand we have a fermionic representation of this scalar product. On the other hand we get a representation of…
We present a partial proof of van Hoeij-Abramov conjecture about the algorithmic possibility of computation of finite sums of rational functions. The theoretical results proved in this paper provide an algorithm for computation of a large…
We present a unitary approach to the construction of representations and intertwining operators. We apply it to the $C^*$-algebras, groups, Gabor type unitary systems and wavelets. We give an application of our method to the theory of…
We provide a proof of the Borwein Conjecture using analytic methods.
$\DeclareMathOperator{\Int}{Int}\DeclareMathOperator{\IntR}{Int{}^\text{R}}$For a domain $D$, the ring $\Int(D)$ of integer-valued polynomials over $D$ is atomic if $D$ satisfies the ascending chain condition on principal ideals. However,…
The ability to represent complex high dimensional probability distributions in a compact form is one of the key insights in the field of graphical models. Factored representations are ubiquitous in machine learning and lead to major…
We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…
In this paper, we develop efficient and accurate algorithms for evaluating $\varphi(A)$ and $\varphi(A)b$, where $A$ is an $N\times N$ matrix, $b$ is an $N$ dimensional vector and $\varphi$ is the function defined by…
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…
In this article, some factorization properties of polynomials over discrete valuation domains are elucidated. These properties along with the notion of Newton index of a polynomial leads to a generalization of the main result proved by…
An equivalence relation in the symmetric group, where is a positive integer has been considered. An algorithm for calculation of the number of the equivalence classes by this relation for arbitrary integer has been described.