Related papers: On Use of an Explicit Congruence Predicate in Boun…
In this paper we study the boundedness of Bergman projectors on weighted Bergman spaces on homogeneous Siegel domains of Type II. As it appeared to be a natural approach in the special case of tube domains over irreducible symmetric cones,…
Numerical analysis has no satisfactory method for the more realistic optimization models. However, with constraint programming one can compute a cover for the solution set to arbitrarily close approximation. Because the use of constraint…
We provide an explicit combinatorial realization of all simple and injective (hence, and projective) modules in the category of bounded $\mathfrak{sp}(2n)$-modules. This realization is defined via a natural tableaux correspondence between…
The emptiness and containment problems for probabilistic automata are natural quantitative generalisations of the classical language emptiness and inclusion problems for Boolean automata. It is well known that both problems are undecidable.…
We investigate the `local consistency implies global consistency' principle of strict width among structures within the scope of the Bodirsky-Pinsker dichotomy conjecture for infinite-domain Constraint Satisfaction Problems (CSPs). Our main…
We establish the boundedness character of solutions of a system of rational difference equations with a variable coefficient
For a given stratified bundle $E$ on $X$, we construct an irreducible closed subvariety $\sN(E)_S$ of the so called representation space $R(\sO_{X_S},\xi_S,P)\to S$ such that $\sN(E)_S(\overline{\mathbb{F}}_q)$ contains a dense set of…
Topological entanglement entropy (TEE), the sub-leading term in the entanglement entropy of topological order, is the direct evidence of the long-range entanglement. While effective in characterizing topological orders on closed manifolds,…
Classical mathematical models used in the semantics of programming languages and computation rely on idealized abstractions such as infinite-precision real numbers, unbounded sets, and unrestricted computation. In contrast, concrete…
Working in the context of reverse mathematics, we give a fine-grained characterization result on the strength of two possible definitions for Effective Transfinite Recursion used in literature. Moreover, we show that $\Pi^0_2$-induction…
The Hilbert program was actually a specific approach for proving consistency. Quantifiers were supposed to be replaced by $\epsilon$-terms. $\epsilon{x}A(x)$ was supposed to denote a witness to $\exists{x}A(x)$, arbitrary if there is none.…
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…
We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient…
PDEs with periodic boundary conditions are frequently used to model processes in large spatial environments, assuming solutions to extend periodically beyond some bounded interval. However, solutions to these PDEs often do not converge to a…
We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…
We define a congruence module $\Psi_A(M)$ associated to a surjective $\mathcal O$-algebra morphism $\lambda\colon A \to \mathcal{O}$, with $\mathcal{O}$ a discrete valuation ring, $A$ a complete noetherian local $\mathcal{O}$-algebra…
We show a model construction for a system of higher-order illative combinatory logic $\mathcal{I}_\omega$, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order…
F\"ur die freien orthogonalen Quantengruppen $A_o(n)$ wird ein vollst\"a ndiges Reduktionssystem angegeben und verifiziert. F\"ur den Fall $n = 2$ wird ein endlicher Automat angegeben, der s\"amtliche der Basiselemente findet. Weiterhin…
We describe an algorithm for proving termination of programs abstracted to systems of monotonicity constraints in the integer domain. Monotonicity constraints are a non-trivial extension of the well-known size-change termination method.…
Inference systems are a widespread framework used to define possibly recursive predicates by means of inference rules. They allow both inductive and coinductive interpretations that are fairly well-studied. In this paper, we consider a…