Related papers: Noncrossing arc diagrams and canonical join repres…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
Moments of secular and inverse secular coefficients, averaged over random matrices from classical groups, are related to the enumeration of non-negative matrices with prescribed row and column sums. Similar random matrix averages are…
We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…
We introduce and study the combinatorial optimization problem with interaction costs (COPIC). COPIC is the problem of finding two combinatorial structures, one from each of two given families, such that the sum of their independent linear…
Real or complex tensor model observables, the backbone of the tensor theory space, are classical (unitary, orthogonal, symplectic) Lie group invariants. These observables represent as colored graphs, and that representation gives an handle…
We consider descent data in cosimplicial crossed groupoids. This is a combinatorial abstraction of the descent data for gerbes in algebraic geometry. The main result is this: a weak equivalence between cosimplicial crossed groupoids induces…
We introduce some basic concepts for Jacobi-Jordan algebras such as: representations, crossed products or Frobenius/metabelian/co-flag objects. A new family of solutions for the quantum Yang-Baxter equation is constructed arising from any…
A tangled-diagram over $[n]=\{1,...,n\}$ is a graph of degree less than two whose vertices $1,...,n$ are arranged in a horizontal line and whose arcs are drawn in the upper halfplane with a particular notion of crossings and nestings.…
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of `knot invariants', among…
We enumerate rational curves in toric surfaces passing through points and satisfying cross-ratio constraints using tropical and combinatorial methods. Our starting point is arXiv:1509.07453, where a tropical-algebraic correspondence theorem…
In this paper, we introduce a new approach for drawing diagrams that have applications in software visualization. Our approach is to use a technique we call confluent drawing for visualizing non-planar diagrams in a planar way. This…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
We initiate a study of the zero-nonzero patterns of n by n alternating sign matrices. We characterize the row (column) sum vectors of these patterns and determine their minimum term rank. In the case of connected alternating sign matrices,…
Computing the crossing number of a graph is one of the most classical problems in computational geometry. Both it and numerous variations of the problem have been studied, and overcoming their frequent computational difficulty is an active…
Noncommutative quantum mechanics on the plane has been widely studied in the literature. Here, we consider the problem using Isham's canonical group quantization scheme for which the primary object is the symmetry group that underlies the…
By using computer assistance, we prove that the fundamental group of the complement of a real complexified line arrangement is not determined by its intersection lattice, providing a counter-example for a problem of Falk and Randell. We…
In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many…
This paper develops an invariant--geometric interpretation of the canonization problem for simple undirected weighted graphs based on the {discrete moving frame method} for finite groups. We consider the action of the {pair group}…
In this survey, we discuss a series of linearization problems--for Poisson structures, Lie algebroids, and Lie groupoids. The last problem involves a conjecture on the structure of proper groupoids. Attempting to prove this by the method of…