The plactic monoid is the quotient of the free monoid by the congruence generated by Knuth’s well-celebrated rules. It is well-known that the set of Young tableaux is a cross-section of this congruence which happens to be regular. The main result of this work shows that the set of alphabetically minimal elements in the congruence classes is also regular. We give a full combinatorial characteriz...

A complete system of primitive pairwise orthogonal idempotents for cyclotomic Hecke algebras is constructed by consecutive evaluations of a rational function in several variables on quantum contents of multi-tableaux. This function is a product of two terms, one of which depends only on the shape of the multi-tableau and is proportional to the inverse of the corresponding Schur element.

Plan-based Axiom Absorption for Tableau-based Description Logics Reasoning

Auditing tools can play a key role in the continuous improvement of maintenance policies, in particular to enhance predictive maintenance (PM). This paper proposes a multi-criteria model for auditing a Predictive Maintenance Programme (PMP) developed and implemented in the General Hospital of Ciudad Real (GHCR) in Spain. The model has a two-level structure, with top level auditing areas specifi...

We will show that every nonsingular complex variety is a manifold in the analytic topology, but we wish to show more – that it has the natural structure of a complex manifold. In order to do this, we will need to introduce additional structure on the analytic topology. To allow for singular points, we give a definition more general than that of complex manifolds, mimicking our definitions from ...

In the context of Description Logics (DLs) concrete domains allow to model concepts and facts by the use of concrete values and predicates between them. For reasoning in the DL ALC with general TBoxes concrete domains may cause undecidability. Under certain restrictions of the concrete domains decidability can be regained. Typically, the concrete domain predicates are crisp, which is a limitati...

Factorization of linear programming (LP) models enables a large portion of the LP tableau to be represented implicitly and generatedfrom the remainingexplicit part. Dynamicfactorization admits algebraicelementswhichchangeindimensionduring the courseof solution.A unifyingmathematical framework for dynamic row factorization is presented with three algorithms which derive from differentLP modelrow...

This paper proposes a new class of random sequences called binary primes tableau (PT) sequences that have potential applications in cryptography and communications. The PT sequence of rank p is obtained from numbers arranged in a tableau with p columns where primes are marked off until each column has at least one prime and where the column entries are added modulo 2. We also examine the dual t...

We give an overview over three serious attempts to devise an effective decision method for CTL∗, namely Emerson and Jutla’s automata-theoretic decision procedure, Reynolds’ tableau search method and our recent approach based on an infinite tableau system with natural rules and with global conditions on the branches.

We reene the semantic process which reduces predicate logic to propositional tautologies. We then devise a tableau based proof system mirroring the semantic process by purely syntactic (i.e. programmable) means. We obtain a beautifully symmetric set of theorems given in the gure 1. As a byproduct of the reenement we have a simple tableau method of deciding quasi-tautologies and a proof system w...