English
Related papers

Related papers: The shallow permutations are the unlinked permutat…

200 papers

Various types of walks on complex networks have been used in recent years to model search and navigation in several kinds of systems, with particular emphasis on random walks. This gives valuable information on network properties, but…

Disordered Systems and Neural Networks · Physics 2019-01-24 Carlos P. Herrero

It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group…

Combinatorics · Mathematics 2021-01-29 Philippe Biane , Matthieu Josuat-Vergès

This paper explores the mixing time of the random transposition walk on permutations with one-sided interval restrictions. In particular, we're interested in the notion of cutoff, a phenomenon which occurs when mixing occurs in a window of…

Probability · Mathematics 2012-02-23 Olena Blumberg

Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…

Number Theory · Mathematics 2022-05-30 John L Simons

We give refined estimates for the discrete time and continuous time versions of some basic random walks on the symmetric and alternating groups $S_n$ and $A_n$. We consider the following models: random transposition, transpose top with…

Probability · Mathematics 2008-09-04 L. Saloff-Coste , J. Zuniga

The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…

Geometric Topology · Mathematics 2026-03-17 Michal Jablonowski

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…

Group Theory · Mathematics 2022-03-09 Kevin Kordek , Qiao Li , Caleb Partin

In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…

Combinatorics · Mathematics 2014-01-29 Igor Artemenko

To a special type of grope embedded in 4-space, that we call an admissible grope, we associate a length function for each real number q at least 1. This gives rise to a family of pseudo-metrics d^q, refining the slice genus metric, on the…

Geometric Topology · Mathematics 2017-06-29 Tim D. Cochran , Shelly Harvey , Mark Powell

The flip symmetry on knot diagrams induces an involution on Khovanov homology. We prove that this involution is determined by its behavior on unlinks; in particular, it is the identity map when working over $\mathbb{F}_2$. This confirms a…

Geometric Topology · Mathematics 2026-03-06 Daren Chen , Hongjian Yang

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

Combinatorics · Mathematics 2015-08-19 Charles Burnette , Eric Schmutz

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

Probability · Mathematics 2023-01-09 Christopher Hoffman , Douglas Rizzolo , Erik Slivken

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

Combinatorics · Mathematics 2026-05-27 Arnau Padrol , Germain Poullot

Using the symplectic geometry of certain manifolds which appear naturally in Lie theory, we define an invariant which assigns a graded abelian group to an oriented link. The relevant manifolds are transverse slices to certain nilpotent…

Symplectic Geometry · Mathematics 2007-05-23 Paul Seidel , Ivan Smith

This paper studies the linking numbers of random links within the grid model. The linking number is treated as a random variable on the isotopy classes of 2-component links, with the paper exploring its asymptotic growth as the diagram size…

Geometric Topology · Mathematics 2025-06-04 Senja Barthel , Yuka Kotorii

We study the random walk on the symmetric group $S_n$ generated by the conjugacy class of cycles of length $k$. We show that the convergence to uniform measure of this walk has a cut-off in total variation distance after $\frac{n}{k} log n$…

Probability · Mathematics 2016-05-04 Bob Hough

We introduce a sub-symmetry of a differential system as an infinitesimal transformation of a subset of the system that leaves the subset invariant on the solution set of the entire system. We discuss the geometrical meaning and properties…

Mathematical Physics · Physics 2017-05-03 V. Rosenhaus , Ravi Shankar

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

Classical Analysis and ODEs · Mathematics 2014-09-23 Michael Hochman

Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…

Information Theory · Computer Science 2026-02-24 Susanne Pumpluen
‹ Prev 1 3 4 5 6 7 10 Next ›