Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 12 April

Geometric Topology

On the volume conjecture of the colored Jones invariants with arbitrary colors

We study the volume conjecture of the colored Jones invariants with sequences of colors corresponding to the deformation of the hyperbolic structure of a link complement. In particular, we investigate certain limits of the colored Jones invariants of the figure-eight knot and the Borromean rings and show that the limits are related to the volumes of hyperbolic cone manifolds whose singular sets are the links.
Read the full abstract

Combinatorics

An Upper Bound on the Linear Turán Number of $k$-Crowns

A hypergraph $H$ is said to be linear if every pair of vertices lies in at most one hyperedge. Given a family $\mathcal{F}$ of $r$-uniform hypergraphs (also called $r$-graphs), an $r$-graph $H$ is said to be \emph{$\mathcal{F}$-free} if it contains no member of $\mathcal{F}$ as a subhypergraph. The linear Turán number $ex_r^{\mathrm{lin}}(n,\mathcal{F})$ denotes the maximum number of edges in an $\mathcal{F}$-free linear $r$-graph on $n$ vertices. The crown is a linear $3$-graph obtained from three pairwise disjoint edges by adding an edge that intersects each of them in a distinct vertex. Recently, Gyárfás, Ruszinkó, and Sárközy~[Linear Turán numbers of acyclic triple systems, European J.\ Combin.\ (2022)] initiated the study of bounds on the linear Turán number for acyclic $3$-uniform linear hypergraphs, including that of the crown. We extend the notion of a crown by defining a $k$-crown, denoted by $C_{1,k}^r$, to be a linear $r$-graph consisting of one base edge together with $k$ pairwise disjoint edges, each intersecting the base in a distinct vertex. In this paper, we establish an upper bound on $ex_r^{\mathrm{lin}}(n,C_{1,k}^r)$, which in particular improves the recent bound of Zhang, Broersma, and Wang~[\emph{Generalized Crowns in Linear $r$-Graphs}, Electron.\ J.\ Combin.\ (2025)] for all $r \geq 4$, without forbidding any auxiliary configuration. We also note that the cases $k\in\{1,2\}$ correspond to the short linear paths $P_2^r$ and $P_3^r$, and can be treated separately.
Read the full abstract

Complex Variables

On the converse of the Shimorin–Peláez–Rättyä–Wick theorem

We establish a converse of the Shimorin–Peláez–Rättyä–Wick theorem. Specifically, we obtain necessary and sufficient conditions for a Shimorin kernel to be the kernel of a radial, logarithmically subharmonic weighted Bergman space.

Algebraic Geometry

Riemannian Geometry on Associative Varieties

We prove that the classical algebraic varieties over algebraically closed fields can be defined over arbitrary fields $k.$ Then we prove that for associative algebras $A$, there exist local representing objects $A_M$ for simple modules $M.$ Replacing the localization in maximal ideals in the commutative situation with the local representations in simple modules in the associative, we define an associative generalization of varieties. Now we realize that replacing $\mathbb R[x_1,\dots,x_n]=\mathbb R[n]$ with $C^\infty(\mathbb R^n),$ we can do differential geometry for associative $\mathbb R[n]$-algebras. This says that we can define a Riemannian geometry on associative varieties. This gives us the definition of connections and algebraic geodesic curves, introducing real geometry into associative algebras.
Read the full abstract

Probability

Least singular values of shifted sparse random combinatorial matrices

Let $M_n$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones. we establish quantitative lower bounds on the smallest singular value of the shifted matrices $M_n-z \mathbf{I}_n$ whenever $|z| \leq \sqrt{d}\, \log\log d$ and $ C \log n \leq d \leq n/2$ for some absolute positive constant $C$. As an application, we show that the empirical spectral distribution of the appropriately rescaled matrix $M_n$ converges in probability to the circular law provided that $\log^{2+\varepsilon} n \leq d=o(n)$ for some fixed $\varepsilon \in (0,1)$.
Read the full abstract

