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

For a commutative domain $R$ with nonzero identity and $I$ an ideal of $R$, we say $a=\lambda b_1 \cdots b_k$ is a $\tau_I$-factorization of $a$ if $\lambda \in R$ is a unit and $b_i \equiv b_j$(mod $I$) for all $1\leq i \leq j \leq k$.…

Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…

It is a classical result that a random permutation of $n$ elements has, on average, about $\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such…

In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…

In this thesis we present an introduction to Soft-Collinear Effective Theory, which can be used to prove (or disprove) factorization theorems to all orders in the strong coupling constant for some B decays into light and energetic…

We obtain estimates on the number $|\mathcal{A}_{\boldsymbol{\lambda}}|$ of elements on a linear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $n$ having factorization pattern…

We present a perturbation method for determining the moment stability of linear ordinary differential equations with parametric forcing by colored noise. In particular, the forcing arises from passing white noise through an $n$th order…

In this paper, we enumerate the pairs of permutations that are long cycles and whose product has a given cycle-type. Our main result is a simple relation concerning the desired numbers for a few related cycle-types. The relation refines a…

A method, known as ``minimal renormalon subtraction'' [Phys. Rev. D 97 (2018) 034503, JHEP 2017 (2017) 62], relates the factorial growth of a perturbative series (in QCD) to the power~$p$ of a power correction $\Lambda^p/Q^p$. ($\Lambda$ is…

Using the recently developed notion of permutation limits this paper derives the limiting distribution of the number of fixed points and cycle structure for any convergent sequence of random permutations, under mild regularity conditions.…

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

We show how to perform exact diagonalizations of $\mathrm{SU}(N)$ Fermi-Hubbard models on $L$-site clusters separately in each irreducible representation ({irrep}) of $\mathrm{SU}(N)$. Using the representation theory of the unitary group…

An outstanding problem in QCD and jet physics is the factorization and resummation of logarithms that arise due to phase space constraints, so-called non-global logarithms (NGLs). In this paper, we show that NGLs can be factorized and…

We factorize harmonic maps with values in a semisimple Lie groups in a product of harmonic maps with values in the components of the Iwasawa decomposition. In particular, we use this factorization to study the harmonic maps from…

Given an integer base $b\geq 2$, a number $\rho\geq 1$ of colors, and a finite sequence $\Lambda=(\lambda_1,\ldots,\lambda_\rho)$ of positive integers, we introduce the concept of a $\Lambda$-restricted $\rho$-colored $b$-ary partition of…

Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

In this paper we generalize permutations to plane permutations. We employ this framework to derive a combinatorial proof of a result of Zagier and Stanley, that enumerates the number of $n$-cycles $\omega$, for which $\omega(12\cdots n)$…

We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…

Consider a graph G with n nodes and m edges, which represents a social network, and assume that initially each node is blue or white. In each round, all nodes simultaneously update their color to the most frequent color in their…