Related papers: Enumerative properties of Grid-Associahedra

In this article, we introduce a new family of groups, called Chambord groups and constructed from braided strand diagrams associated to specific semigroup presentations. It includes the asymptotically rigid mapping class groups previously…

We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…

The semi-classical data attached to stacks of algebroids in the sense of Kashiwara and Kontsevich are Maurer-Cartan elements on complex manifolds, which we call extended Poisson structures as they generalize holomorphic Poisson structures.…

We introduce the concept of braided noncommutative Poisson bialgebras. The theory of cocycle bicrossproducts for noncommutative Poisson bialgebras is developed. As an application, we solve the extending problem by using some non-abelian…

I present an overview of the research I have conducted for the past ten years in algebraic, bijective, enumerative, and geometric combinatorics. The two main objects I have studied are the permutahedron and the associahedron as well as the…

In this paper, we study grid-obstacle representations of graphs where we assign grid-points to vertices and define obstacles such that an edge exists if and only if an $xy$-monotone grid path connects the two endpoints without hitting an…

We develop the theory of quasi-$F$-splittings in the context of birational geometry. Amongst other things, we obtain results on liftability of sections and establish a criterion for whether a scheme is quasi-$F$-split employing the higher…

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver…

We define F-topological recursion (F-TR) as a non-symmetric version of topological recursion, which associates a vector potential to some initial data. We describe the symmetries of the initial data for F-TR and show that, at the level of…

Frieze patterns of integers were studied by Conway and Coxeter. Let $\mathscr{C}$ be the cluster category of Dynkin type $A_n$. Indecomposables in $\mathscr{C}$ correspond to diagonals in an $(n+3)$-gon. Work done by Caldero and Chapoton…

We propose a generalization of the concept of a Ribbon graph suitable to provide combinatorial models for marked surfaces equipped with a G-structure. Our main insight is that the necessary combinatorics is neatly captured in the concept of…

We construct new non-associative key establishment protocols for all left self-distributive (LD), multi-LD-, and mutual LD-systems. The hardness of these protocols relies on variations of the (simultaneous) iterated LD-problem and its…

This survey studies pairs $(G,\mathcal{P})$ with $G$ a finitely generated group and $\mathcal{P}$ a (finite) collection of subgroups of $G$. We explore the notion of quasi-isometry of such pairs and the notion of a qi-characteristic…

Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…

In 1998, Goresky, Kottwitz, and MacPherson showed that for certain spaces X equipped with a torus action, the T-equivariant cohomology ring of X can be described by combinatorial data obtained from its orbit decomposition. Thus, their…

To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…

The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced…

Following the approach to grid homology of links in $S^3$, we prove combinatorially that the grid homology of links in lens spaces defined by Baker, Grigsby, and Hedden is a link invariant. Further, using the sign assignment defined by…

We study the perfect matching lattice of a matching covered graph $G$, generated by the incidence vectors of its perfect matchings. Building on results of Lov\'asz and de Carvalho, Lucchesi, and Murty, we give a polynomial-time algorithm…