History and Overview of Mathematics

Astrolabe: A Content-Addressable Hypergraph for Semantic Knowledge Management

Existing knowledge management tools either preserve prose but lose structural relationships, or capture relationships but restrict edge semantics to fixed vocabularies. We introduce Astrolabe, a content-addressable hypergraph for semantic knowledge management. Entries are identified by the SHA-256 hash of their content, carry an ordered reference list of arbitrary width, and store an opaque record string interpreted by plugins. The structure admits two orthogonal decompositions: by width and by depth. We demonstrate the framework with a plugin bridging informal and formal mathematics.
Read the full abstract

Optimization and Control · Cross-listed from cs.CR

A Queueing-Theoretic Framework for Dynamic Attack Surfaces: Data-Integrated Risk Analysis and Adaptive Defense

We develop a queueing-theoretic framework to model the temporal evolution of cyber-attack surfaces, where the number of active vulnerabilities is represented as the backlog of a queue. Vulnerabilities arrive as they are discovered or created, and leave the system when they are patched or successfully exploited. Building on this model, we study how automation affects attack and defense dynamics by introducing an AI amplification factor that scales arrival, exploit, and patching rates. Our analysis shows that even symmetric automation can increase the rate of successful exploits. We validate the model using vulnerability data collected from an open source software supply chain and show that it closely matches real-world attack surface dynamics. Empirical results reveal heavy-tailed patching times, which we prove induce long-range dependence in vulnerability backlog and help explain persistent cyber risk. Utilizing our queueing abstraction for the attack surface, we develop a systematic approach for cyber risk mitigation. We formulate the dynamic defense problem as a constrained Markov decision process with resource-budget and switching-cost constraints, and develop a reinforcement learning (RL) algorithm that achieves provably near-optimal regret. Numerical experiments validate the approach and demonstrate that our adaptive RL-based defense policies significantly reduce successful exploits and mitigate heavy-tail queue events. Using trace-driven experiments on the ARVO dataset, we show that the proposed RL-based defense policy reduces the average number of active vulnerabilities in a software supply chain by over 90% compared to existing defense practices, without increasing the overall maintenance budget. Our results allow defenders to quantify cumulative exposure risk under long-range dependent attack dynamics and to design adaptive defense strategies with provable efficiency.
Read the full abstract

All authors Jihyeon Yun, Abdullah Yasin Etcibasi, Ming Shi, C. Emre Koksal

Optimization and Control

Distributed Optimization with Coupled Constraints over Time-Varying Digraph

In this paper, we develop a distributed algorithm for solving a class of distributed convex optimization problems where the local objective functions can be a general nonsmooth function, and all equalities and inequalities are network-wide coupled. This type of problem arises from many areas, such as economic dispatch, network utility maximization, and demand response. Integrating the decomposition by right hand side allocation and primal-dual methods, the proposed algorithm is able to handle the distributed optimization over networks with time-varying directed graph in fully distributed fashion. This algorithm does not require the communication of sensitive information, such as primal variables, for privacy issues. Further, we show that the proposed algorithm is guaranteed to achieve an $O(1/k)$ rate of convergence in terms of optimality based on duality analysis under the condition that local objective functions are strongly convex but not necessarily differentiable, and the subdifferential of local inequalities is bounded. We simulate the proposed algorithm to demonstrate its remarkable performance.
Read the full abstract

Mathematical Physics

Higher (gauged) Wess–Zumino–Witten terms based on Lie crossed modules

