Related papers: Symmetric Iterations with Countable and $<\kappa$-…

Smoothed implicit contact dynamics enables gradient-based planning and control for contact-rich tasks without predefined mode sequences. However, safety-critical control remains challenging because implicit contact dynamics makes…

The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…

For infinite cardinals $\kappa,\lambda$ let $C(\kappa,\lambda)$ denote the class of all compact Hausdorff spaces of weight $\kappa$ and size $\lambda$. So $C(\kappa,\lambda)=\emptyset$ if $\kappa>\lambda$ or $\lambda>2^\kappa$. If F is a…

Using the numerical modular bootstrap, we constrain the space of 1+1d CFTs with a finite non-invertible global symmetry described by a fusion category $\mathcal{C}$. We derive universal and rigorous upper bounds on the lightest…

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…

In this paper, we propose a unifying framework incorporating several momentum-related search directions for solving strongly monotone variational inequalities. The specific combinations of the search directions in the framework are made to…

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…

We study higher analogues of the classical independence number on $\omega$. For $\kappa$ regular uncountable, we denote by $i(\kappa)$ the minimal size of a maximal $\kappa$-independent family. We establish ZFC relations between $i(\kappa)$…

Iteration limited model predictive control (MPC) can stabilize a feedback control system under sufficient conditions; this work explores combining a low iteration limit MPC with a high iteration limit MPC for mixed-integer quadratic…

Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.

We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…

We prove a theorem on iterated forcing that can be used for preservation of $\aleph_2$ and $\aleph_1$ in iterations with supports of size $\aleph_1$ of forcings that have amalgamation properties similar to those present in the perfect set…

Sequential hypothesis testing asks for decision rules that update as data arrive. A natural goal is \emph{eventual correctness}: the rule may change its mind early on, but it should make only finitely many wrong decisions almost surely.…

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

We introduce a one-step cascade symmetric system whose local symmetry geometry is organized by finite $\rho$-closed windows and one-step stars rather than by rowwise-independent toggles. The resulting symmetric model isolates a new $ZF + DC…

We study weighted basic parallel processes (WBPP), a nonlinear recursive generalisation of weighted finite automata inspired from process algebra and Petri net theory. Our main result is an algorithm of 2-EXPSPACE complexity for the WBPP…