Related papers: Noncrossing arc diagrams and canonical join repres…
A discriminantal hyperplane arrangement B(n,k,A) is constructed from a given (generic) hyperplane arrangement A, which is classified as either very generic or non-very generic depending on the combinatorial structure of B(n,k,A). In…
Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
Noncommutative harmonic analysis is used to solve a nonparametric estimation problem stated in terms of compound Poisson processes on compact Lie groups. This problem of decompounding is a generalization of a similar classical problem. The…
We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…
Canon permutations are permutations of the multiset having $k$ copies of each integer between $1$ and $n$, with the property that the subsequences obtained by taking the $j$th copy of each entry, for each fixed $j$, are all the same. For…
Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…
We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks,…
Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…
In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…
We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…
Inspired by earlier works on representations of the Temperley-Lieb algebra we introduce a novel family of representations of the algebra. This may be seen as a generalization of the so called asymmetric twin representation. The underlying…
The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set…
Mapping an atomistic configuration to an $N$-point correlation of a field associated with the atomic positions (e.g. an atomic density) has emerged as an elegant and effective solution to represent structures as the input of…
A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…
We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of the network where messages combine and coding occurs. We give…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…
Following the footprints of what have been done with the algorithm Stacksort, we investigate the preimages of the map associated with a slightly less well known algorithm, called Queuesort. After having described an equivalent version of…
En esta serie de tres articulos, damos una exposicion de varios resultados y problemas abiertos en tres areas de la combinatoria algebraica y geometrica: las matrices totalmente no negativas, las representaciones del grupo simetrico, y los…