We derive higher Wess–Zumino–Witten (WZW) and gauged WZW (gWZW) terms within strict higher Chern–Simons (CS) gauge theory. Starting from the Cartan homotopy formula, we obtain the $(2n+2)$-dimensional higher CS forms and transgression forms for strict Lie 2-groups presented by Lie crossed modules. Given two 2-connections related by a higher gauge transformation, higher transgression forms yield canonical higher WZW and gWZW terms. We prove that, for the symmetric invariant polynomial associated with differential crossed modules, the pure-gauge higher WZW term vanishes identically, whereas the higher gWZW term is exact. Consequently, the higher CS action is higher-gauge invariant on closed manifolds, and on manifolds with boundary all gauge dependence is encoded in boundary terms.
Read the full abstract

Dynamical Systems

Symplectic Constraints in Classical Reaction Dynamics: From Gromov's Camel to Reaction Rates

We investigate whether ideas from symplectic topology, in particular Gromov's non-squeezing theorem and symplectic capacity, can provide useful geometric insight into classical reaction dynamics near an index-1 saddle. Using Poincaré-Birkhoff normal form theory, we describe the phase-space structures that organize transport through the transition-state region, including dividing surfaces, normally hyperbolic invariant manifolds (NHIMs), and the associated bath-action geometry. For quadratic saddle-center and saddle-center-center models, the normal-form geometry identifies natural bath-action area scales associated with the reactive bottleneck. For anharmonic systems (Eckart-Morse and Eckart-Morse-Morse), we formulate corresponding candidate symplectic width scales – based on transverse bath actions – using high-order normal forms for bounded local neighborhoods associated with the reaction bottleneck near the saddle. We then present two numerical illustrations: the backward propagation of a locally coupled phase-space ball to examine linear non-squeezing behavior, and a bath-localized ensemble calculation in an anharmonic normal-form model. These computations are consistent with the idea that heavily biasing the initial phase-space distribution of an ensemble toward the high-action boundaries of the bath modes can induce a severe finite-time dynamical delay, influencing reactivity in ways not captured by total phase-space volume or flux alone. The results suggest a new geometric perspective on mode selectivity and reaction bottlenecks, while highlighting open mathematical questions concerning the precise relation between these candidate width scales and genuine symplectic capacities of suitably defined reactive neighborhoods.
Read the full abstract

Probability

A remark on the comparison of the sum and the maximum of positive random variables

We disprove a conjecture stated in a recent paper by Arnold and Villasenor concerning the sum and the maximum of independent and identically distributed half-normal random variables. Our method is applicable to generalized gamma distributions.

Complex Variables

Analysis of Log-Weighted Quadrature Domains

This paper studies plane domains satisfying a quadrature identity with respect to the singular weight $\rho_0(w)=|w|^{-2}$. These are referred to as log-weighted quadrature domains (LQDs). The logarithmic singularity at $w=0$ leads to phenomena not present in the classical theory: in particular, when the domain contains the origin, the associated quadrature data are no longer unique, but are determined only up to a point charge at $0$. A generalized Schwarz function characterization of LQDs is established together with a natural formulation of the inverse problem in the singular setting. In the simply connected case, it is shown that a domain is an LQD if and only if the outer factor of its Riemann map extends to the exponential of a rational function. This characterization yields explicit formulae relating the quadrature function and the Riemann map via the Faber transform, thereby extending earlier formulae from the non-singular theory. Several basic classes of LQDs are also covered, and explicit examples are computed.
Read the full abstract

Representation Theory

Koszulity in the category $\mathcal{O}$ of the periplectic Lie Superalgebra $\mathfrak{pe}(2)$

The main result of this paper is to establish precisely which blocks in the Category $\mathcal{O}$ of the periplectic Lie superalgebra $\mathfrak{pe}(2)$ are Koszul. It is known that $\mathcal{O}(\mathfrak{pe}(2))$ has three blocks up to equivalence; one generic block and two integral blocks. The generic block is known to be Koszul, and the principle integral block is verifiably not Koszul. In this paper, we prove that the remaining of the three blocks of $\mathcal{O}(\mathfrak{pe}(2))$ is Koszul. This is done by explicitly computing the endomorphism algebra of projective modules in this block and then proving that it is Koszul inductively. Along the way, we compute all $\mathrm{Ext}$ groups between simples in this block. To compute the endomorphism algebra we are aided by a computer algebra tool developed in Mathematica, inspired by a post on Stack Exchange.
Read the full abstract

