output
19932020
most citedRotation equivariant vector field networks

242 citations

Showing math.COShow all

64 papers · 1 filter

math.CO2019★ 7 cited

The Steep-Bounce Zeta Map in Parabolic Cataland

Cesar Ceballos, Wenjie Fang, Henri Mühle

As a classical object, the Tamari lattice has many generalizations, including -Tamari lattices and parabolic Tamari lattices. In this article, we unify these generalizations in…

math.CO2018★ 9 cited

Induced Saturation of Graphs

Maria Axenovich, Mónika Csikós

A graph is -saturated for a graph , if does not contain a copy of but adding any new edge to results in such a copy. An -saturated graph on a given number…

math.CO2018★ 2 cited

Extensions of partial cyclic orders and consecutive coordinate polytopes

Arvind Ayyer, Matthieu Josuat-Vergès, Sanjay Ramassamy

We introduce several classes of polytopes contained in and cut out by inequalities involving sums of consecutive coordinates. We show that the normalized volumes of these…

math.CO2018★ 4 cited

A partial order on Motzkin paths

Wenjie Fang

The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other famili…

math.CO2017★ 1 cited

On a topological version of Pach's overlap theorem

Boris Bukh, Alfredo Hubard

Pach showed that every sets of points contain linearly-sized subsets such that all the transversal simplices that t…

math.CO2017

Embeddability of arrangements of pseudocircles and graphs on surfaces

Éric Colin de Verdière, Carolina Medina, Edgardo Roldán-Pensado +1

A pseudocircle is a simple closed curve on some surface; an arrangement of pseudocircles is a collection of pseudocircles that pairwise intersect in exactly two points, at which th…

math.CO2016

A q-analog of Schläfli and Gould identities on Stirling numbers

Matthieu Josuat-Vergès

Stirling numbers of both kinds are linked to each other via two combinatorial identities due to Schläfli and Gould. Using q-analogs of Stirling numbers defined as inversion generat…

math.CO2016★ 3 cited

Subalgebras of Solomon's descent algebra based on alternating runs

Matthieu Josuat-Vergès, C. Y. Amy Pang

The number of alternating runs is a natural permutation statistic. We show it can be used to define some commutative subalgebras of the symmetric group algebra, and more precisely…

math.CO2016★ 2 cited

Asymptotic normality and combinatorial aspects of the prefix exchange distance distribution

Simona Grusea, Anthony Labarre

The prefix exchange distance of a permutation is the minimum number of exchanges involving the leftmost element that sorts the permutation. We give new combinatorial proofs of know…

math.CO2016★ 7 cited

Free cumulants, Schröder trees, and operads

Matthieu Josuat-Vergès, Frédéric Menous, Jean-Christophe Novelli +1

The functional equation defining the free cumulants in free probability is lifted successively to the noncommutative Faà di Bruno algebra, and then to the group of a free operad ov…

math.CO2016★ 11 cited

Pluriassociative algebras II: The polydendriform operad and related operads

Samuele Giraudo

Dendriform algebras form a category of algebras recently introduced by Loday. A dendriform algebra is a vector space endowed with two nonassociative binary operations satisfying so…

math.CO2016★ 11 cited

Pluriassociative algebras I: The pluriassociative operad

Samuele Giraudo

Diassociative algebras form a categoy of algebras recently introduced by Loday. A diassociative algebra is a vector space endowed with two associative binary operations satisfying…

math.CO2016★ 3 cited

Stammering tableaux

Matthieu Josuat-Vergès

The PASEP (Partially Asymmetric Simple Exclusion Process) is a probabilistic model of moving particles, which is of great interest in combinatorics, since it appeared that its part…

math.CO2015★ 3 cited

Effective Invariant Theory of Permutation Groups using Representation Theory

Nicolas Borie

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the a…

math.CO2015

On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters

P. Gambette, K. T. Huber, S. Kelk

Phylogenetic networks have gained prominence over the years due to their ability to represent complex non-treelike evolutionary events such as recombination or hybridization. Popul…

math.CO2015★ 7 cited

Laplacian matrices and spanning trees of tree graphs

Philippe Biane, Guillaume Chapuy

If is a strongly connected finite directed graph, the set of rooted directed spanning trees of is naturally equipped with a structure of directed graph: ther…

math.CO2015★ 11 cited

Operads from posets and Koszul duality

Samuele Giraudo

We introduce a functor from the category of posets to the category of nonsymmetric binary and quadratic operads, establishing a new connection between these two categori…

math.CO2014★ 52 cited

Cambrian Hopf Algebras

Grégory Chatel, Vincent Pilaud

Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective…

math.CO2014

Generalized Dyck tilings

Matthieu Josuat-Vergès, Jang Soo Kim

Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas f…

math.CO2014★ 1 cited

Refined enumeration of noncrossing chains and hook formulas

Matthieu Josuat-Vergès

In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result…

math.CO2014★ 5 cited

Combinatorial Hopf algebras from PROs

Jean-Paul Bultel, Samuele Giraudo

We introduce a general construction that takes as input a so-called stiff PRO and that outputs a Hopf algebra. Stiff PROs are particular PROs that can be described by generators an…

math.CO2014★ 9 cited

Return words of linear involutions and fundamental groups

Valérie Berthé, Vincent Delecroix, Francesco Dolce +3

We investigate the natural codings of linear involutions. We deduce from the geometric representation of linear involutions as Poincaré maps of measured foliations a suitable defin…

math.CO2013★ 1 cited

Quasi-symmetric functions as polynomial functions on Young diagrams

Jean-Christophe Aval, Valentin Féray, Jean-Christophe Novelli +1

We determine the most general form of a smooth function on Young diagrams, that is, a polynomial in the interlacing or multirectangular coordinates whose value depends only on the…

math.CO2013

Combinatorics of simple marked mesh patterns in 132-avoiding permutations

Nicolas Borie

We present some combinatorial interpretations for coefficients appearing in series partitioning the permutations avoiding 132 along marked mesh patterns. We identify for patterns i…