English
Related papers

Related papers: The cyclic sieving phenomenon on circular Dyck pat…

200 papers

In this article, a $q$-series examined by Kluyver and Uchimura is generalized. This allows us to find generalization of the identities in the random acyclic digraph studied by Simon, Crippa, and Collenberg in 1993. As one of the corollaries…

Number Theory · Mathematics 2020-12-22 Rajat Gupta , Rahul Kumar

We use a construction which we call generalized cylinders to give a new proof of the fundamental theorem of hypersurface theory. It has the advantage of being very simple and the result directly extends to semi-Riemannian manifolds and to…

Differential Geometry · Mathematics 2019-01-08 Christian Baer , Paul Gauduchon , Andrei Moroianu

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

Combinatorics · Mathematics 2008-12-16 Jun Ma , Yeong-Nan Yeh

This article initiates a geometric study of the automorphism groups of general graph products of groups, and investigates the algebraic and geometric structure of automorphism groups of cyclic product of groups. For a cyclic product of at…

Group Theory · Mathematics 2018-03-21 Anthony Genevois , Alexandre Martin

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…

Combinatorics · Mathematics 2020-11-30 Pablo Soberón , Yaqian Tang

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

Combinatorics · Mathematics 2024-04-10 Jonas Frede , Volker Kaibel , Maximilian Merkert

We consider the problem of counting the set of $\mathscr{D}_{a,b}$ of Dyck paths inscribed in a rectangle of size $a\times b$. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers…

Combinatorics · Mathematics 2015-09-28 Jose Eduardo Blazek

Dyck paths categories are introduced as a combinatorial model of the category of representations of quivers of Dynkin type An. In particular, it is proved that there is a bijection between some Dyck paths and perfect matchings of some snake…

Representation Theory · Mathematics 2021-02-08 Agustín Moreno Cañadas , Gabriel Bravo Ríos

We consider symplectic singularities in the sense of A. Beauville as examples of Poisson schemes. Using Poisson methods, we prove that a symplectic singularity admits a finite stratification with smooth symplectic strata. We also prove that…

Algebraic Geometry · Mathematics 2007-05-23 D. Kaledin

We develop a geometric mechanism to prove the existence of orbits that drift along a prescribed sequence of cylinders, under some general conditions on the dynamics. This mechanism can be used to prove the existence of Arnold diffusion for…

Dynamical Systems · Mathematics 2022-08-10 Marian Gidea , Jean-Pierre Marco

We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…

Combinatorics · Mathematics 2007-12-20 J. Irving , A. Rattan

Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…

Discrete Mathematics · Computer Science 2017-12-05 Xiangying Chen

In this paper we study the quenched distributions of hitting times for a class of random dynamical systems. We prove that hitting times to dynamically defined cylinders converge to a Poisson point process under the law of random equivariant…

Dynamical Systems · Mathematics 2020-11-30 Harry Crimmins , Benoît Saussol

We describe a very general abstract form of sieve based on a large sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function…

Number Theory · Mathematics 2007-05-23 Emmanuel Kowalski

It is known that backward iterations of independent copies of a contractive random Lipschitz function converge almost surely under mild assumptions. By a sieving (or thinning) procedure based on adding to the functions time and space…

Probability · Mathematics 2020-03-25 Alexander Marynych , Ilya Molchanov

We give a new proof of the $k$-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called $k$-in-$n$ dissections. Furthermore, we give a formula for the average number of cycles in a…

Combinatorics · Mathematics 2011-09-06 Alon Regev

In this paper, we formulate a rational analog of the fall Delta theorem and the Delta square conjecture. We find a new dinv statistic on fall-decorated paths on a $(m+k) \times (n+k)$ rectangle that simultaneously extends the previously…

Combinatorics · Mathematics 2025-08-29 Alessandro Iraci , Roberto Pagaria , Giovanni Paolini

We prove existence of intersection exponents xi(k,lambda) for biased random walks on d-dimensional half-infinite discrete cylinders, and show that, as functions of lambda, these exponents are real analytic. As part of the argument, we prove…

Probability · Mathematics 2008-10-06 Brigitta Vermesi

We consider multifold convolutions of a combinatorial sequence $(a_n)_{n=0}^{\infty}$: namely, for each $k \in \N$ the $k$-fold convolution is $\mathcal{M}^{(k)}_n(\boldsymbol{a}) = \sum_{j_1+\dots+j_k=n} a_{j_1} \cdots a_{j_k}$. Let $C_n$…

Combinatorics · Mathematics 2025-01-06 Timothy Li , Shannon Starr

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…

Combinatorics · Mathematics 2016-08-18 S. P. Glasby
‹ Prev 1 3 4 5 6 7 10 Next ›