相关论文: Non-Crossing Tableaux

We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…

We study algebras and varieties where every non-trivial congruence has some class being a non-trivial subuniverse of the algebra in question. Then we focus on algebras where this non-trivial class is a unique non-singleton class of the…

Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial properties, with connections to Stirling numbers, Dyck…

Cross-match spatially clusters and organizes several astronomical point-source measurements from one or more surveys. Ideally, each object would be found in each survey. Unfortunately, the observation conditions and the objects themselves…

Ordinal data are often seen in real applications. Regular multicategory classification methods are not designed for this data type and a more proper treatment is needed. We consider a framework of ordinal classification which pools the…

It is long known that A-series minimal models and D-series minimal models are exchanged by gauging the invertible $\mathbb{Z}_2$ symmetry. More recently, it has been shown that A-series minimal models and E-series minimal models are…

Use of certain non-commuting variables is considered in first-order differential equations. Superspace variables are discussed within the setting of first-order ordinary differential equations and n-ary algebras. Results on quadratic…

The measurement of distance between two objects is generalized to the case where the objects are no longer points but are one-dimensional. Additional concepts such as non-extensibility, curvature constraints, and non-crossing become central…

In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is…

We investigate sets of the common zeros of non-constant semi-invariants for regular modules over canonical algebras. In particular, we show that if the considered algebra is tame then for big enough vectors these sets are complete…

We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…

We present the M\"{o}bius functions of several posets of annular noncrossing objects, namely a self-dual extension of the annular noncrossing permutations, minimal length annular partitioned permutations, and annular noncrossing partitons.

We study positive $m$-divisible non-crossing partitions and their positive Kreweras maps. In classical types, we describe their combinatorial realisations as certain non-crossing set partitions. We also realise these positive Kreweras maps…

In this paper we investigate the problem of sorting a set of $n$ coins, each with distinct but unknown weights, using an unusual scale. The classical version of this problem, which has been well-studied, gives the user a binary scale,…

We discuss a general method of revealing both space-space and space-time noncommuting structures in various models in particle mechanics exhibiting reparametrisation symmetry. Starting from the commuting algebra in the conventional gauge,…

A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…

We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…

We study the distribution and the popularity of left children on sets of treeshelves avoiding a pattern of size three. (Treeshelves are ordered binary increasing trees where every child is connected to its parent by a left or a right link.)…

We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain…

A nested coordinate system is a reassigning of independent variables to take advantage of geometric or symmetry properties of a particular application. Polar, cylindrical and spherical coordinate systems are primary examples of such a…