Related papers: Congruence Closure Modulo Groups
A handy technique for the Finite Element Method (FEM) is presented that uses the null space for the implementation of Dirichlet and constraint boundary conditions. The focus of this method is to present an illustrative approach to modeling…
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…
This dissertation is about rearrangement groups: a class of groups of homeomorphisms of fractal topological spaces. Introduced in 2019 by J. Belk and B. Forrest, this class generalizes the famous trio of Thompson groups $F$, $T$ and $V$ and…
Let $H$ be an acylindrically hyperbolic group without nontrivial finite normal subgroups. We show that any finite system $S$ of equations with constants from $H$ is equivalent to a single equation. We also show that the algebraic set…
We present two techniques novel in numerical methods. The first technique compiles the domain of the numerical methods as a discretized volume. Congruent elements are glued together to compile the domain over which the solution of a…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
We describe a framework for encoding cluster combinatorics using categorical methods. We give a definition of an abstract cluster structure, which captures the essence of cluster mutation at a tropical level and show that cluster algebras,…
We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be…
The finite element simulation of dynamic wetting phenomena, requiring the computation of flow in a domain confined by intersecting a liquid-fluid free surface and a liquid-solid interface, with the three-phase contact line moving across the…
We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
In this article we develop convergence theory for a class of goal-oriented adaptive finite element algorithms for second order nonsymmetric linear elliptic equations. In particular, we establish contraction results for a method of this type…
Let $k =\mathbb{F}_q$ be the finite field of $q$ elements and $E$ an elliptic curve over $k$. Let $F = k(E)$ be the function field over $E$ and let $\mathcal{O} = k[E]$ be the ring of integers. We fix the place at $\infty$ of $F$ and let…
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…
We present a generic construction of finite realisations of amalgamation patterns. An amalgamation pattern is specified by a finite collection of finite template structures together with a collection of partial isomorphisms between them. A…
The central aim of this monograph is to provide decomposition results for quasi-coherent sheaves on the moduli stack of one-dimensional formal groups. These results will be based on the geometry of the stack itself, particularly the height…
We present necessary and sufficient conditions for the termination of linear homogeneous programs. We also develop a complete method to check termination for this class of programs. Our complete characterization of termination for such…
Efforts to ensure the safe development of artificial general intelligence (AGI) often rely on consensus-based alignment approaches grounded in axiomatic formalism, interpretability, and empirical validation. However, these methods may be…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…