Related papers: Factorization under Local Finiteness Conditions

While initial versions of Bell's theorem captured the notion of locality with the assumption of factorizability, in later presentations, Bell argued that factorizability could be derived from the more fundamental principle of local…

Incomplete factorizations have long been popular general-purpose algebraic preconditioners for solving large sparse linear systems of equations. Guaranteeing the factorization is breakdown free while computing a high quality preconditioner…

These are notes from an informal mini-course on factorization homology, infinity-categories, and topological field theories. The target audience was imagined to be graduate students who are not homotopy theorists.

With reference to a baseline parametrization, we explore highly efficient fractional factorial designs for inference on the main effects and, perhaps, some interactions. Our tools include approximate theory together with certain carefully…

We study the generalized Hartree equation, which is a nonlinear Schr\"odinger-type equation with a nonlocal potential $iu_t + \Delta u + (|x|^{-b} \ast |u|^p)|u|^{p-2}u=0, x \in \mathbb{R}^N$.We establish the local well-posedness at the…

Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…

In this chapter we describe a selection of mathematical techniques and results that suggest interesting links between the theory of gratings and the theory of homogenization, including a brief introduction to the latter. By no means do we…

Let $M$ be a cancellative and commutative monoid. A submonoid $N$ of $M$ is called an undermonoid if the Grothendieck groups of $M$ and $N$ coincide. For a given property $\mathfrak{p}$, we are interested in providing an answer to the…

We introduce a preconditioner based on a hierarchical low-rank compression scheme of Schur complements. The construction is inspired by standard nested dissection, and relies on the assumption that the Schur complements can be approximated,…

This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…

Let $H$ be a Krull monoid with finite class group $G$ and suppose that each class contains a prime divisor. Then every non-unit $a \in H$ has a factorization into atoms, say $a=u_1 \cdot\ldots \cdot u_k$ where $k$ is the factorization…

Techniques involving factorization are found in a wide range of applications and have enjoyed significant empirical success in many fields. However, common to a vast majority of these problems is the significant disadvantage that the…

Let $\M(A,\theta)$ be a free partially commutative monoid. We give here a necessary and sufficient condition on a subalphabet $B\subset A$ such that the right factor of a bisection $\M(A,\theta)=\M(B,\theta\_B).T$ be also partially…

We propose a localized divide and conquer algorithm for inverse factorization $S^{-1} = ZZ^*$ of Hermitian positive definite matrices $S$ with localized structure, e.g. exponential decay with respect to some given distance function on the…

Since its introduction in 2012, the factorization theory for rational motions quickly evolved and found applications in theoretical and applied mechanism science. We provide an accessible introduction to motion factorization with many…

We provide a unified operational framework for the study of causality, non-locality and contextuality, in a fully device-independent and theory-independent setting. Our work has its roots in the sheaf-theoretic framework for contextuality…

Soft threshold factorization has been used extensively to study hadronic collisions. It is derived in the limit where the momentum fractions $x_{a,b}$ of both incoming partons approach $x_{a,b}\to 1$. We present a generalized threshold…

An atomic monoid $M$ is called a length-factorial monoid (or an other-half-factorial monoid) if for each non-invertible element $x \in M$ no two distinct factorizations of $x$ have the same length. The notion of length-factoriality was…

Let $\mathfrak{q}$ denote an ideal of a local ring $(A,\mathfrak{m})$. For a system of elements $\underline{a} = a_1,\ldots,a_t$ such that $a_i \in \mathfrak{q}^{c_i}, i = 1, \ldots,t,$ and $n \in \mathbb{Z}$ we investigate a subcomplex…

We study two extensions of FO2[<], first-order logic interpreted in finite words, in which formulas are restricted to use only two variables. We adjoin to this language two-variable atomic formulas that say, "the letter $a$ appears between…