相关论文: Complementary Algorithms For Tableaux

The associative operad is a central structure in operad theory, defined on the linear span of the set of permutations. We build two analogs of the associative operad on the linear span of the set of packed words which turn out to be…

The main goal of this paper is to settle a conceptual framework for cooperative game theory in which the notion of composition/aggregation of games is the defining structure. This is done via the mathematical theory of algebraic operads: we…

In the spirit of the Head-Gordon-Pople algorithm, we report vertical, transfer and horizontal recurrence relations for the efficient and accurate computation of four-electron integrals over Gaussian basis functions. Our recursive approach…

An alternative foundation for 2-categories is explored by studying graph-theoretically a partial operation on 2-cells named juncture, which can replace vertical and horizontal composition. Juncture is a generalized vertical composition of…

We develop the compositional theory of active inference by introducing activity, functorially relating statistical games to the dynamical systems which play them, using the new notion of approximate inference doctrine. In order to exhibit…

We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…

In this paper, we provide a comprehensive rigorous modeling for multidimensional spaces with hierarchically structured dimensions in several layers of abstractions and data cubes that live in such spaces. We model cube queries and their…

We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…

We evaluate the contribution of a class of higher-twist operators to the lowest moment of the Structure Functions, by computing appropriate matrix elements of six four-fermion operators in the quenched approximation. Their perturbative…

The aim of this paper is to develop an approach to obtain self-adjoint extensions of symmetric operators acting on anti-dual pairs. The main advantage of such a result is that it can be applied for structures not carrying a Hilbert space…

Algebraic structures with multiple copies of a given type of operations interrelated by various compatibility conditions have long being studied in mathematics and mathematical physics. They are broadly referred as linearly compatible,…

We investigate constructions of higher arity self-distributive operations, and give relations between cohomology groups corresponding to operations of different arities. For this purpose we introduce the notion of mutually distributive…

Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two…

When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor variation on an existing method? In this paper, we present a framework for reasoning about equivalence between a broad class of…

Joint diagonalization, the process of finding a shared set of approximate eigenvectors for a collection of matrices, arises in diverse applications such as multidimensional harmonic analysis or quantum information theory. This task is…

We give a backward jeu de taquin slide analogue on semistandard reverse composition tableaux. These tableaux were first studied by Haglund, Luoto, Mason and van Willigenburg when defining quasisymmetric Schur functions. Our algorithm for…

Translation, rotation, and scaling are three commonly used geometric manipulation operations in image processing. Besides, some of them are successfully used in developing effective knowledge graph embedding (KGE) models such as TransE and…

In this paper we define an algorithm for rectifying one cell in a composition tableau. We then describe a generalization of this rectification process. The generalization is from one cell in the first column to any number of cells in the…

Observables of a quantum system, described by self-adjoint operators in a von Neumann algebra or affiliated with it in the unbounded case, form a conditionally complete lattice when equipped with the spectral order. Using this…

We recall results concerning one-dimensional classical and quantum systems with ladder operators. We obtain the most general one-dimensional classical systems respectively with a third and a fourth order ladder operators satisfying…