Related papers: Random stable type minimal factorizations of the $…

Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale across features, a…

For a numerical semigroup $S := \langle n_1, \dots, n_k \rangle$ with minimal generators $n_1 < \cdots < n_k$, Barron, O'Neill, and Pelayo showed that $L(s+n_1) = L(s) + 1$ and $\ell(s+n_k) = \ell(s) + 1$ for all sufficiently large $s \in…

In 2011, Anderson and Frazier define the concept of $\tau_{(n)}$-factorization, where $\tau_{(n)}$ is a restriction of the modulo $n$ equivalence relation. These relations have been worked mostly for small values of $n$. However, it is…

We study the renormalization of normal mixing matrices, which includes hermitian and unitary matrices as particular cases. We give a minimal, multiplicative parametrization of counterterms, and compute the renormalized Lagrangian to…

We introduce a type $A$ crystal structure on decreasing factorizations of fully-commutative elements in the 0-Hecke monoid which we call $\star$-crystal. This crystal is a $K$-theoretic generalization of the crystal on decreasing…

We prove a factorization theorem in QCD for the color suppressed decays B0-> D0 M0 and B0-> D*0 M0 where M is a light meson. Both the color-suppressed and W-exchange/annihilation amplitudes contribute at lowest order in LambdaQCD/Q where…

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 consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

Given an element $f$ in a regular local ring, we study matrix factorizations of $f$ with $d \ge 2$ factors, that is, we study tuples of square matrices $(\varphi_1,\varphi_2,\dots,\varphi_d)$ such that their product is $f$ times an identity…

We formulate a $\mathbb{Z}_k$-parafermionization/bosonization scheme for one-dimensional lattice models and field theories on a torus, starting from a generalized Jordan-Wigner transformation on a lattice, which extends the Majorana-Ising…

A simple example is used to show that renormalization group limit cycles of effective quantum theories can be studied in a new way. The method is based on the similarity renormalization group procedure for Hamiltonians. The example contains…

We associate a complete intersection singularity to a graded matrix factorization of size two of a polynomial in three variables. We show that we get an inverse to the reduction of singularities considered by C.T.C.Wall. We study this for…

We present a consistent fusion of functional renormalization group and mean-field theory which explicitly introduces a bosonic field via a Hubbard-Stratonovich transformation at the critical scale, at which the order sets in. We show that a…

We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…

We study the occurrence of ground-state factorization in dimerized $XY$ spin chains in a transverse field. Together with the usual ferromagnetic and antiferromagnetic regimes, a third case emerges, with no analogous in…

We compute the limit distribution for (centered and scaled) length of the longest increasing subsequence of random colored permutations. The limit distribution function is a power of that for usual random permutations computed recently by…

Factor complexity $b_\phi(n)$ for a vertex coloring $\phi$ of a regular tree is the number of colored $n$-balls up to color-preserving automorphisms. Sturmian colorings are colorings of minimal unbounded factor complexity $b_\phi(n) = n+2$.…

We give two combinatorial proofs of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number…

In this paper, we study the distribution of the number of occurrences of the simplest frame pattern, called the $\mu$ pattern, in $n$-cycles. Given an $n$-cycle $C$, we say that a pair $\langle i,j \rangle$ matches the $\mu$ pattern if $i <…

We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…