Related papers: Counting orbits under Kreweras complementation

I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…

A configuration of points and lines is cyclic if it has an automorphism which permutes its points in a full cycle. A closed formula is derived for the number of non-isomorphic connected cyclic configurations of type (v_3), i.e., which have…

We propose a conjectural correspondence between the set of rigid indecomposable modules over the path algebras of acyclic quivers and the set of certain non-self-intersecting curves on Riemann surfaces, and prove the correspondence for the…

Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the computation time can be shorter than the total output size, by…

In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…

In this paper, we study combinatorial properties of quasi-Cartan companions defined by the c-vectors of acyclic skew-symmetrizable cluster algebras. In particular, we show that the diagram of any skew-symmetrizable matrix associated with an…

Decision trees and systems of decision rules are widely used as classifiers, as a means for knowledge representation, and as algorithms. They are among the most interpretable models for data analysis. The study of the relationships between…

Let $G$ be the group $SL(2,\mathbb{R})$, $P\subset G$ be the parabolic subgroup of upper triangular matrices and $\Gamma\subset G$ be a cocompact lattice. A right action of $P$ on $\Gamma\backslash G$ defines an orbit foliation…

Kreweras words are words consisting of n A's, n B's, and n C's in which every prefix has at least as many A's as B's and at least as many A's as C's. Equivalently, a Kreweras word is a linear extension of the poset ${\sf V}\times [n]$.…

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…

To every automorphism w of an infinite rooted regular binary tree we associate a two variable generating function \Phi_w that encodes information on the orbit structure of w. We prove that this is a rational function if w can be described…

We give combinatorial models for the homotopy type of complements of elliptic arrangements (i.e., certain sets of abelian subvarieties in a product of elliptic curves). We give a presentation of the fundamental group of such spaces and, as…

We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…

Functions which are covariant or invariant under the transformations of a compact linear group $G$ acting in a euclidean space $\real^n$, can be profitably studied as functions defined in the orbit space of the group. The orbit space is the…

Let $\FN$ be a free group of finite rank $N \geq 2$, and let $T$ be an $\R$-tree with a very small, minimal action of $\FN$ with dense orbits. For any basis $\CA$ of $\FN$ there exists a {\em heart} $K_{\CA} \subset \bar T$ (= the metric…

We compute the $K$-theory of crossed products of rotation algebras $\mathcal{A}_\theta$, for any real angle $\theta$, by matrices in $\mathrm{SL}(2,\mathbb{Z})$ with infinite order. Using techniques of continuous fields, we show that the…

We study periodic wind-tree models, billiards in the plane endowed with $\mathbb{Z}^2$-periodically located identical connected symmetric right-angled obstacles. We show asymptotic formulas for the number of (isotopy classes of) closed…

We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…

We prove an instance of the cyclic sieving phenomenon, occurring in the context of noncrossing parititions for well-generated complex reflection groups.

Several algorithms are presented for the accurate computation of the leaves in the foliation of an ODE near a hyperbolic fixed point. They are variations of a contraction mapping method in [25] to compute inertial manifolds, which…