Related papers: Counting orbits under Kreweras complementation
We define a natural compactification of an arrangement complement in a ball quotient. We show that when this complement has a moduli space interpretation, then this compactification is often one that appears naturally by means of geometric…
An earlier characterization of topologically ordered (lexicographic) path-length sequences of binary trees is reformulated in terms of an integrality condition on a scaled Kraft sum of certain subsequences (full segments, or islands). The…
Non-relativistic particles that are effectively confined to two dimensions can in general move on curved surfaces, allowing dynamical phenomena beyond what can be described with scalar potentials or even vector gauge fields. Here we…
We study Morse theory on noncompact manifolds equipped with exhaustions by compact pieces, defining the Morse homology of a pair which consists of the manifold and related geometric/homotopy data. We construct a collection of Morse data…
We study the topdrop map, a mapping on permutations in $S_n$ related to card shuffling. We show this map is bijective and study its orbit structure. We introduce the notion of the topdrop-necklace as a way of classifying the orbits of the…
In this note, we examine how the BKP structure of the generating series of several models of maps on non-oriented surfaces can be used to obtain explicit and/or efficient recurrence formulas for their enumeration according to the genus and…
We define the counting of holomorphic cylinders in log Calabi-Yau surfaces. Although we start with a complex log Calabi-Yau surface, the counting is achieved by applying methods from non-archimedean geometry. This gives rise to new…
We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…
In this paper we discuss reflection groups and root systems, in particular non-crystallographic ones, and a Clifford algebra framework for both these concepts. A review of historical as well as more recent work on viral capsid symmetries…
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees.…
Vertex cover is one of the classical NP-complete problems in theoretical computer science. A vertex cover of a graph is a subset of vertices such that for each edge at least one of the two endpoints is contained in the subset. When studied…
It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges…
For the Kronecker algebra, Zwara found in [14] an example of a module whose orbit closure is neither unibranch nor Cohen-Macaulay. In this paper, we explain how to extend this example to all representation-infinite algebras with a…
Let $K_4$ be the complete graph on four vertices. Let $f$ be a continuous map of $K_4$ to the plane such that $f$-images of non-adjacent edges are disjoint. For any vertex $v \in K_4$ take the winding number of the $f$-image of the cycle…
This article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved. To describe…
By considering mirror symmetry applied to conformal field theories corresponding to strings propagating in quintic hypersurfaces in projective 4-space, Candelas, de la Ossa, Green and Parkes calculated the ``number of rational curves on the…
We realize the enveloping algebra of the positive part of a semisimple complex Lie algebra as a convolution algebra of constructible functions on module varieties of some Iwanaga-Gorenstein algebras of dimension 1.
The rational covariance extension problem to determine a rational spectral density given a finite number of covariance lags can be seen as a matrix completion problem to construct an infinite-dimensional positive-definite Toeplitz matrix…
An argument is given to associate integrable nonintegrable transition of discrete maps with the transition of Lawvere's fixed point theorem to its own contrapositive. We show that the classical description of nonlinear maps is neither…
In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…