Related papers: Weak and Strong Versions of Effective Transfinite …

We study the Hamiltonian truncation for the two-dimensional $\lambda\phi^4$ theory within the framework of Hamiltonian truncation effective theory, where truncation artifacts are mitigated through a systematic inclusion of corrective terms…

We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…

We give a short, self-contained, and elementary proof of the strong law of large numbers under a power law decay hypothesis for joint second moments. The result is related to the classical one by Lyons. However, we also provide a rate of…

We define an infinite measure-preserving transformation to have infinite symmetric ergodic index if all finite Cartesian products of the transformation and its inverse are ergodic, and show that infinite symmetric ergodic index does not…

Deterministic 2-head finite automata which are machines that process an input word from both ends are analyzed for their ability to perform reversible computations. This implies that the automata are backward deterministic, enabling unique…

In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit…

We define a new perverse t-exact pullback operation on derived categories of constructible sheaves which generalizes most perverse t-exact functors in sheaf theory, such as microlocalization, the Fourier-Sato transform and vanishing cycles.…

We investigate the statement "the order topology of every countable complete linear order is compact" in the framework of reverse mathematics, and we find that the statement's strength depends on the precise formulation of compactness. If…

We examine the problem of gauge dependence of the 2PI effective action and its Phi-derivable approximations in gauge theories. The dependence on the gauge-fixing condition is obtained. The result shows that Phi-derivable approximations,…

Taking matrix as a synonym for a numerical function on the Cartesian product of two (in general, infinite) sets, a simple purely algebraic "reciprocity property" says that the set of rows spans a finite-dim space iff the set of columns does…

A topological space ${\mathcal X}$ is reversible iff each continuous bijection (condensation) $f: {\mathcal X} \rightarrow {\mathcal X}$ is a homeomorphism; weakly reversible iff whenever ${\mathcal Y}$ is a space and there are…

A strong backdoor in a formula $\phi$ of propositional logic to a tractable class $\mathcal{C}$ of formulas is a set $B$ of variables of $\phi$ such that every assignment of the variables in $B$ results in a formula from $\mathcal{C}$.…

We present an adaptation of two recent low-rank approximation technique proposed for first-order model reduction systems to the second-order systems. The resulting reduced order models are guaranteed to keep the second order structure which…

We present a simple proof of the entropy-power inequality using an optimal transportation argument which takes the form of a simple change of variables. The same argument yields a reverse inequality involving a conditional differential…

We construct a class of negative spin irreducible representations of the su(2) Lie algebra. These representations are infinite-dimensional and have an indefinite inner product. We analyze the decomposition of arbitrary products of positive…

While it is well known that a Turing machine equipped with the ability to flip a fair coin cannot compute more that a standard Turing machine, we show that this is not true for a biased coin. Indeed, any oracle set $X$ may be coded as a…

Walsh [MR4525964, Zbl 1569.03151] has shown that comparing proof-theoretic ordinals is equivalent to comparing $\Pi^1_1$-consequence comparison and $\Pi^1_1$-reflection comparison, all modulo true $\Sigma^1_1$-sentences. In this paper, we…

We observe that successive applications of known results from the theory of positive systems lead to an {\it efficient general algorithm} for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one…

We define strict and weak duality involutions on 2-categories, and prove a coherence theorem that every bicategory with a weak duality involution is biequivalent to a 2-category with a strict duality involution. For this purpose we…

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…