Related papers: Robustness of Pisot-regular sequences

We analyse the logical complexity and absoluteness of natural statements about Ulam sequences, with particular emphasis on the rigidity phenomena introduced by Hinman, Kuca, Schlesinger and Sheydvasser for the family $U(1,n)$. For each pair…

Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…

Every simple finite graph $G$ has an associated Lov\'asz-Saks-Schrijver ring $R_G(d)$ that is related to the $d$-dimensional orthogonal representations of $G$. The study of $R_G(d)$ lies at the intersection between algebraic geometry,…

We derive a formula for the reliability of a $d$-dimensional consecutive-$k$-out-of-$n$:F system. That is, a formula for the probability that an $n_1 \times \ldots \times n_d$ array whose entries are (independently of each other) $0$ with…

This paper pursues a two-fold goal. Firstly, we aim to derive novel second-order characterizations of important robust stability properties of perturbed Karush-Kuhn-Tucker systems for a broadclass of constrained optimization problems…

A $k$-tuple $(H_1, \ldots, H_k)$ of core-free subgroups of a finite group $G$ is said to be regular if $G$ has a regular orbit on the Cartesian product $G/H_1 \times \cdots \times G/H_k$. The regularity number of $G$, denoted $R(G)$, is the…

We consider discrete-time projective semilinear control systems $\xi_{t+1} = A(u_t) \cdot \xi_t$, where the states $\xi_t$ are in projective space $\mathbb{R}P^{d-1}$, inputs $u_t$ are in a manifold $U$ of arbitrary finite dimension, and $A…

Periodic orbit quantization requires an analytic continuation of non-convergent semiclassical trace formulae. We propose a method for semiclassical quantization based upon the Pade approximant to the periodic orbit sums. The Pade…

Let $R$ be a regular ring of dimension $d$ and $L$ be a $c$-divisible monoid. If ${K}_1{Sp}(R)$ is trivial and $k \geq d+2,$ then we prove that the symplectic group ${Sp}_{2k}(R[L])$ is generated by elementary symplectic matrices over…

We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…

Dynamical systems at the edge of chaos, which have been considered as models of self-organization phenomena, are marked by their ability to perform nontrivial computations. To distinguish them from systems with limited computing power, we…

We show that spaces of Colombeau generalized functions with smooth parameter dependence are isomorphic to those with continuous parametrization. Based on this result we initiate a systematic study of algebraic properties of the ring…

We prove a regularity lemma with respect to arbitrary Keisler measures mu on V, nu on W where the bipartite graph (V,W,R) is definable in a saturated structure M and the formula R(x,y) is stable. The proof is rather quick and uses local…

We define a new class of pseudo effect algebras, called kite pseudo effect algebras, which is connected not necessarily with partially ordered groups, but rather with generalized pseudo effect algebras where the greatest element is not…

Let $K$ be a finite simplicial complex. We prove that the normalized expected Betti numbers of a random subcomplex in its $d$-th barycentric subdivision $\text{Sd}^d (K)$ converge to universal limits as $d$ grows to $+ \infty$. In…

We provide a universal characterization of the construction taking a scheme $X$ to its stable $\infty$-category $\text{Mot}(X)$ of noncommutative motives, patterned after the universal characterization of algebraic K-theory due to…

Let $K\subseteq\mathbb{R}$ be the unique attractor of an iterated function system. We consider the case where $K$ is an interval and study those elements of $K$ with a unique coding. We prove under mild conditions that the set of points…

Iterative methods play an important role in science and engineering applications, with uses ranging from linear system solvers in finite element methods to optimization solvers in model predictive control. Recently, a new computational…

Let $G$ be a finite simple connected graph on the vertex set $V(G)=[d]=\{1,\dots ,d\}$, with edge set $E(G)=\{e_{1},\dots , e_{n}\}$. Let $K[\mathbf{t}]=K[t_{1},\dots , t_{d}]$ be the polynomial ring in $d$ variables over a field $K$. The…

Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…