Related papers: Symmetric Iterations with Countable and $<\kappa$-…
This work develops a systematic functional-analytic framework for nonlinear adaptive memory, where the influence of past events depends on both elapsed time and the state values along a trajectory. The framework comprises three hierarchical…
We study generalized symmetries of quantum field theories in 1+1D generated by topological defect lines with no inverse. This paper follows our companion paper on gapped phases and anomalies associated with these symmetries. In the present…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
We consider a generalisation of the self-affine iterated function systems of Lalley and Gatzouras by allowing for a countable infinity of non-conformal contractions. It is shown that the Hausdorff dimension of the limit set is equal to the…
We study a classification of the kappa-times integrated semigroups (for kappa>0) by the (uniform) rate of convergence at the origin: $\|S(t)\|=O(t^\alpha)$, $0\leq\alpha\leq\kappa$. By an improved generation theorem we characterize this…
We initiate the S-matrix bootstrap analysis of theories with non-invertible symmetries in (1+1) dimensions. Our previous work showed that crossing symmetry of S-matrices in such theories is modified, with modification characterized by the…
The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper,…
We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each…
In parallel to the unified construction of relativistic Hamiltonians based solely on physical arguments [J. Chem. Phys. 160, 084111 (2024)], a unified implementation of relativistic wave function methods is achieved here via programming…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
Typical iterated filters, such as the iterated extended Kalman filter (IEKF), iterated unscented Kalman filter (IUKF), and iterated posterior linearization filter (IPLF), have been developed to improve the linearization point (or density)…
We introduce regenerative tree growth processes as consistent families of random trees with n labelled leaves, n>=1, with a regenerative property at branch points. This framework includes growth processes for exchangeably labelled Markov…
This paper develops a new framework, \emph{simultaneous saturation}, designed to quantify the size of sets whose elements are simultaneously large. The framework establishes a correspondence between the magnitude of such sets and a system…
This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…
Hardness amplification is a central problem in the study of interactive protocols. While ``natural'' parallel repetition transformation is known to reduce the soundness error of some special cases of interactive arguments: three-message…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
We study the nonstationary-support iteration of Prikry forcings below a measurable cardinal \kappa, characterizing all the normal measures it carries in the generic extension. We then analyze the restriction of ultrapower embeddings, taken…
Discrete-time domain Iterative Learning Control (ILC) schemes inspired by Repetitive control algorithms are proposed and analyzed. The well known relation between a discrete-time plant (filter) and its Markov Toeplitz matrix representation…
We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…
Goal. We analyze when the Partition Principle ($\mathsf{PP}$) holds without $\mathsf{AC}$ in models arising from a free finite $H$-action on Cantor space, and reconcile two standard routes to such models. Approach. Route I proceeds via a…