Saturday 11 April

Functional Analysis

Multiparameter $C$-semigroups and multiparameter $C$-cosine functions

In this paper, we present several new results concerning multiparameter $C$-semigroups. We introduce and systematically analyze the class of multiparameter $C$-cosine functions, providing several new structural results and applications to abstract multiparameter Cauchy problems of first/second order in locally convex spaces. We also consider automatic extensions of multiparameter $C$-semigroups and multiparameter $C$-cosine functions.
Read the full abstract

Information Theory · Cross-listed from cs.AI

The AI Telco Engineer: Toward Autonomous Discovery of Wireless Communications Algorithms

Agentic AI is rapidly transforming the way research is conducted, from prototyping ideas to reproducing results found in the literature. In this paper, we explore the ability of agentic AI to autonomously design wireless communication algorithms. To that end, we implement a dedicated framework that leverages large language models (LLMs) to iteratively generate, evaluate, and refine candidate algorithms. We evaluate the framework on three tasks spanning the physical (PHY) and medium access control (MAC) layers: statistics-agnostic channel estimation, channel estimation with known covariance, and link adaptation. Our results show that, in a matter of hours, the framework produces algorithms that are competitive with and, in some cases, outperforming conventional baselines. Moreover, unlike neural network-based approaches, the generated algorithms are fully explainable and extensible. This work represents a first step toward the autonomous discovery of novel wireless communication algorithms, and we look forward to the progress our community makes in this direction.
Read the full abstract

All authors Fayçal Aït Aoudia, Jakob Hoydis, Sebastian Cammerer, Lorenzo Maggi, Gian Marti, Alexander Keller

Analysis of PDEs

Nonlinear Vlasov-Fokker-Planck equations: From generalized Wasserstein gradient flow to GENERIC structure

We study the GENERIC (General Equation for Non-Equilibrium Reversible Irreversible Coupling) formulation of the nonlinear Vlasov-Fokker-Planck equation from the perspective of gradient flows along trajectories. After pulling back the reversible component, the evolution can be recast as a generalized Wasserstein gradient flow. The associated free energy functional consists of an entropy term and a conservative energy term, while the metric is induced by the Onsager operator. This trajectory based viewpoint shows that the trajectorial rate of free energy dissipation captures the influence of the nonlinear term, an effect that is not directly apparent at the macroscopic level. Finally, partial degeneracy yields a decomposition of the underlying metric space, which in turn enables the derivation of a partial HWI inequality.
Read the full abstract

Functional Analysis

On $c_0$ quotients of nonseparable Bourgain-Pisier $\mathscr{L}_\infty$-spaces

Lopez-Abad extended the Bourgain-Pisier construction to Banach spaces of arbitrary density: every Banach space $X$ embeds isometrically into an $\mathcal{L}_\infty$-space $Y$ such that $Y/X$ has the Radon-Nikodym and Schur properties. We study $c_0$ quotients of these spaces. For every $X$ of uncountable density $\kappa$, we describe a realization of the construction that admits an explicit surjection $T: Y \to c_0$, given by coordinate functionals built along the construction, whose kernel is an $\mathcal{L}_\infty$-space of density $\kappa$. We also note that an $\mathcal{L}_\infty$-space with a non-Grothendieck quotient has a $c_0$ quotient, and that every Lopez-Abad space has an $\ell_2$ quotient; all of them have $c_0$ quotients if no infinite-dimensional Banach space is both Schur and Grothendieck, a question we leave open. In an appendix we characterize when the kernel of a quotient map from an $\mathcal{L}_\infty$-space onto $c_0$ is an $\mathcal{L}_\infty$-space, give a quotient map from $C[0,1]$ onto $c_0$ whose kernel is not, and show that every non-Grothendieck $\mathcal{L}_\infty$-space admits one whose kernel is. This version corrects errors in version 1.
Read the full abstract

