Related papers: Approximate factorization and concentration for ch…

Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…

In this paper we propose a general spectral theory for tensors. Our proposed factorization decomposes a tensor into a product of orthogonal and scaling tensors. At the same time, our factorization yields an expansion of a tensor as a…

In this article, we analyze the behaviour of the new family of Kantorovich type exponential sampling series. We obtain the point-wise approxi mation theorem and Voronovskaya type theorem for the series. Further, we obtain a representation…

Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…

Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…

The generalization of the the Yang-Baxter relation is proposed. In this generalization the spectral parameters of the particles change after the scattering. The corresponding algebraic structures are discussed. The corresponding action of…

It is known that extreme characters of several inductive limits of compact groups exhibit multiplicativity in a certain sense. In the paper, we formulate such multiplicativity for inductive limit quantum groups and provide explicit examples…

We study asymptotics of representations of the unitary groups U(n) in the limit as n tends to infinity and we show that in many aspects they behave like large random matrices. In particular, we prove that the highest weight of a random…

In an earlier paper [1] it was shown that the Frobenius compound characters for the symmetric groups are related to the irreducible characters by a linear relation that involves a unitriagular coupling matrix that gives the Frobenius…

The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly focus on {\it algorithmic procedures} for a small set of…

We compute the auto-correlations functions of order $m\ge 1$ for the characteristic polynomials of random matrices from certain subgroups of the unitary groups $\U(2)$ and $\U(3)$ by applying branching rules. These subgroups can be…

Ramsey theory for words over a finite alphabet was unified in the work of Carlson and Furstenberg-Katznelson. Carlson, in the same work, outlined a method to extend the theory for words over an infinite alphabet, but subject to a fixed…

We provide arguments for the use of the rational form of unitarization, its relation with the diffraction peak shrinkage and asymptotics of the inelastic cross--section. The particular problems of the Regge model and the exponential form of…

We provide finite-sample distribution approximations, that are uniform in the parameter, for inference in linear mixed models. Focus is on variances and covariances of random effects in cases where existing theory fails because their…

We show that any quantum density matrix can be represented by a Bayesian network (a directed acyclic graph), and also by a Markov network (an undirected graph). We show that any Bayesian or Markov net that represents a density matrix, is…

We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…

Approximation of a tensor network by approximating (e.g., factorizing) one or more of its constituent tensors can be improved by canceling the leading-order error due to the constituents' approximation. The utility of such robust…

In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle $(1~2\dots n)$ into a product of $n-1$ transpositions satisfying monotonicity conditions. We explicit a bijection between…

Probabilistic graphical models are a key tool in machine learning applications. Computing the partition function, i.e., normalizing constant, is a fundamental task of statistical inference but it is generally computationally intractable,…

We prove the existence of cluster characters for Hom-infinite cluster categories. For this purpose, we introduce a suitable mutation-invariant subcategory of the cluster category. We sketch how to apply our results in order to categorify…