相关论文: Complementary Algorithms For Tableaux

Local complement is a graph operation formalized by Bouchet which replaces the neighborhood of a chosen vertex with its edge-complement. This operation induces an equivalence relation on graphs; determining the size of the resulting…

The present paper deals with complemented lattices where, however, a unary operation of complementation is not explicitly assumed. This means that an element can have several complements. The mapping $^+$ assigning to each element $a$ the…

In this work, we introduce new combinatorial objects called Dyck tableaux, which present a natural insertion algorithm. These tools may be useful to describe statistics which are relevant in the study of the physical model named PASEP.

A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…

One of the authors has recently introduced the concept of conjugate Hamiltonian systems: the solution of the equation $h=H(p,q,t),$ where $H$ is a given Hamiltonian containing $t$ explicitly, yields the function $t=T(p,q,h)$, which defines…

We present an algebraic study of a kind of quantum systems belonging to a family of superintegrable Hamiltonian systems in terms of shape-invariant intertwinig operators, that span pairs of Lie algebras like $(su(n),so(2n))$ or…

Closure operations such as tight and integral closure and test ideals have appeared frequently in the study of commutative algebra. This articles serves as a survey of the authors' prior results connecting closure operations, test ideals,…

The concept of diagrammatic combinatorial Hopf algebras in the form introduced for describing the Heisenberg-Weyl algebra in~\cite{blasiak2010combinatorial} is extended to the case of so-called rule diagrams that present graph rewriting…

Network representations often cannot fully account for the structural richness of complex systems spanning multiple levels of organisation. Recently proposed high-order information-theoretic signals are well-suited to capture synergistic…

We develop further quaternionic analysis introducing left and right doubly regular functions. We derive Cauchy-Fueter type formulas for these doubly regular functions that can be regarded as another counterpart of Cauchy's integral formula…

Mating is an operation to construct a rational map f from two polynomials, which are not in conjugate limbs of the Mandelbrot set. When the Thurston Algorithm for the unmodified formal mating is iterated in the case of postcritical…

This tutorial paper presents a survey of results, both classical and new, linking inner functions and operator theory. Topics discussed include invariant subspaces, universal operators, Hankel and Toeplitz operators, model spaces, truncated…

Estimating missing judgements is a key component in many multi-criteria decision making techniques, especially in the Analytic Hierarchy Process. Inspired by the Koczkodaj inconsistency index and a widely used solution concept of…

This dissertation focuses on developing a new construction of a functional calculus using Henstock-Kurzweil integration methods. The assignment of a functional calculus will be applied to self-adjoint operators. We will address both the…

This paper discusses relational operations in the first-order logical environment {FOLE}. Here we demonstrate how FOLE expresses the relational operations of database theory in a clear and implementable representation. An analysis of the…

Many different programs are the implementation of the same algorithm. The collection of programs can be partitioned into different classes corresponding to the algorithms they implement. This makes the collection of algorithms a quotient of…

Suzuki-Trotter decompositions of exponential operators like $\exp(Ht)$ are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators $H=\sum_k A_k$, for…

We introduce inversions tableaux, a new combinatorial model for Schubert polynomials and Stanley symmetric functions that directly specializes to semi-standard Young tableaux in the Grassmannian case. They are a modification of the balanced…

We define and study the Plancherel-Hecke probability measure on Young diagrams; the Hecke algorithm of [Buch-Kresch-Shimozono-Tamvakis-Yong '06] is interpreted as a polynomial-time exact sampling algorithm for this measure. Using the…

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…