Peer Revenue Past citations are no guarantee of future returns

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Friday 15 May

Dynamical Systems

Growth Conditions for Étale Groupoids: Amenability and Comparison

We investigate étale Hausdorff groupoids whose source fibres have controlled growth with respect to a length function. Our first result shows that uniform subexponential growth implies topological amenability. If the unit space is compact and metrizable and such a length satisfies a suitable uniform doubling condition, then the groupoid has weak $m$-comparison for some $m$. For minimal ample groupoids, this implies comparison and almost unperforation of the type semigroup. Under the additional assumption that the unit space has no isolated points, we deduce Matui's AH-conjecture.
Read the full abstract

Functional Analysis

A proof of Esterle's conjecture on negative powers of Hilbert-space contractions

We establish the following result, confirming a conjecture of Jean Esterle. For each closed subset $E$ of the unit circle of Lebesgue measure zero, there exists a positive sequence $u_n\to\infty$ with the following property: if $T$ is a contraction on a Hilbert space such that $\sigma(T)\subset E$ and $\|T^{-n}\|=O(u_n)$ as $n\to\infty$, then $T$ is a unitary operator. A key tool used in the proof is a result generalizing the well-known fact that closed subsets $E$ of the real axis of Lebesgue measure zero are removable for bounded holomorphic functions. We show that such sets remain removable even for certain unbounded holomorphic functions of moderate growth near $E$, where the notion of `moderate' depends on $E$.
Read the full abstract

Optimization and Control

Towards A Goldfarb-Idnani Variant for Strongly Monotone Linear-Quadratic Games

We analyze a simple variant of the Goldfarb-Idnani (GI) dual active-set method for computing variational generalized Nash equilibria of strongly monotone N-player games with convex quadratic costs and shared affine inequality and equality constraints. We show that several properties of the GI algorithm are maintained in spite of having a possibly non-symmetric pseudogradient matrix in the joint KKT system of the game, although convergence to an existing equilibrium is not guaranteed as in the original algorithm. Our numerical results show that the method is potentially competitive with alternative state-of-the-art algorithms, including for computing solutions of game-theoretic linear model predictive control laws.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Testing properties of trees in graphical models with covariance queries

We consider the problem of testing properties of graphs underlying high-dimensional graphical models. We adopt the model of covariance queries introduced by Lugosi, Truszkowski, Velona, and Zwiernik (2021). We study the case when the underlying graph is a tree. The main results of the paper show that, while reconstructing the entire tree may be costly, certain global structural properties can be tested efficiently. In particular, we design randomized tests for global structural properties that use a sub-quadratic number of queries. We develop testing procedures for several fundamental properties, including the number of leaves, the maximum degree, the typical distance, and the diameter of the tree. For each property, we obtain explicit query complexity bounds that depend on the target threshold and tolerance parameters.
Read the full abstract

All authors Sofiya Burova, Francisco Calvillo, Gábor Lugosi, Piotr Zwiernik

Optimization and Control

Singular control with state-dependent costs for Lévy processes

We study a discounted singular stochastic control problem driven by a general Lévy process, where the objective is to minimize a cost functional composed of a running cost and a control cost that depends on the current state of the process. We first establish a Hamilton Jacobi Bellman (HJB)-type verification theorem providing sufficient conditions under which a reflecting barrier strategy is optimal and characterizing the value function. Our main contribution is to connect this control problem with an associated optimal stopping problem: we prove that the optimal reflection threshold coincides with the optimal stopping boundary of the auxiliary problem. This connection allows us to characterize the optimal strategy through probabilistic tools and leads to explicit or semi-explicit solutions in several relevant cases. We illustrate the results with several examples, including an application to pollution abatement.
Read the full abstract

Commutative Algebra

A Linear Bound on the Projective Dimension of Height 3 Quadratic Ideals

In 2016, Ananyan and Hochster gave the first proof of a positive answer to Stillman's Question, which asked for a bound on the projective dimension of a graded polynomial ideal purely in terms of the number and degrees of its generators. Explicit formulas for such a bound are limited and often not optimal. In this paper, we give a nearly optimal linear upper bound on the projective dimension of height $3$ ideals generated by any number of degree $2$ homogenous polynomials.
Read the full abstract

Metric Geometry

Area of Hölder curves and coarea formula on the Heisenberg group

We prove the coarea formula for Lipschitz maps from the subriemannian $n$th Heisenberg group $\mathbb H_n$ to $\mathbb R^{2n}$. Our result is new even when $n=1$ and provides the simplest vector-valued instance of the coarea formula in subriemannian geometry. This answers a question left open in the works of Magnani, Kozhevnikov, Magnani–Stepanov–Trevisan, and Julia–Nicolussi Golo–Vittone. The main difficulty of the proof is that a fiber of a $C^1_{\mathrm{H}}$ map $f: \mathbb H_n\to \mathbb R^{2n}$ is typically an unrectifiable curve. Its measure depends on the symplectic area of its projection to $\mathbb R^{2n}$. A bound on this area would imply the coarea formula, but examples of Kozhevnikov show that this area can be infinite or undefined. To overcome this, we introduce an integral that we use to define both the symplectic area of $\frac{1}{2}$–Hölder curves in $\mathbb R^{2n}$ and the symplectic area of projections of vertical curves in $\mathbb H_n$. Then, we give a geometric condition for this integral to converge. This yields, in addition, new results on the existence of the signed area of $\tfrac12$–Hölder planar curves that may be of independent interest. Finally, we use $\beta$–number estimates from the Fässler–Orponen Dorronsoro Theorem to show that this geometric condition holds for almost every fiber.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.SI

Integrability of oscillators and transcendental invariant curves

In this work we study the integrability of a family of nonlinear oscillators. Dynamical systems from this family appear in different applications from mechanics to chemistry. We propose an approach for finding first integrals and integrating factors, which is based on the construction and classification of transcendental invariant curves whose cofactors are polynomial or rational in one of the variables. We demonstrate that this approach can be efficiently used for finding non-Liouvillian and non-Puiseux integrable dynamical systems. Its application involves finding solutions only of linear algebraic and linear ordinary differential equations. This allows one to study singularities, including essential ones, of the invariant curves in the complex plane. We illustrate this approach by proving non-Liouvillian integrability of two dynamical systems from the Painlevé–Gambier classification and non-Puiseux integrability of an oscillator from the considered family. Furthermore, we construct equivalence classes of the first two dynamical systems with respect to nonlocal transformations. We show that among these equivalence classes there are interesting examples of integrable dynamical systems.
Read the full abstract

Analysis of PDEs

On the rate of convergence to steady state in a linear chromatography model

We study the rate of convergence to the steady state in the True Moving Bed model of linear chromatography, as a function of the six parameters that appear in the model. The model is a system of eight linear partial differential equations of hyperbolic type, coupled through the equations themselves and also through boundary conditions. We prove that the rate of convergence is given by a dominant eigenvalue, whose existence we prove by means of the Krein-Rutman Theorem, and by comparison arguments. We show how to construct a (not at all simple) characteristic function, whose roots are the eigenvalues. We also study the asymptotic profile of the solutions for large times, although this part is not purely analytical, but a combination of analytical and numerical techniques. Beyond the theoretical results, these models also offer explicit quantitative information: we apply all our results to a Case Study, namely the separation of omeprazole enantiomers. Finally, we consider a simpler limit case, where all the calculations become explicit.
Read the full abstract

Optimization and Control

Copositive Matrices with Ordered Off-Diagonal Entries

We study copositive matrices which admit a decomposition into a sum of a positive semidefinite matrix and a matrix with nonnegative entries. Our main result shows that if the off-diagonal entries of a copositive matrix are nondecreasing in rows and in columns, then it admits such a decomposition. We apply this result to study optimization of quadratic forms over the standard simplex. As a corollary, we obtain that a natural relaxation of this problem is tight when the objective function is separable, resolving an open question of Dey and Kocuk.
Read the full abstract

All authors Grigoriy Blekherman, Santanu S. Dey, Alex Dunbar, Burak Kocuk

Mathematical Physics · Cross-listed from quant-ph

Fast convergence of Dynamic Capacities of GNS-Symmetric Quantum Channels

We consider a quantum system described by a quantum channel $\Phi$ that is applied at every time step and study the time evolution of its information capacities. When $\Phi$ is a GNS-symmetric channel (this includes Pauli channels, for example), we give explicit exponential convergence bounds for the classical and quantum capacities. These bounds are in terms of entropic properties of $\Phi$. We further illustrate how these results help quantify the performance of active versus passive error-correction setups.
Read the full abstract

All authors Omar Fawzi, Li Gao, Mizanur Rahaman, Mostafa Taheri

Information Theory

Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel

This work extends the generalized nearest neighbor decoding (GNND), originally developed as a receiver architecture for memoryless channels, to a vectorized GNND (Vec-GNND) suitable for in-block memory (IBM) channels. Leveraging the generalized mutual information (GMI) as an operational lower bound on the mismatch capacity, an analytical characterization of the optimal Vec-GNND is obtained for general IBM channels with Gaussian codebooks. The formalism further provides closed-form optimality conditions and achievable GMIs for restricted variants of the receiver architecture. Furthermore, we formulate a GMI-based joint design viewpoint for Gaussian codebook covariance and decoding metrics. Since the metric optimization admits a closed-form solution for each fixed covariance, the joint design is reduced to an input-covariance optimization problem; for the diagonal covariance family, we derive first-order self-consistent optimality conditions. Numerical evaluations on block noncoherent AWGN and phase-noise channels demonstrate consistent GMI gains over conventional scaling-based GNND schemes, suggesting potential performance advantages of Vec-GNNDR in practical communication systems.
Read the full abstract

All authors Yuhao Liu, Xinwei Li, Shuqin Pang, Hao Wu, Wenyi Zhang

Analysis of PDEs

Multi parameter identification in the nonlinear periodic Westervelt equation

Nonlinear ultrasound imaging leverages harmonic wave generation to enhance contrast and spatial resolution beyond the capabilities of conventional linear techniques. This behavior is commonly modeled by the Westervelt equation, which captures finite-amplitude acoustic wave propagation in heterogeneous media. In this work, we investigate an inverse problem for a periodic nonlinear Westervelt equation in $\mathbb{R}^d$, where $d\in\{2,3\}$ with spatially varying coefficients and Robin-type boundary conditions. The objective is to simultaneously reconstruct the sound speed, diffusivity, and nonlinearity parameters from (partial) boundary measurements. We first establish the Fréchet differentiability of the forward solution operator with respect to the unknown parameters, providing a rigorous analytical foundation for parameter identification. To address uniqueness, we introduce a reference-state framework and prove linearized uniqueness of an all-at-once forward operator without requiring the reference states to satisfy the governing equation. Building on these results, we develop an iterative reconstruction scheme based on a frozen Newton-type method, supported by an exact range invariance property. Numerical simulations are presented to illustrate the feasibility and performance of the proposed approach.
Read the full abstract

Statistics Theory

Node-private community estimation in stochastic block models: Tractable algorithms and lower bounds

We study the classical problem of community recovery in stochastic block models with a fixed number of communities, with a twist: We seek algorithms that are stable with respect to node-wise changes in the graph structure, formally defined as a differential privacy constraint. The algorithms we develop are based on spectral clustering, where we introduce privacy to the community recovery pipeline in the form of directly privatizing the adjacency matrix; private PCA; private convex optimization; private low-rank matrix estimation; and private approximate subspace estimation. Straightforward applications of existing private algorithms lead to a rapid increase in the privacy parameter $\epsilon$ in order to ensure consistent estimation under node differential privacy, in contrast with the simpler setting of edge privacy. To alleviate these issues, we develop novel algorithms based on (1) sampling from an exponential mechanism with a Lipschitz extension and (2) a general framework for constructing smooth projections from the space of undirected graphs to the space of bounded-degree graphs, which can then be combined with various edge-private algorithms. Importantly, the methods we develop are all computable in polynomial-time as a function of the number of nodes in the graph. We also develop novel lower bounds on the growth rate of $\epsilon$ required in order to achieve consistent community estimation under node privacy. On a technical note, our paper highlights the complications that arise when analyzing private algorithms under the non-standard scaling $\epsilon \rightarrow \infty$ and proposes some solutions. We also provide a novel application of the HGR maximal correlation from information theory in the context of accuracy amplification in PAC learning, which may be of independent interest.
Read the full abstract

All authors Laurentiu Marchis, Ethan D'souza, Tomáš Flídr, Po-Ling Loh

Numerical Analysis

A note on short and long exact sequences in the BGG construction of complexes from complexes

We first show how the cohomology of some Bernstein-Gelfand-Gelfand (BGG) sequences that are important for the numerical analysis of partial differential equations, can be obtained through the construction of a long exact sequence connecting cohomology groups. Then we explain the extension of this result to the non-injective/surjective case through the systematic use of short exact sequences of complexes and their associated long exact sequences of cohomology groups. Finally an interpretation in terms of spectral sequences is given.
Read the full abstract

Probability

A Counterexample to Small-time Limit Theorems for Stochastic Processes

The standard small-time functional central limit theorem of semimartingales has been established in (Gerhold, S., Kleinert, M., Porkert, P., and Shkolnikov, M. (2015). Small time central limit theorems for semimartingales with applications. Stochastics, 87), proving that the scaling limit law of a large class of stochastic processes in increasingly small time scales is that of a Brownian motion with a possibly nontrivial variance-covariance matrix. In this paper we focus on the time-homogeneous diffusion processes described by Itô SDEs. Instead of the simple time scaling $1/n$ of (Gerhold, S., Kleinert, M., Porkert, P., and Shkolnikov, M. (2015). Small time central limit theorems for semimartingales with applications. Stochastics, 87) we consider the scaled processes stopped at the first exit times from the balls of decreasing radius $n^{-1/2}$ without scaling time itself. To the best of our knowledge, this particular scaling has not been investigated in the literature. We prove that this is a nontrivial example of a sequence of processes which converges in the sense of finite-dimensional distributions over a dense subset of $[0,\infty)$, but it does not converge weakly in the sense of laws of càdlàg processes. We also characterise the limit law of the scaled processes evaluated at their respective first exit times.
Read the full abstract

2605.15931 · 15 May · This paper was originally published in Sparago, P. "A Counterexample to Small-Time Limit Theorems for Stochastic Processes", Theory of Probability & Its Applications, Vol. 71, Iss. 1 (2026) https://doi.org/10.1137/S0040585X97T992847. This version contains minor corrections to: (i) premise to Lemma 2 at the beginning of Section 2.2; (ii) second part of the proof of Lemma 14

Dynamical Systems

Kolmogorov invariant torus theorem for weakly interacting particles I: Full dimensional tori

We develop an abstract KAM theorem for systems of infinitely many interacting particles with decaying masses and all-to-all interactions. Using this framework, we construct full-dimensional KAM tori for infinite-dimensional mechanical systems exhibiting long range interactions.

Dynamical Systems

Delay periodic Lyapunov equation

For linear periodic finite-dimensional systems, it is well-known that, first, exponential stability is equivalent to the existence of a unique periodic positive definite solution to the Lyapunov equation, and second, the Lyapunov equation admits a unique periodic solution, if and only if the monodromy matrix has no reciprocal eigenvalues. In the present paper, we generalize these results to the case of periodic evolution families on a Hilbert space, with application to the stability theory of linear periodic systems with constant delays. More precisely, we first link the existence and uniqueness of a quadratic periodic Lyapunov functional with the existence and uniqueness of the solution to a discrete operator Lyapunov equation with the monodromy operator involved. Second, we show that the presented theory on a Hilbert space gives rise to an alternative definition of the delay Lyapunov matrix, the concept previously appeared in the construction of quadratic Lyapunov-Krasovskii functionals for a class of linear periodic delay systems. An explicit connection between the infinite-dimensional Hilbert setting and the previously developed delay Lyapunov matrix framework is established. An important consequence is the uniqueness theorem: the delay Lyapunov matrix exists and is unique, if and only if the monodromy operator has no reciprocal eigenvalues. As a by-product, our framework enables the construction of Lyapunov-Krasovskii functionals for periodic delay systems without a preliminary exponential stability assumption as in earlier theory.
Read the full abstract

Information Theory

Skew Constacyclic Codes Of Length $np^s$ over $ \frac{\mathbb{F}_{p^m}[u]}{\langle u^k \rangle}

Let $\mathbb{F}_{p^m}$ be the field containing $p^m$ elements where $p$ is an odd prime and $m \in \mathbb{N}$. In this article, we propose a unified approach to the study of skew constacyclic codes of length $np^s$ over the ring $R_k = \mathbb{F}_{p^m}[u]/\langle u^k \rangle,$ where $n, s, k \in \mathbb{N}$ and $\gcd(n, p)=1$. Consider the skew polynomial ring $R_k[x;\Theta]$, where $\Theta$ is an automorphism of $R_k$ such that $xa = \Theta(a)x$ for all $a \in R_k$. Let $f(x)$ be a central irreducible divisor of $x^{np^s} - \lambda$ of degree $l$ and multiplicity $j$ in $R_k[x;\Theta]$, where $\lambda $ is an invertible element in $R_k$. In this article, we study skew constacyclic codes of length \(np^s\) over \(R_k\), which reduces to the study of skew polycyclic codes of length $jl$ associated with a polynomial \(f(x)^j\). Using the fact that skew polycyclic codes associated with a polynomial \(f(x)^j\) can be described by the left ideal structure of the quotient ring $R_k[x;\Theta]/\langle f(x)^{j}\rangle$, we investigate this class of codes for specific choices of $\Theta$. In particular, if $\lambda$ is an invertible element of $\mathbb{F}_{p^m}$, we classify all left ideals and establish an isomorphism between skew cyclic and skew constacyclic codes, under suitable conditions. Furthermore, we provide a comprehensive analysis of skew constacyclic codes of length $3p^s$ over $R_k$. Finally, we examine skew cyclic and skew negacyclic codes of length $6p^s$ over $R_k$ using the factorization of $x^{6p^s} - 1$ and $x^{6p^s} + 1$, respectively; with a complete case-by-case analysis. Examples demonstrating codes with optimal parameters are also included.
Read the full abstract

All authors Seema Chahal, Seema Antil, Sugandha Maheshwary, Manju Khan

Dynamical Systems

Robustly transitive behavior in symplectic dynamics

We consider the direct product of two symplectomorphisms, one of which exhibits a basic set and the other one a non-degenerate elliptic equilibrium. Under a local domination condition we show that a typical real-analytic deformations of this system display large robustly transitive sets. As a corollary of our construction we also obtain new open sets of real-analytic symplectomorphisms which are topologically mixing but not uniformly hyperbolic. To establish these results we develop perturbation techniques to create blender horseshoes in the real-analytic setting and import ideas from control theory which show that, typically, these objects have a large domain of influence.
Read the full abstract

Classical Analysis and ODEs

Projections of convex polytopes to a line and higher univariate Prony systems

Motivated by the inverse moment problem for convex polytopes, we study the pushforward to a line of the Lebesgue measure restricted to a convex $d$-polytope. Such pushforwards are spline densities of degree $d-1$, and their moments lead naturally to a family of “higher” univariate Prony systems, with the classical Prony system recovered when $d=0$. We describe the corresponding fixed-knot spline cone, give an explicit amplitude recovery criterion, record the rational generating function and recurrence satisfied by the normalized moments, and identify the directional moment variety with the Hankel determinantal variety appearing in the theory of moment varieties of measures on polytopes.
Read the full abstract

Quantum Algebra

Restricted quantum groups as graded Hopf algebras

We introduce the notion of $\pi^2$-graded Hopf algebra, where the grading is by the double groupoid of commutative diagrams of a finite groupoid $\pi$. The finite dimensional representations of a $\pi^2$-graded Hopf algebra form a rigid monoidal category with a fibre functor to the category of $\pi$-graded vector spaces. The main example is given by the restricted quantum groups underlying the Andrews-Baxter-Forrester restricted solid-on-solid models of statistical mechanics and, more generally, the Jimbo-Miwa-Okado models associated to classical Lie algebras.
Read the full abstract

Statistics Theory

Edge-indexed network time series with graph Ornstein-Uhlenbeck dynamics

We introduce a class of Lévy-driven graph Ornstein-Uhlenbeck (grOU) models for edge-indexed network time series. The proposed framework extends generalized network autoregressive (GNAR) processes for edge-indexed network time series to continuous time and adapts graph Ornstein-Uhlenbeck dynamics, originally developed for node-indexed processes, to the edge-indexed setting. The model accommodates general Lévy noise and therefore captures both Brownian and jump behavior. We show that the model parameters can be estimated via a maximum-likelihood framework and derive the asymptotic properties of the estimator. We examine the finite-sample performance of the methodology through simulation studies and illustrate its practical relevance in an empirical application to high-frequency financial data. The results indicate that grOU models for edge-indexed network time series improve forecasting accuracy and reduce computational time relative to standard benchmarks while maintaining robustness through their network-based parametrization.
Read the full abstract

Functional Analysis

On properties of normal operators and self-adjoint operators on smooth Banach spaces

This article introduces classes of normal and unitary operators on smooth Banach spaces, providing extensions of the classical notions of normal and unitary operators from Hilbert spaces to the smooth Banach space setting. The proposed class of normal operators contains, in particular, the class of self-adjoint operators on Banach spaces known in the literature. In addition, we study several properties of self-adjoint operators on smooth Banach spaces, with emphasis on the norm, minimum modulus, numerical radius, and Crawford number, as well as the corresponding attainment properties and the relations among these quantities. Further, we obtain characterisations and spectral properties of the newly introduced classes of normal and unitary operators. Our results demonstrate close analogies with the corresponding theory of self-adjoint, normal, and unitary operators on Hilbert spaces.
Read the full abstract

Metric Geometry

The Dual Minkowski Problem under Group Actions

In this paper, we study the dual Minkowski problem under group symmetry. For $0<q\le n$, we give a complete existence characterization in the framework of $G$-invariant convex bodies when the group $G\subset O(n)$ has no nonzero fixed points, recovering the origin-symmetric setting when $G=\{\pm I\}$. The necessary and sufficient conditions concern the concentration of the measure on $G$-invariant subspaces, both in the range $0<q<n$ and at the critical endpoint $q=n$, where the problem becomes the logarithmic Minkowski problem.
Read the full abstract

Dynamical Systems

Symplectic Neural Operators for Learning Infinite Dimensional Hamiltonian Systems

The modeling and simulation of infinite-dimensional Hamiltonian systems are central problems in mathematical physics and engineering, however they pose significant computational and structural challenges for standard data-driven architectures. In this work, we introduce the Symplectic Neural Operator, a neural operator architecture designed to preserve the symplectic structure intrinsic to Hamiltonian PDEs. We provide a theoretical characterization of their symplecticity and establish a rigorous long-term stability result based on the combination of symplectic structure preservation and learning accuracy. Numerical experiments on canonical Hamiltonian PDEs corroborate this theoretical result and show that SNOs exhibit improved energy behavior compared with non-structure-preserving neural operators.
Read the full abstract

All authors Yeang Makara, Yusuke Tanaka, Takashi Matsubara, Takaharu Yaguchi

Algebraic Geometry

A category of graded matrix factorizations of a deformed polynomial associated to the $A_{\mu}$-singularity

We discuss a triangulated category of graded matrix factorizations of a deformed polynomial associated to the $A_{\mu}\textrm{-}$singularity. The semi-universal deformation of the $A_{\mu}\textrm{-}$singularity is given by a certain deformation of the polynomial of type $A_{\mu}$. In this paper, we consider the category of graded matrix factorizations associated to this deformed polynomial for a fixed parameter. To do so, we introduce a formal variable to make the polynomial homogeneous. As our main result, we construct a full strongly exceptional collection in this category for a generic parameter.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.CD

Symmetry breaking and high-dimensional chaos in sparse random networks of exact firing rate models

Exact firing rate models, also known as next-generation neural mass models (NG-NMMs), provide a rigorous description of the dynamics of neural populations. While in its simplest form a single population only displays fixed-point activity, multi-population models may display a range of different behaviors. In this work, we study the dynamics of all-excitatory or all-inhibitory NG-NMMs coupled through sparse random networks with row-normalized network topology. Linear stability analysis of the homogeneous states of the system, representing asynchronous neural activity, provides a dispersion relation linking the emergence of spatiotemporal dynamics to the spectra of the connectivity matrix. Using bounds from random matrix theory, we identify the parameter regions where instabilities occur. In undirected networks, only inhibitory systems produce heterogeneous stationary patterns, corresponding to a winner-takes-all mechanism. In directed networks, exotic rhythmic states with high frequencies emerge in both, excitatory and inhibitory systems. Numerical simulations reveal that these hectic oscillatory states correspond to high-dimensional chaos with extensive properties.
Read the full abstract

Logic

Keisler Measures and Generically Stable Random Types

We introduce the notions of $rgs$ and $irgs$ for Keisler measures, motivated by the study of generically stable random types and their associated Morley sequences. We obtain characterizations of these notions in terms of averages of classical first-order formulas over suitable probabilistic partitions (Theorems 3.2 and 3.3). We compare these notions with $fim$, $fam$, and self-averaging, and show that for types the notions $fim$, $irgs$, and $rgs$ coincide. We prove that if a definable global Keisler measure$\mu$ is not dependent, then every Morley sequence in its canonical random extension $r_\mu$ is divergent (Theorem 4.7). Consequently, every $irgs$ measure is dependent (Corollary 4.8) and hence symmetric (Corollary 4.13). Furthermore, we show that for $irgs$ measures the model-theoretic instability events $\mathbf{O}^\varphi$, $\mathbf{I}^\varphi$, and $\mathbf{L}^\varphi$ have $\mathbb{P}_\mu$-measure zero (Theorem 5.4). In view of the equivalence of $fim$ and $irgs$ subsequently established in [6], this provides an alternative proof of the corresponding result for $fim$ measures in [9].
Read the full abstract

Operator Algebras

A new perspective on spectra of quantum spaces

We consider a class of C*-algebras C(X) associated with quantum spaces such as spheres, projective spaces, and lens spaces. We introduce a non-self-adjoint operator algebra A together with an explicit functor from the category of representations of A to that of C(X). We then construct explicitly a family of one-dimensional representations of A that parametrise the entire spectrum of C(X).
Read the full abstract