Numerical Analysis

Learning on the Temporal Tangent Bundle for Physics-Informed Neural Networks

This paper addresses the limitations of Physics-Informed Neural Networks for time-dependent problems by introducing a tangent bundle learning framework. Instead of directly approximating the solution, we parameterize its temporal derivative and reconstruct the state through a Volterra integral operator that enforces initial conditions exactly. This approach eliminates competing soft constraints and naturally amplifies high-frequency errors through differentiation, countering spectral bias. We prove theoretical equivalence between minimizing the differentiated residual and solving the original partial differential equation. Experiments on advection, Burgers, and Klein-Gordon equations show that the proposed method achieves 100 to 200 times lower errors than standard approaches using compact three-layer networks, with superior shock-capturing and long-time accuracy.
Read the full abstract

All authors Adetola Jamal, Mamlankou Charbel, Houédanou Koffi Wilfrid, Dègla Aymard Guy

Optimization and Control · Cross-listed from cs.AI

The Non-Optimality of Scientific Knowledge: Path Dependence, Lock-In, and The Local Minimum Trap

Science is widely regarded as humanity's most reliable method for uncovering truths about the natural world. Yet the trajectory of scientific discovery is rarely examined as an optimization problem in its own right. This paper argues that the body of scientific knowledge, at any given historical moment, represents a local optimum rather than a global one–that the frameworks, formalisms, and paradigms through which we understand nature are substantially shaped by historical contingency, cognitive path dependence, and institutional lock-in. Drawing an analogy to gradient descent in machine learning, we propose that science follows the steepest local gradient of tractability, empirical accessibility, and institutional reward, and in doing so may bypass fundamentally superior descriptions of nature. We develop this thesis through detailed case studies spanning mathematics, physics, chemistry, biology, neuroscience, and statistical methodology. We identify three interlocking mechanisms of lock-in–cognitive, formal, and institutional–and argue that recognizing these mechanisms is a prerequisite for designing meta-scientific strategies capable of escaping local optima. We conclude by proposing concrete interventions and discussing the epistemological implications of our thesis for the philosophy of science.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Quantum algorithms for Young measures: applications to nonlinear partial differential equations

Many nonlinear PDEs have singular or oscillatory solutions or may exhibit physical instabilities or uncertainties. This requires a suitable concept of physically relevant generalized solutions. Dissipative measure-valued solutions have been an effective analytical tool to characterize PDE behavior in such singular regimes. They have also been used to characterize limits of standard numerical schemes on classical computers. The measure-valued formulation of a nonlinear PDE yields an optimization problem with a linear cost functional and linear constraints, which can be formulated as a linear programming problem. However, this linear programming problem can suffer from the curse of dimensionality. In this article, we propose solving it using quantum linear programming (QLP) algorithms and discuss whether this approach can reduce costs compared to classical algorithms. We show that some QLP algorithms, such as the quantum central path algorithm, have up to polynomial advantage over the classical interior point method. For problems where one is interested in the dissipative weak solution, namely the expected values of the Young measure, we show that the QLP algorithms offer no advantage over direct classical solvers. Moreover, for random PDEs, there can be up to polynomial advantage in obtaining the Young measure over direct classical PDE solvers. This is a significant advantage over standard PDE solvers, since the Young measure provides a more detailed description of the solution. We also propose some open questions for future development in this direction.
Read the full abstract

All authors Shi Jin, Nana Liu, Maria Lukacova-Medvidova, Yuhuan Yuan

Information Theory

Refined Differentially Private Linear Regression via Extension of a Free Lunch Result

