Related papers: Weak mu-equality is decidable
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
Let $\chi^{\lambda}_{\mu}$ be the value of the irreducible character $\chi^{\lambda}$ of the Hecke algebra of the symmetric group on the conjugacy class of type $\mu$. The usual Murnaghan-Nakayama rule provides an iterative algorithm based…
Let $B$ be a finite, separable von Neumann algebra. We prove that a $B$-valued distribution $\mu$ that is the weak limit of an infinitesimal array is infinitely divisible. The proof of this theorem utilizes the Steinitz lemma and may be…
Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…
Universal algebra and clone theory have proven to be a useful tool in the study of constraint satisfaction problems since the complexity, up to logspace reductions, is determined by the set of polymorphisms of the constraint language. For…
We prove that any unitary highest weight module over a universal minimal quantum affine $W$-algebra at non-critical level descends to its simple quotient. We find the defining relations of the unitary simple minimal quantum affine…
An early result in the theory of Natural Dualities is that an algebra with a near unanimity (NU) term is dualizable. A converse to this is also true: if V(A) is congruence distributive and A is dualizable, then A has an NU term. An…
Congruence families, i.e., $\ell$-adic convergence for well-defined arithmetic subsequences, is a commonplace phenomenon for the coefficients of modular forms. Such families superficially resemble one another, but they often vary…
A combinatorial principle CECA is formulated and its equivalence with GCH+ certain weakenings of Box_lambda for singular lambda is proved. CECA is used to show that certain ``almost point- < tau'' families can be refined to point- < tau…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
A non-unital generalization of weak bialgebra is proposed with a multiplier-valued comultiplication. Certain canonical subalgebras of the multiplier algebra (named the `base algebras') are shown to carry coseparable co-Frobenius coalgebra…
We introduce the notion of weak reduciblity for Dupin submanifolds with arbitrary codimension. We give a complete characterization of all weakly reducible Dupin submanifolds, as a consequence of a general result on a broader class of…
We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…
Extriangulated categories, introduced by Nakaoka and Palu, serve as a simultaneous generalization of exact and triangulated categories. In this paper, we first introduce the concept of admissible weak factorization systems and establish a…
In studying the structure of derived categories of module categories of group algebras or their blocks, it is fundamental to classify support $\tau$-tilting modules. Koshio and Kozakai showed that the structure of support $\tau$-tilting…
Let $F(x, y)$ be a binary form with integer coefficients, degree $n\geq 3$ and irreducible over the rationals. Suppose that only $s + 1$ of the $n + 1$ coefficients of $F$ are nonzero. We show that the Thue inequality $|F(x,y)|\leq m$ has…