Related papers: Conjugation of reddening sequences and conjugation…
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$;…
Clustering algorithms start with a fixed divergence, which captures the possibly asymmetric distance between a sample and a centroid. In the mixture model setting, the sample distribution plays the same role. When all attributes have the…
We will exhibit several instances of the cyclic sieving phenomenon involving statistics and involutions on the following combinatorial families of objects: permutations, set partitions, perfect matchings, D-permutations (and its…
The present article is the first of a series whose goal is to define a logical formalism in which it is possible to reason about genetics. In this paper, we introduce the main concepts of our language whose domain of discourse consists of a…
Let $A$ be a finite dimensional hereditary algebra over an algebraically closed field $k$, $A^{(m)}$ be the $m$-replicated algebra of $A$ and $\mathscr{C}_{m}(A)$ be the $m$-cluster category of $ A$. We investigate properties of complements…
We establish some properties of $\tau$-exceptional sequences for finite-dimensional algebras. In an earlier paper we established a bijection between the set of ordered support $\tau$-tilting modules and the set of complete signed…
Given a framed quiver, i.e. one with a frozen vertex associated to each mutable vertex, there is a concept of green mutation, as introduced by Keller. Maximal sequences of such mutations, known as maximal green sequences, are important in…
In this paper, we study the spectrum and the eigenvectors of radial kernels for mixtures of distributions in $\mathbb{R}^n$. Our approach focuses on high dimensions and relies solely on the concentration properties of the components in the…
We consider difference equations of order four and determine the one parameter Lie group of transformations (Lie symmetries) that leave them invariant. We introduce a technique for finding their first integrals and discuss the association…
In 2016, Leclerc constructed conjectural cluster structures on open Richardson varieties using representations of preprojective algebras. A variant with more explicit seeds was obtained by M\'enard in his thesis. We show that M\'enard's…
Subsets of a matrix algebra over a field that are invariant under conjugation and contain the linear span of each two of their commuting elements are described. They obviously include the subsets of diagonalizable and nilpotent matrices. In…
The branching rules between simple Lie algebras and its regular (maximal) simple subalgebras are studied. Two types of recursion relations for anomalous relative multiplicities are obtained. One of them is proved to be the factorized…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
Given a feature set for the shape of a closed loop, it is natural to ask which features in that set do not change when the starting point of the path is moved. For example, in two dimensions, the area enclosed by the path does not depend on…
This work is devoted to the study of first order linear problems with involution and periodic boundary value conditions. We first prove a correspondence between a large set of such problems with different involutions to later focus our…
Cluster randomized trials with measurements at baseline can improve power over post-test only designs by using difference in difference designs. However, subjects may be lost to follow-up between the baseline and follow-up periods. While…
Inversions, also sometimes called reversals, are a major contributor to variation among bacterial genomes, with studies suggesting that those involving small numbers of regions are more likely than larger inversions. Deletions may arise in…
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…
The log-det distance between two aligned DNA sequences was introduced as a tool for statistically consistent inference of a gene tree under simple non-mixture models of sequence evolution. Here we prove that the log-det distance, coupled…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…