As data-privacy regulations tighten and statistical models are increasingly deployed on sensitive human-sourced data, privacy-preserving linear regression has become a critical necessity. For the add-remove DP model, Kulesza et al. (2024) and Fitzsimons et al. (2024) have independently shown that the size of the dataset – an important statistic for linear regression – can be privately estimated for "free", via a simplex transformation of bounded variables and private sum queries on the transformed variables. In this work, we extend this free lunch result via carefully crafted multidimensional simplex transformations to variables and functions that are bounded in the interval [0,1]. We show that these transformations can be applied to refine the estimates of sufficient statistics needed for private simple linear regression based on ordinary least squares. We provide both analytical and numerical results to demonstrate the superiority of our approach. Our proposed transformations have general applicability and can be readily adapted for differentially private polynomial regression.
Read the full abstract

Algebraic Topology

Computing Homomorphisms of Poset Representations with Applications to Multiparameter Persistence

We present algorithms to compute the vector space of homomorphisms Hom(X,Y) between finitely generated representations of the partially ordered set Z^d. Our results generalise to any partially ordered set. Our main theoretical contribution is a uniqueness result for lifts of homomorphisms along free resolutions, which we use to obtain an algorithm running in O(n^4 (thick(Y) + thick(Omega^1 Y))^2 + T_ker(d,n)) time, where thick(Y) denotes the maximal pointwise dimension of Y and T_ker is the time it takes to compute the kernel of a map between projective Z^d-modules. We also apply and analyse a classical approach due to Green, Heath, and Struble (J. Symbolic Comput., 2001), achieving O(n^3 thick(Y)^3 + n^4). Both improve on the naive O(n^6) bound when thick(Y) is small. Applied to the decomposition algorithm AIDA (Dey-J-Kerber, SoCG '25), the classical approach improves the asymptotic runtime the most, strengthening the result of Dey and Xin (J. Appl. Comput. Topology, 2022) for uniquely graded modules. We implement all algorithms in the Persistence Algebra C++ library and benchmark them on the persistent homology of density-alpha bi-filtrations of immune-cell locations. The classical approach has the best worst-case complexity, yet for 2-parameter modules, the lifting algorithm is fastest in practice.
Read the full abstract

Statistics Theory

Spectral analysis of multivariate stationary Hawkes processes

We establish the asymptotic validity of frequency-domain inference for stationary multivariate Hawkes processes under mild conditions, bridging the gap between theory and application. By developing upper-bounds on the reduced cumulant measures from the cluster representation of the Hawkes processes, we prove a functional central limit theorem and, as a consequence, consistency of the Whittle estimator under stationarity alone (i.e., the spectral radius of the interactions matrix $\rho(\boldsymbol\nu)<1$), applicable to Hawkes processes with heavy-tailed mutual-excitation kernels. Under mild extra moment conditions, we further obtain asymptotic normality with an explicit limiting covariance in terms of second- and fourth-order cumulant spectral densities. We also propose a simple frequency-domain method to detect joint independence of subprocesses of a multivariate Hawkes process. The performance of the Whittle estimator and the test of independence are demonstrated via simulation studies.
Read the full abstract

All authors Yifu Tang, Conor Kresin, Boris Baeumer, Ting Wang

Information Theory

Probabilistic Gradient Coding via Structure-Preserving Sparsification

Gradient coding is a distributed computing technique aiming to provide robustness against slow or non-responsive computing nodes, known as stragglers, while balancing the computational load for responsive computing nodes. Among existing gradient codes, a construction based on combinatorial designs, called BIBD gradient code, achieves the best trade-off between robustness and computational load in the worst-case adversarial straggler setting. However, the range of system parameters for which BIBD gradient codes exist is limited. In this paper, we overcome these limitations by proposing two new probabilistic gradient codes, termed the Sparse Gaussian (SG) gradient code and the Expansion-Preserving (EP) gradient code. Through probabilistic constructions, the former preserves the combinatorial structure of BIBDs, while the latter preserves key spectral properties. Both codes are based on a common two-step framework: first generating a random matrix and then applying distinct sparsification procedures. The SG gradient code constructs its encoding matrix from a correlated multivariate Gaussian distribution masked by Bernoulli random variables, while the EP gradient code derives its encoding matrix from sparsified expander-like graph structures that preserve key spectral properties. Experimentally, both codes achieve worst-case error performance comparable to that of the BIBD gradient code (when such a code with the same parameters exists). Moreover, they substantially extend the feasible range of system parameters beyond BIBD and soft BIBD gradient codes, offering practical and theoretically grounded solutions for large-scale distributed computing tasks.
Read the full abstract

Optimization and Control

Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD

From adversarial robustness to multi-agent learning, many machine learning tasks can be cast as finite-sum min-max optimization or, more generally, as variational inequality problems (VIPs). Owing to their simplicity and scalability, stochastic gradient methods with constant step size are widely used, despite the fact that they converge only up to a constant term. Among the many heuristics adopted in practice, two classical techniques have recently attracted attention to mitigate this issue: Random Reshuffling of data and Richardson–Romberg extrapolation across iterates. Random Reshuffling sharpens the mean-squared error (MSE) of the estimated solution, while Richardson-Romberg extrapolation acts orthogonally, providing a second-order reduction in its bias. In this work, we show that their composition is strictly better than both, not only maintaining the enhanced MSE guarantees but also yielding an even greater cubic refinement in the bias. To the best of our knowledge, our work provides the first theoretical guarantees for such a synergy in structured non-monotone VIPs. Our analysis proceeds in two steps: (i) we smooth the discrete noise induced by reshuffling and leverage tools from continuous-state Markov chain theory to establish a novel law of large numbers and a central limit theorem for its iterates; and (ii) we employ spectral tensor techniques to prove that extrapolation debiases and sharpens the asymptotic behavior even under the biased gradient oracle induced by reshuffling. Finally, extensive experiments validate our theory, consistently demonstrating substantial speedups in practice.
Read the full abstract

Symplectic Geometry

Symplectic algebroids, groupoid Toeplitz operators and deformation quantization

We use Toeplitz operators to define a star-product on Poisson manifolds whose Poisson structure is induced by a symplectic Lie algebroid. The Toeplitz operators we consider are defined on groupoids whose algebroid can be endowed with a Heisenberg group structure on the fibers. This generalizes an approach due to Guillemin and Melrose in the symplectic case.
Read the full abstract

Analysis of PDEs

Scattering for the Klein-Gordon-Schrödinger system in three dimensions with radial data

We prove global well-posedness and scattering for the 3D Klein-Gordon-Schrödinger system for small radial data in the best known global well-posedness range $(u_0, n_0, n_1)\in L^2\times H^{ -\frac{1}{2} + \epsilon } \times H^{-\frac{3}{2} +\epsilon }$ for any $ \epsilon > 0 $. The proof uses a global-in-time iteration scheme in the adapted function spaces $U^2_\Phi$, radial Strichartz estimates, and bilinear restriction estimates.
Read the full abstract

Combinatorics

On the growth of friezes via theta functions

We prove that the infinite friezes arising from the tubes of a given cluster algebra of acyclic affine type all have the same growth coefficients. Our proof uses identities satisfied by theta functions. This generalizes previous results in affine types~$ADE$ by several groups of authors.
Read the full abstract

Combinatorics

Necklace Games

We define and give results on the game NecklaceNim NN($n$,$k$) which is PathNim PN($n$,$k$) with an additional move allowed on the end vertices. This game arises as a sub-game in the context of solving CircularNim CN($n$,$k$) when $k-2$ consecutive stacks have been depleted, therefore its solution is critical to solving CircularNim. We solve the infinite families of NN($n$,$k$) when play is allowed on at least half the stacks.
Read the full abstract