Related papers: Congruence Closure Modulo Permutation Equations
The notion of singular reduction modules, i.e., of singular modules of nonclassical (conditional) symmetry, of differential equations is introduced. It is shown that the derivation of nonclassical symmetries for differential equations can…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
In this paper, we introduce a new method for applying the implicit function theorem to find nontrivial solutions to overdetermined problems with a fixed boundary (given) and a free boundary (to be determined). The novelty of this method…
This paper addresses problems on the structural design of control systems taking explicitly into consideration the possible application to large-scale systems. We provide an efficient and unified framework to solve the following major…
In this paper we prove that the classical Lie bracket of vector fields can be generalized to the noncommutative setting by antisymmetrizing (in a suitable noncommutative sense) their compositions. This construction turns out to depend on…
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 rooted in proof theory…
In the present paper the unconditional convergence and the invertibility of multipliers is investigated. Multipliers are operators created by (frame-like) analysis, multiplication by a fixed symbol, and resynthesis. Sufficient and/or…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
We prove that Ramanujan-type congruences for integral weight modular forms away from the level and the congruence prime are equivalent to specific congruences for Hecke eigenvalues. In particular, we show that Ramanujan-type congruences are…
The following article is an application of commutative algebra to the study of multiparameter persistent homology in topological data analysis. In particular, the theory of finite free resolutions of modules over polynomial rings is applied…
We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive modal transition systems where we allow actions to bear…
In this letter, we describe and develop edge-based and node-based formulations for combined-cycle units (CCUs) with different levels of accuracy in respecting physical restrictions of each turbine, from no restriction requirement of each…
Let $m\ge 3$ be an integer. It is proved that the $m$-closure of a given solvable permutation group of degree $n$ can be constructed in time $n^{O(m)}$.
The main goal of this paper is to introduce a framework for infinitesimal deformation problems, using new methods coming from operadic calculus. We construct an adjunction between infinitesimal deformation problems over some type of…
A primitive problem of predicting the effective properties of composites is open boundary conditions. In this paper, Eshelby's transformation field method is developed to solve the open boundary problem of two-phase composites having…
In this paper, as an analogue of the integer case, we define congruence preserving functions over the residue class rings of polynomials over finite fields. We establish a counting formula for such congruence preserving functions, determine…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…