Related papers: Low-like basis theorems for Ramsey's theorem for p…
We establish a comparison principle for viscosity subsolutions and supersolutions of a broad class of second-order quasilinear, maximally subelliptic PDEs on general manifolds. In fact, we prove the comparison theorem for a larger class of…
Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…
Given a lattice $\Lambda \subset \mathbb{R}^n$, we consider its Minkowski reduced basis and the solid angle $\Omega$ spanned by the basis vectors. Such a basis satisfies strong near-orthogonality conditions, which allow us to bound from…
We develop a microscopic approach to the consistent construction of the kinetic theory of dilute weakly ionized gases of hydrogen-like atoms. The approach is based on the framework of the second quantization method in the presence of bound…
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \geq 2$, Ramsey's…
Motivated by Tukey classification problems and building on work in \cite{Dobrinen/Todorcevic11}, we develop a new hierarchy of topological Ramsey spaces $\mathcal{R}_{\alpha}$, $\alpha<\omega_1$. These spaces form a natural hierarchy of…
The aim of this article is to propose a new reduced-order modelling approach for parametric eigenvalue problems arising in electronic structure calculations. Namely, we develop nonlinear reduced basis techniques for the approximation of…
Small-amplitude weakly coupled oscillators of the Klein-Gordon lattices are approximated by equations of the discrete nonlinear Schrodinger type. We show how to justify this approximation by two methods, which have been very popular in the…
The paper concerns the second-order generalized differentiation theory of variational analysis and new applications of this theory to some problems of constrained optimization in finitedimensional spaces. The main attention is paid to the…
Lattices defined as modules over algebraic rings or orders have garnered interest recently, particularly in the fields of cryptography and coding theory. Whilst there exist many attempts to generalise the conditions for LLL reduction to…
Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…
In numerical simulations of many charged systems at the micro/nano scale, a common theme is the repeated solution of the Poisson-Boltzmann equation. This task proves challenging, if not entirely infeasible, largely due to the nonlinearity…
We construct a basis of the Garsia-Procesi ring using the catabolizability type of standard Young tableaux and the charge statistic. This basis turns out to be equal to the descent basis defined in Carlsson-Chou (2024+). Our new…
We study the Dirichlet problem for a second order linear elliptic equation in a bounded smooth domain $\Omega$ in $\mathbb{R}^n$, $n \ge 3$, with the drift $\mathbf{b} $ belonging to the critical weak space $L^{n,\infty}(\Omega )$. We…
We use the lcm-lattice of a monomial ideal to study its minimal free resolutions. A new concept called a Taylor basis of a minimal free resolution is introduced and then used throughout the paper. We give a method of constructing minimal…
We present the algebraic foundations of the symmetric Zassenhaus algorithm and some of its variants. These algorithms have proven effective in devising higher-order methods for solving the time-dependent Schr\"{o}dinger equation in the…
A landmark result in the study of logics for formal verification is Janin & Walukiewicz's theorem, stating that the modal $\mu$-calculus ($\mu\mathrm{ML}$) is equivalent modulo bisimilarity to standard monadic second-order logic (here…
We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…
This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…
Let $\mathcal T_\alpha~(0\leq\alpha<n)$ be a class of sublinear operators satisfying certain size conditions introduced by Soria and Weiss, and let $[b,\mathcal T_\alpha]~(0\leq\alpha<n)$ be the commutators generated by…