相关论文: Non-Crossing Tableaux
The definition of principal nest is supplemented with a system of frames that make possible the classification of combinatorial types for every level of the nest. As a consequence, we give necessary and sufficient conditions for the…
We briefly sketch the noncommutative geometry approach to the Standard Model, with attention to what can be inferred about particle masses.
Tverberg's theorem is one of the cornerstones of discrete geometry. It states that, given a set $X$ of at least $(d+1)(r-1)+1$ points in $\mathbb R^d$, one can find a partition $X=X_1\cup \ldots \cup X_r$ of $X$, such that the convex hulls…
Derangements are a popular topic in combinatorics classes. We study a generalization to face derangements of the n-dimensional hypercube. These derangements can be classified as odd or even, depending on whether the underlying isometry is…
A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.
We examine the enumeration of certain Motzkin objects according to the numbers of crossings and nestings. With respect to continued fractions, we compute and express the distributions of the statistics of the numbers of crossings and…
The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole…
A net in $\mathbb{P}^2$ is a configuration of lines $\mathcal A$ and points $X$ satisfying certain incidence properties. Nets appear in a variety of settings, ranging from quasigroups to combinatorial design to classification of Kac-Moody…
Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise…
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…
Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…
There exists two types of nonassociative algebras whose associator satisfies a symmetric relation associated with a 1-dimensional invariant vector space with respect to the natural action of the symmetric group on three elements. The first…
Given a set of $n$ red and $n$ blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We develop a range of tools for dealing with the non-crossing…
Bisectors are equidistant hypersurfaces between two points and are basic objects in a metric geometry. They play an important part in understanding the action of subgroups of isometries on a metric space. In many metric geometries…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
Let W be a finite crystallographic reflection group. The generalized Catalan number of W coincides both with the number of clusters in the cluster algebra associated to W, and with the number of noncrossing partitions for W. Natural…
We define and consider k-distant crossings and nestings for matchings and set partitions, which are a variation of crossings and nestings in which the distance between vertices is important. By modifying an involution of Kasraoui and Zeng…
A class of two-dimensional systems of second-order ordinary differential equations is identified in which a system requires fewer Lie point symmetries than required to solve it. The procedure distinguishes among those which are…
Complete non-ambiguous trees (CNATs) are combinatorial objects which appear in various contexts.Recently, Chen and Ohlig studied the notion of permutations associated to these objects, and proposed a series of nice conjectures.Most of them…
We consider two questions of Wilf related to Standard Young Tableaux. We provide a partial answer to one question, and that will lead us to a more general answer to the other question. Our answers are purely combinatorial.