Related papers: Congruence Closure Modulo Permutation Equations
This note investigate some finiteness properties of the category U of unstable modules. One shows finiteness properties for the injective resolution of finitely generated unstable modules. One also shows a stabilization result under…
Equational unification of two terms consists of finding a substitution that, when applied to both terms, makes them equal modulo some equational properties. A narrowing-based equational unification algorithm relying on the concept of the…
Motivated by charge balancing constraints for rank modulation schemes, we introduce the notion of balanced permutations and derive the capacity of balanced permutation codes. We also describe simple interleaving methods for permutation code…
In this paper, we propose novel methods for constructing uninorms using two comparable closure operators or, alternatively, two comparable interior operators on bounded lattices. These methods are developed under the necessary and…
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…
In [Boltje,Hartmann: Permutation resolutions for Specht modules, J. Algebraic Combin. 34 (2011), 141-162], a chain complex was constructed in a combinatorial way which conjecturally is a resolution of the (dual of the) integral Specht…
We investigate the relationship between supersymmetric gauge theories with moduli spaces and matrix models. Particular attention is given to situations where the moduli space gets quantum corrected. These corrections are controlled by…
We study two-dimensional classically integrable field theory with independent boundary condition on each end, and obtain three possible generating functions for integrals of motion when this model is an ultralocal one. Classically…
For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under…
Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such problems arising from the commercial world are permeated by…
Open boundary conditions are always used in investigating the effective properties of composites. In this paper, Eshelby's transformation field method is developed to deal with the effective response of unidirectional periodic composites…
Quantum-mechanical concepts can be formulated in constructive finite terms without loss of their empirical content if we replace a general unitary group by a unitary representation of a finite group. Any linear representation of a finite…
A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…
For a $p$-permutation equivalence between two block algebras of finite groups, we introduce new square diagrams that link the $p$-permutation equivalence via the Brauer construction to local equivalences between stabilizers of corresponding…
We present a clausal resolution-based method for normal multimodal logics of confluence, whose Kripke semantics are based on frames characterised by appropriate instances of the Church-Rosser property. Here we restrict attention to eight…
In this paper we investigate congruence relationships of particular finite generalized harmonic numbers sums. We suggest more transparent and simpler method to analyse these sums and present several additional results for certain special…
In this paper, we formulate the outfit completion problem as a set retrieval task and propose a novel framework for solving this problem. The proposal includes a conditional set transformation architecture with deep neural networks and a…
We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS)…
Boolean matching is an important problem in logic synthesis and verification. Despite being well-studied for conventional Boolean circuits, its treatment for reversible logic circuits remains largely, if not completely, missing. This work…