English
Related papers

Related papers: Conjugation of reddening sequences and conjugation…

200 papers

We extend the analysis of KLWMIJ evolution in terms of QCD Reggeon fields beyond leading order in the $1/N_c$ expansion. We show that there is only one type of corrections to the leading order Hamiltonian discussed in \cite{last}. These are…

High Energy Physics - Phenomenology · Physics 2015-06-18 Tolga Altinoluk , Néstor Armesto , Alex Kovner , Eugene Levin , Michael Lublinsky

A mutation will affect an individual and some or all of its descendants. In this paper, we investigate ordered trees with a distinguished vertex called the mutator. We describe various mutations in ordered trees, and find the generating…

Combinatorics · Mathematics 2014-10-07 Gi-Sang Cheon , Hana Kim , Louis W. Shapiro

By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…

Logic · Mathematics 2013-12-25 Mauro Di Nasso

Let $\beta$ be any permutation on $n$ symbols and let $c(k, \beta)$ be the number of permutations that $k$-commute with $\beta$. The cycle type of a permutation $\beta$ is a vector $(c_1, \dots, c_n)$ such that $\beta$ has exactly $c_i$…

Combinatorics · Mathematics 2015-12-01 Luis Manuel Rivera

We classify degeneration patterns of Verma modules over the N=2 superconformal algebra in two dimensions. Explicit formulae are given for singular vectors that generate maximal submodules in each of the degenerate cases. The mappings…

High Energy Physics - Theory · Physics 2009-10-30 A M Semikhatov , I Yu Tipunin

By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on…

Number Theory · Mathematics 2007-05-23 Jason Fulman

We begin with recalling the correspond theorem of induced modules and global sections of vector bundles. After that, we give a generalization of this theorem. Finally, we apply the result to branching laws, and give some concrete examples.

Representation Theory · Mathematics 2013-12-09 Haian He

We present two simple descriptions of the denominator vectors of the cluster variables of a cluster algebra of finite type, with respect to any initial cluster seed: one in terms of the compatibility degrees between almost positive roots…

Combinatorics · Mathematics 2015-05-27 Cesar Ceballos , Vincent Pilaud

Matrix mutation appears in the definition of cluster algebras of Fomin and Zelevinsky. We give a representation theoretic interpretation of matrix mutation, using tilting theory in cluster categories of hereditary algebras. Using this, we…

Representation Theory · Mathematics 2020-12-21 Aslak Bakke Buan , Bethany Marsh , Idun Reiten

We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…

Combinatorics · Mathematics 2023-05-18 Jesse Campion Loth , Michael Levet , Kevin Liu , Eric Nathan Stucky , Sheila Sundaram , Mei Yin

We generalize the theory of integer $C$-, $G$-matrices in cluster algebras to the real case. By a skew-symmetrizing method, we can reduce the problem of skew-symmetrizable patterns to the one of skew-symmetric patterns. In this sense, we…

Representation Theory · Mathematics 2025-11-24 Ryota Akagi , Zhichao Chen

We study a minimal model for genome evolution whose elementary processes are single site mutation, duplication and deletion of sequence regions and insertion of random segments. These processes are found to generate long-range correlations…

Genomics · Quantitative Biology 2007-05-23 Philipp W. Messer , Peter F. Arndt , Michael Lässig

The sign coherence of $c$-vectors is one of the fundamental theorems of cluster algebras with principal coefficients. In 2019, Gekhtman and Nakanishi posed the asymptotic sign coherence conjecture for arbitrary cluster algebras of geometric…

Combinatorics · Mathematics 2026-05-14 Amanda Burcroff , Scott Neville

Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.

Combinatorics · Mathematics 2012-04-06 Alina F. Y. Zhao

We find the range of the major index on the various conjugacy classes of involutions in the symmetric group $S_n$. In addition to indicating the minimum and the maximum values, we show that except for the case of involutions without fixed…

Combinatorics · Mathematics 2023-10-12 Eli Bagno , Yisca Kares

With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation -- bringing two replicas of the same data structure as close as possible…

Information Theory · Computer Science 2022-08-10 Elod P. Csirmaz , Laszlo Csirmaz

In general, the existence of a maximal green sequence is not mutation invariant. In this paper we show that it is in fact mutation invariant for cluster quivers of finite mutation type. In particular, we show that a mutation finite cluster…

Combinatorics · Mathematics 2016-06-14 Matthew R. Mills

The congruential rule advanced by Graves for polarization basis transformation of the radar backscatter matrix is now often misinterpreted as an example of consimilarity transformation. However, consimilarity transformations imply a…

Optics · Physics 2013-09-02 David Bebbington , Laura Carrea

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

Number Theory · Mathematics 2015-06-30 Tewodros Amdeberhan , Roberto Tauraso

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Discrete Mathematics · Computer Science 2024-06-25 Atli Fannar Franklín , Anders Claesson , Christian Bean , Henning Úlfarsson , Jay Pantone