Related papers: Congruence Closure Modulo Permutation Equations
Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…
We are interested in the problem of translating between two representations of closure systems, namely implicational bases and meet-irreducible elements. Albeit its importance, the problem is open. Motivated by this problem, we introduce…
We raise the question of the realizability of permutation modules in the context of Kahn's realizability problem for abstract groups and the $G$-Moore space problem. Specifically, given a finite group $G$, we consider a collection…
We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…
We consider extension of a closure system on a finite set S as a closure system on the same set S containing the given one as a sublattice. A closure system can be represented in different ways, e.g. by an implicational base or by the set…
Let G be a finite group. Given a finite G-set X and a modular tensor category C, we construct a weak G-equivariant fusion category, called the permutation equivariant tensor category. The construction is geometric and uses the formalism of…
In the context of loop quantum gravity and spinfoam models, the simplicity constraints are essential in that they allow to write general relativity as a constrained topological BF theory. In this work, we apply the recently developed U(N)…
We define the parametric closure problem, in which the input is a partially ordered set whose elements have linearly varying weights and the goal is to compute the sequence of minimum-weight lower sets of the partial order as the weights…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
The aim of this paper is to establish the framework of the enclosure method for some class of inverse problems whose governing equations are given by parabolic equations with discontinuous coefficients. The framework is given by considering…
Let A be a noetherian commutative ring, and let I be an ideal in A. We study questions of flatness and I-adic completeness for infinitely generated A-modules. This is done using the notions of decaying function and I-adically free A-module.
We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We replace persistence modules by their presentations and…
It is widely acknowledged that function symbols are an important feature in answer set programming, as they make modeling easier, increase the expressive power, and allow us to deal with infinite domains. The main issue with their…
The object of this work is to present the status of art of an open problem: to provide an analogue for Shimura curves of the Ihara's lemma \cite{Ihara73} which holds for modular curves. We will describe our direct result towards the…
We study modular theory in hyperfinite von Neumann algebras, i.e. in those of type II or type III, from the viewpoint of a subregion charge sector decomposition. We address this symmetry resolution by considering infinite tensor products of…
The multiplicative update (MU) algorithm has been extensively used to estimate the basis and coefficient matrices in nonnegative matrix factorization (NMF) problems under a wide range of divergences and regularizers. However, theoretical…
We prove a commutative algebra result which has consequences for congruences between automorphic forms modulo prime powers. If C denotes the congruence module for a fixed automorphic Hecke eigenform \pi_0 we prove an exact relation between…
The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in…
We propose a calculus for modeling implicit programming that supports first-class, overlapping, locally scoped, and higher-order instances with higher-kinded types. We propose a straightforward generalization of the well-established System…
Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.