Related papers: First- and Second-Order Models of Recursive Arithm…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…
Statistical relational models provide compact encodings of probabilistic dependencies in relational domains, but result in highly intractable graphical models. The goal of lifted inference is to carry out probabilistic inference without…
In the present paper we continue the project of systematic construction of invariant differential operators for non-compact semisimple Lie groups. Our starting points is the class of algebras, which we call 'conformal Lie algebras' (CLA),…
We define the syntax and reduction relation of a recursively typed lambda calculus with a parallel case-function (a parallel conditional). The reduction is shown to be confluent. We interpret the recursive types as information systems in a…
We present a method for determining the one-dimensional submodules of a Laurent-Ore module. The method is based on a correspondence between hyperexponential solutions of associated systems and one-dimensional submodules. The…
We study the primitive recursive analogue of computable categoricity spectra for various natural classes of structures. We show that these notions coincide for all relatively $\Delta_{2}^{0}$-categorical equivalence structures and linear…
We construct the q-discrete Painleve I and II equations and their higher order analogues by virtue of periodic cluster algebras. Using particular (k,k) exchange matrices, we show that the cluster algebras corresponding to k=4 and 5 give the…
In large-scale modern data analysis, first-order optimization methods are usually favored to obtain sparse estimators in high dimensions. This paper performs theoretical analysis of a class of iterative thresholding based estimators defined…
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…
An algebra is introduced which can be considered as a rank 2 extension of the Askey-Wilson algebra. Relations in this algebra are motivated by relations between coproducts of twisted primitive elements in the two-fold tensor product of the…
Revisiting the results by Winternitz [Symmetry in physics, CRM Proc. Lecture Notes 34, American Mathematical Society, Providence, RI, 2004, pp. 215-227], we thoroughly refine his classification of Lie subalgebras of the real order-three…
This is the second installment of an exposition of an ACL2 formalization of elementary linear algebra. It extends the results of Part I, which covers the algebra of matrices over a commutative ring, but focuses on aspects of the theory that…
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
We identify Melrose's suspended algebra of pseudodifferential operators with a subalgebra of the algebra of parametric pseudodifferential operators with parameter space $\R$. For a general algebra of parametric pseudodifferential operators,…
We show that over the weak base theory $\mathrm{RCA}_0^*$, cohesive Ramsey's theorem for pairs $\mathrm{CRT}^2_2$ implies exponential closure of the definable cut $\mathrm{I}^0_1$, which is the intersection of all $\Sigma^0_1$-definable…
The infinite pigeonhole principle for $k$ colors ($\mathsf{RT}_k$) states, for every $k$-partition $A_0 \sqcup \dots \sqcup A_{k-1} = \mathbb{N}$, the existence of an infinite subset~$H \subseteq A_i$ for some~$i < k$. This seemingly…
We introduce a unital associative algebra A over degenerate CP^1. We show that A is a commutative algebra and whose Poincar'e series is given by the number of partitions. Thereby we can regard A as a smooth degeneration limit of the…
We characterize the strength, in terms of Weihrauch degrees, of certain problems related to Ramsey-like theorems concerning colourings of the rationals and of the natural numbers. The theorems we are chiefly interested in assert the…
In this paper, our aim is to analyse the generalization capabilities of first-order methods for statistical learning in multiple, different yet related, scenarios including supervised learning, transfer learning, robust learning and…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…