Related papers: RCF4: Inconsistent Quantification

There has been considerable recent study in "sub-diffusion" models that replace the standard parabolic equation model by a one with a fractional derivative in the time variable. There are many ways to look at this newer approach and one…

Motivated by Maulik-Okounkov stable maps associated to quiver varieties, we define and construct algebraic stable maps on tensor products of representations in the category O of the Borel subalgebra of an arbitrary untwisted quantum affine…

A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions. However, for many other classes such…

This paper provides algebraic proofs for several types of congruences involving the multipartition function and self-convolutions of the divisor function. Our computations use methods of Differential Algebra in $\mathbb{Z}/q\mathbb{Z}$,…

Let $T:[0,1]^d \rightarrow[0,1]^d$ be a piecewise expanding map with an absolutely continuous (with respect to the $d$-dimensional Lebesgue measure $m_d$) $T$-invariant probability measure $\mu$. Let $\left\{\mathbf{r}_n\right\}$ be a…

Probabilistic programming provides a high-level framework for specifying statistical models as executable programs with built-in randomness and conditioning. Existing inference techniques, however, typically compute posterior distributions…

We consider a recursive scheme for defining the coefficients in the operator product expansion (OPE) of an arbitrary number of composite operators in the context of perturbative, Euclidean quantum field theory in four dimensions. Our…

Combinatorial reconfiguration is a growing research field studying problems on the transformability between a pair of solutions of a search problem. We consider the approximability of optimization variants of reconfiguration problems; e.g.,…

Perturbations due to round-off errors in computer modeling are discontinuous and therefore one cannot use results like KAM theory about smooth perturbations of twist maps. We elaborate a special approximation scheme to construct two smooth…

Collinear factorization and the leading-twist operator product expansion (OPE) in perturbative QCD express suitably inclusive observables in scale-separated kinematics as composites of perturbative short-distance coefficients with universal…

Type theories with multi-clocked guarded recursion provide a flexible framework for programming with coinductive types encoding productivity in types. Combining this with solutions to general guarded domain equations one can also construct…

We introduce the notion of \tau-like partial order, where \tau is one of the linear order types \omega, \omega*, \omega+\omega*, and \zeta. For example, being \omega-like means that every element has finitely many predecessors, while being…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

The relativistic precession model (RPM) is widely-considered as a benchmark framework to interpret quasi-periodic oscillations (QPOs), albeit several observational inconsistencies suggest that the model remains incomplete. The RPM ensures…

Quantum theory's irreducible empirical core is a probability calculus. While it presupposes the events to which (and on the basis of which) it serves to assign probabilities, and therefore cannot account for their occurrence, it has to be…

In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as {\em leveled primitive recursion of order $i$}($\mathbf{PR}_{i}$). Primitive recursion is…

We study divide-and-conquer recurrences of the form \begin{equation*} f(n) = \alpha f(\lfloor \tfrac n2\rfloor) + \beta f(\lceil \tfrac n2\rceil) + g(n) \qquad(n\ge2), \end{equation*} with $g(n)$ and $f(1)$ given, where $\alpha,\beta\ge0$…

Quantum f-divergences are a quantum generalization of the classical notion of f-divergences, and are a special case of Petz' quasi-entropies. Many well known distinguishability measures of quantum states are given by, or derived from,…

In reinforcement learning (RL), Q-learning is a fundamental algorithm whose convergence is guaranteed in the tabular setting. However, this convergence guarantee does not hold under linear function approximation. To overcome this…

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…