Related papers: Circular Sequences and the Diameter of Multipermut…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…
We present a new proof of a fundamental result concerning cycles of random permutations which gives some intuition for the connection between Touchard polynomials and the Poisson distribution. We also introduce a rather novel permutation…
We investigate $N$-extended supersymmetry in one-dimensional quantum mechanics on a circle with point singularities. For any integer $n$, $N=2n+1$ supercharges are explicitly constructed in terms of discrete transformations, and a class of…
A multicomplex, also known as a twisted chain complex, has an associated spectral sequence via a filtration of its total complex. We give explicit formulas for all the differentials in this spectral sequence.
We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover we give examples of Shimura curves that do not descend over their field…
We study properties of 3-restricted min-wise independent sets of permutations and prove that the class of these sets is isomorphic to the class of subsets of vertices of multi-dimentional hypercube of certain size with certain pair-wise…
In this paper, we determine the diameter of the commuting involution graphs of special and general linear groups over an arbitrary field. It turns out that our results also determine the diameter for certain projective special linear groups…
An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…
We give a generating function for the number of unimodal permutations with a given cycle structure.
We characterize the expressive power of quantum circuits with the pseudo-dimension, a measure of complexity for probabilistic concept classes. We prove pseudo-dimension bounds on the output probability distributions of quantum circuits; the…
We compute the limit distribution of partial transposes (when both the number and the size of blocks tends to infinity) for a large class of ensembles of unitarily invariant random matrices. Furthermore, it is shown the asymptotic freeness…
Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. Here circuit directions are non-trivial solutions to…
In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of intervals. Motivated by a recent paper of Keller, Trenk, and…
In this paper, we study the occurrence of patterns in the cycle structures of permutations.
We study limit cycles in piecewise complex systems with switching manifold $\mathbb{S}^1$. Using M\"obius transformations we establish an equivalence between circular and straight-line discontinuities that preserves periods, stability, and…
Motivated by a problem in quantum field theory, we study the up and down structure of circular and linear permutations. In particular, we count the length of the (alternating) runs of permutations by representing them as monomials and find…
The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…
The representation theory of a commutative noetherian ring is tightly controlled by its prime spectrum. In this article we use the prime spectrum to describe mutation of cosilting objects in the derived category of a commutative noetherian…
In this paper we deal with the dimension of multisequences and related properties. For a given multisequence W and an m tuple of positive integers R, we define the R extension of W. Further we count the number of multisequences W whose R…
We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are described up to isomorphism.