Related papers: On Use of an Explicit Congruence Predicate in Boun…

An algebraic criterion, in terms of closure under power operations, is determined for the existence and uniqueness of generalized trun- cated Brown-Peterson spectra of height 2 as E_\infty-ring spectra. The criterion is checked for an…

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

We establish the decidability of the $\Sigma_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing -…

We define the time-continuous spin coherent-state path integral in a way that is free from inconsistencies. The proposed definition is used to reproduce known exact results. Such a formalism opens new possibilities for applying…

This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is…

A compact set $E\subset {\Bbb R}^d$ is said to be arithmetically thick if there exists a positive integer $n$ so that the $n$-fold arithmetic sum of $E$ has non-empty interior. We prove the arithmetic thickness of $E$, if $E$ is uniformly…

We propose a novel deliberation-based approach to end-to-end (E2E) spoken language understanding (SLU), where a streaming automatic speech recognition (ASR) model produces the first-pass hypothesis and a second-pass natural language…

We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…

A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed by a subset of the authors of this paper. Examples of the systems…

Bennett, Hart, Iosevich, Pakianathan, and Rudnev found an exponent $s<d$ such that any set $E\subset \mathbb{F}_q^d$ with $|E|\gtrsim q^s$ determines $\gtrsim q^{\binom{k+1}{2}}$ congruence classes of $(k+1)$-point configurations for $k\leq…

Given a pointwise finite-dimensional persistence module over a totally ordered set $S$, a theorem of Crawley-Boevey guarantees the existence of a barcode. When the set $S$ is finite, the persistence module is an equioriented type-A quiver…

Let B be a sigma-unital C*-algebra. We show that every strongly continuous E_0-semigroup on the algebra of adjointable operators on a full Hilbert B-module E gives rise to a full continuous product system of correspondences over B. We show…

For every set $S$ of finite measure in $\mathbb{R}$ we construct a discrete set of real frequencies $\Lambda$ such that the exponential system $\{\exp(i\lambda t),\lambda\in\Lambda\}$ is a frame in $L^2(S)$

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Let $S$ be a multiplicatively idempotent congruence-simple semiring. We show that $|S|=2$ if $S$ has a multiplicatively absorbing element. We also prove that if $S$ is finite then either $|S|=2$ or $S\cong End(L)$ or $S^{op}\cong End(L)$…

In this article, we describe an algorithm to determine whether a permutation class C given by a finite basis B of excluded patterns contains a finite number of simple permutations. This is a continuation of the work initiated in [Brignall,…

We derive the exact S-matrix for the scattering of particular representations of the centrally-extended psu(1|1)^2 Lie superalgebra, conjectured to be related to the massive modes of the light-cone gauge string theory on AdS_2 x S^2 x T^6.…

We prove that bounded conciseness is a closed property in the space of marked groups. As a consequence, we reformulate a conjecture of Fern\'andez-Alcober and Shumyatsky [7] about conciseness in the class of residually finite groups.

End-to-end (E2E) spoken language understanding (SLU) systems that generate a semantic parse from speech have become more promising recently. This approach uses a single model that utilizes audio and text representations from pre-trained…

We offer a mathematical proof of consistency for Peano Arithmetic PA formalizable in PA. This result is compatible with Goedel's Second Incompleteness Theorem since our consistency proof does not rely on the representation of consistency as…