Rings and Algebras
Foundations and Classification of Invariant Subalgebras of Grassmann Algebra
Mithat Konuralp Demir
This paper is a documentation of author's reseach, focusing on the topic Grassmann
Algebra spanning over July, August 2025 under mentorship provided by DRP Turkiye 2025. Grassmann
algebra is a fundamental structure in mathematics with wide-ranging applications across multiple areas of mathematics and physics. Most notably, it serves as the foundation for differential geometry, by constituting the natural setting which differential forms reside. This paper begins with presenting the defining properties of Grassmann
Algebra, outlining the working principles of the key mechanism of the
algebra, wedge product. Following that, we give an exposition of formal construction of Grassmann
algebra from free associative
algebra with the goal of emphasizing how these properties are imposed in the structure of the
algebra. The intrinsic relationship between the exterior product and the determinant is explored in Section 4. Finally, we investigate invariant subalgebras, one of the primary focuses of this paper. Here, we present a novel classification of invariant subalgebras.
Read the full abstract ▾
Number Theory
Antisymmetry of real quadratic singular moduli
Sören Sprehe
We confirm a
conjecture of Darmon–Vonk on the antisymmetry of real quadratic singular
moduli. The proof relies on a careful analysis of rigid meromorphic cocycles à la Darmon–Gehrmann–Lipnowski for the orthogonal group of a quaternion
algebra. Moreover, we prove the modularity of a generating series of Kudla–Millson divisors in the spirit of Gross–Kohnen–Zagier.
Read the full abstract ▾
Probability
Two-grid Penalty Approximation Scheme for Doubly Reflected BSDEs
Wonjae Lee and Hyungbin Park
We study penalization coupled with time discretization for decoupled Markovian doubly reflected BSDEs with obstacles \(p_b(t,X_t)\le Y_t\le p_w(t,X_t)\). The DRBSDE is approximated by a penalized BSDE with parameter \(\lambda\) and discretized by an implicit Euler scheme with step \(\Delta t\). A key difficulty is that the forward approximation used to evaluate the obstacles generates an error term that is amplified by \(\lambda\). In the single-obstacle case this amplification can be removed by the shift \(Y-p_b(t,X)\), but no analogous transformation eliminates both obstacles simultaneously; this motivates simulating the forward SDE on a finer grid \(\tilde{\Delta t}\) and projecting onto the backward grid (two-grid scheme). Under structural assumptions motivated by financial barriers we sharpen penalization rates and obtain a uniform \(O(\lambda^{-1})\) bound for the value process. We derive an explicit error bound in \((\Delta t,\tilde{\Delta t},\lambda)\) and tuning rules; for \(Z\)-independent drivers, \(\lambda\asymp \Delta t^{-1/2}\) with \(\tilde{\Delta t}=O(\Delta t/\lambda^2)\) yields the target \(O(\Delta t^{1/2})\) rate. Nonsmooth barriers/payoffs are handled via a multivariate Itô–Tanaka and local-time-on-surfaces argument. We also provide numerical experiments for a one-dimensional game put under the Black–Scholes model. The observed grid-refinement errors are consistent with the predicted \(O(n^{-1/2})\) behavior, while the penalty sweep indicates that the tested regime remains pre-asymptotic with respect to the penalty parameter.
Read the full abstract ▾
Number Theory
The unstable complex in Bruhat-Tits buildings for arithmetic groups over function fields
Gebhard Böckle and Sriram Chinthalagiri Venkata
Let $K$ be a function field in positive characteristic, $\infty$ be a fixed place of $K$ and $K_\infty$ be the completion of $K$ at $\infty$. By the work of Serre, it is well known that, for a suitable arithmetic subgroup $\Gamma \subset GL_2(K)$, the $\Gamma$-unstable region of the Bruhat-Tits tree for $GL_2(K_\infty)$ is naturally homotopy equivalent to the spherical Tits building for $GL_2(K)$. Grayson, following Quillen's ideas, generalizes this homotopy equivalence to the non-semistable part of the Bruhat-Tits building for $GL_r(K_\infty)$. Modifying the approach described by Grayson, we are also able show a similar homotopy equivalence for the $\Gamma$-unstable region, for $\Gamma \subset GL_r(K)$ a principal congruence subgroup.
Read the full abstract ▾
Analysis of PDEs
Steady States of Transport-Coagulation-Nucleation Models
Julia Delacour, Marie Doumic, Carmela Moschella et al. (+1 more)
To model the dynamics of
polymers formed through nucleation, elongated by polymerisation, shortened by depolymerisation and subject to aggregation reactions, we study a nonlinear integro-differential equation. Growth and shrinkage are described by transport terms, nucleation by a positive boundary condition, and aggregation by a Smoluchowski coagulation kernel. Our main result is the existence of steady states for the multiplicative coagulation kernel despite this kernel producing gelation in finite time for the pure coagulation equation. This is made possible by a sufficiently strong decay rate for large
polymers. Beyond the existence result, the qualitative properties of the steady states are illustrated through explicit examples and numerical experiments. The analytical results connect the growth behaviour of the transport velocity and of the coagulation kernel to the decay properties of steady states.
Read the full abstract ▾
All authors Julia Delacour, Marie Doumic, Carmela Moschella, Christian Schmeiser
Dynamical Systems · Cross-listed from cs.LG
Upper Generalization Bounds for Neural Oscillators
Zifeng Huang, Konstantin M. Zuev, Yong Xia et al. (+1 more)
Neural oscillators that originate from second-order ordinary differential equations (ODEs) have shown competitive performance in learning mappings between dynamic loads and responses of complex nonlinear structural systems. Despite this empirical success, theoretically quantifying the generalization capacities of their neural network architectures remains undeveloped. In this study, the neural oscillator consisting of a second-order ODE followed by a multilayer perceptron (MLP) is considered. Its upper probably approximately correct (PAC) generalization bound for approximating causal and uniformly continuous operators between continuous temporal function spaces and that for approximating the uniformly asymptotically incrementally stable second-order dynamical systems are derived by leveraging the Rademacher complexity framework. These bounds are further extended to the squared Wasserstein-1 distances between the probability measures of quantities of interest calculated from target causal operators and the corresponding learned neural oscillators. The theoretical results show that the estimation errors grow polynomially with respect to both MLP sizes and the time length, thereby avoiding the curse of parametric complexity. Furthermore, the derived error bounds demonstrate that constraining the Lipschitz constants of the MLPs via loss function regularization can improve the generalization ability of the neural oscillator. Numerical studies considering a Bouc-Wen nonlinear system under
stochastic seismic excitation validates the theoretically predicted power laws of the estimation errors with respect to the sample size and time length, and confirms the effectiveness of constraining MLPs'
matrix and vector norms in enhancing the performance of the neural oscillator under limited training data.
Read the full abstract ▾
All authors Zifeng Huang, Konstantin M. Zuev, Yong Xia, Michael Beer
Information Theory · Cross-listed from eess.AS
Distributed Multichannel Wiener Filtering for Wireless Acoustic Sensor Networks
Paul Didier, Toon van Waterschoot, Simon Doclo et al. (+4 more)
[This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.] In a wireless acoustic sensor network (WASN), devices (i.e., nodes) can collaborate through distributed
algorithms to collectively perform audio signal processing tasks. This paper focuses on the distributed estimation of node-specific desired
speech signals using network-wide Wiener filtering. The objective is to match the performance of a centralized system that would have access to all microphone signals, while reducing the communication bandwidth usage of the
algorithm. Existing solutions, such as the distributed adaptive node-specific signal estimation (DANSE)
algorithm, converge towards the multichannel Wiener filter (MWF) which solves a centralized linear minimum mean square error (LMMSE) signal estimation problem. However, they do so iteratively, which can be slow and impractical. Many solutions also assume that all nodes observe the same set of sources of interest, which is often not the case in practice. To overcome these limitations, we propose the distributed multichannel Wiener filter (dMWF) for fully connected WASNs. The dMWF is non-iterative and optimal even when nodes observe different sets of sources. In this
algorithm, nodes exchange neighbor-pair-specific, low-dimensional (fused) signals estimating the contribution of sources observed by both nodes in the pair. We formally prove the optimality of dMWF and demonstrate its performance in simulated
speech enhancement experiments. The proposed
algorithm is shown to outperform DANSE in terms of objective metrics after short operation times, highlighting the benefit of its iterationless design.
Read the full abstract ▾
All authors Paul Didier, Toon van Waterschoot, Simon Doclo, Jörg Bitzer, Pourya Behmandpoor, Henri Gode, Marc Moonen
Optimization and Control
Long-Run Conditional Value at Risk Reinforcement Learning
Qixin Wang, Hao Cao, Jian-Qiang Hu et al. (+2 more)
We propose a reinforcement learning method for minimizing the long-run conditional value at risk (CVaR) in Markov decision processes with finite state and action spaces. The method uses a single sample trajectory to update a
quantile estimate, a $Q$-function, and a randomized policy, without requiring knowledge of transition probabilities or cost distributions. Under appropriate conditions, we show that the estimates track their changing targets as the policy is updated and exploration decreases, even when the proportion of updates for some state and action pairs tends to zero. With a strict action gap, the policy converges to a locally optimal deterministic policy if it enters a suitable neighborhood sufficiently late. We also extend the method to an objective combining CVaR and mean cost. Numerical experiments illustrate its performance in machine replacement and energy storage and compare it with existing methods.
Read the full abstract ▾
All authors Qixin Wang, Hao Cao, Jian-Qiang Hu, Mingjie Hu, Li Xia
Functional Analysis
A Novel Two-Parameter Penalty: Relaxation Degree Analysis and Sparse Signal Recovery
Ziwei Li, Wengu Chen, Huanmin Ge et al. (+1 more)
In this article, we introduce a nonconvex two-parameter penalty function $P_{a,p}$, parameterized by $a\in(0,\infty)$ and $p\in(0,1]$, and the relaxation degree RD$_P$ for a separable nonconvex penalty function $P$. Based on $P_{a,p}$, we further propose the $P_{a,p}$ minimization framework for sparse signal recovery. This framework generalizes the TL1 minimization model established by S. Zhang and J. Xin (corresponding to the special case $p=1$) and provides a unified family of nonconvex penalty functions for sparse signal recovery. Using the sparse convex-combination technique, we establish both exact and stable sparse signal recovery under the restricted isometry property (RIP). To efficiently solve the resulting nonconvex optimization problem, we apply a modified iteratively re-weighted least squares method and the difference of convex functions
algorithm (DCA) to develop the IRLSTLp
algorithm for unconstrained $P_{a,p}$ minimization and prove some convergence results. Finally, numerical experiments compare recovery and runtime against single- and double-loop baselines, examine sensitivity to $(a,p)$, and assess the empirical correlation between RD$_{P_{a,p}}$ and recovery within the proposed family.
Read the full abstract ▾
All authors Ziwei Li, Wengu Chen, Huanmin Ge, Dachun Yang
Numerical Analysis
Error Estimates for Hyperbolic Scaling Limits of Linear Kinetic Models on Networks
Axel Klar and Yizhou Zhou
This paper studies linear discrete kinetic models on networks and their asymptotic behavior in the small Knudsen number limit. For coupling conditions at an n-edge junction under a symmetric formulation, we introduce a change of variables that reformulates the system into n independent initial-boundary value problems. The asymptotic expansions are then constructed and rigorously justified by deriving an error estimate based on the energy method.
Read the full abstract ▾
General Mathematics
A Continued-Fraction Criterion for the Flint Hills Series, and the Integer Sequences It Generates
Carlos H. Lopez Zapata
The Flint Hills series is the sum of the reciprocals of the cube of an integer times the square of the sine of that integer, taken over the positive integers, and whether it converges is a well-known open problem, tied to the irrationality measure of pi. We show that its convergence is governed entirely by an integer sequence, namely the sequence of partial quotients of the continued fraction of the reciprocal of pi. We prove that the series converges if and only if the sum of the squares of consecutive partial quotients, each divided by the corresponding convergent denominator, is finite. This transforms an analytic problem into an explicit statement about the growth of a single integer sequence, already catalogued by Sloane, and about the sequence of convergent denominators. We isolate the finite integer spikes produced by the exceptionally large partial quotient at position five, we describe the indices at which such spikes occur, and we show, using the Gauss-Kuzmin statistics of partial quotients, that for almost every real number the corresponding series converges. The reciprocal of pi is thus a single arithmetic point inside a set of measure zero.
Read the full abstract ▾
Logic
Locally $\aleph_0$-categorical theories and locally Roelcke precompact groups
Itaï Ben Yaacov and Todor Tsankov
It is well-known that Polish Roelcke precompact groups are the groups that can be represented as
automorphism groups of $\aleph_0$-categorical structures in continuous logic and that there is a precise correspondence between properties of the group and properties of the structure. The goal of this paper is to extend this correspondence to the classes of locally Roelcke precompact groups and locally $\aleph_0$-categorical structures, the latter of which we define here. We characterise locally Roelcke precompact groups in terms of their isometric actions. We define locally $\aleph_0$-categorical theories and structures, prove an appropriate version of the Ryll-Nardzewski
theorem, and identify the Polish locally Roelcke precompact groups as the
automorphism groups of such structures. In all locally $\aleph_0$-categorical structures, there is a definable metric, which we call localising, and which captures the coarse
geometric structure of the corresponding
automorphism group. We show that two locally $\aleph_0$-categorical structures are bi-interpretable if and only if their
automorphism groups are isomorphic. Finally, we show that (the unit ball of) a
Banach space is $\aleph_0$-categorical if and only if the corresponding affine space is locally $\aleph_0$-categorical (as a metric space).
Read the full abstract ▾
Functional Analysis
$(\lambda^+)$-injective Banach spaces
Tomasz Kania and Grzegorz Lewicki
In a companion paper (Studia Math., 2023), we proved for every $\lambda\in(1,2]$ the existence of a $(\lambda^+)$-injective renorming of $\ell_\infty$ that is not $\lambda$-injective, thereby establishing a~forgotten
theorem of Pełczyński in that range. The complementary range $\lambda\in(2,\infty)$ was left open. In the present paper, we resolve this remaining case: for every $\lambda>2$ we construct a
Banach space that is $(\lambda^+)$-injective but not $\lambda$-injective, completing Pełczyński's
theorem for all $\lambda>1$. The construction uses a single device: the `zero-sum' subspace $\Sigma_N(Y)\subset Z_\infty^N$, which multiplies the relative projection constant by $\mu_N=2-2/N$ while preserving non-attainment. Iterating this operation reduces the problem to the range $(1,2]$ already covered by the companion paper. Since the ambient spaces arising in the iteration are finite $\ell_\infty$-sums of $\ell_\infty$, the resulting examples may be realised as subspaces of~$\ell_\infty$. We also prove that if two
Banach spaces are each isometrically isomorphic to their own square and each is isometric to a $1$-complemented subspace of the other, then their
Banach–Mazur distance is at most $9+6\sqrt{3}$. Consequently, we obtain the estimate $\operatorname{dist}(L_\infty[0,1],\ell_\infty)\le 9+6\sqrt{3}$, thereby improving a recent result of Korpalski and Plebanek.
Read the full abstract ▾
Algebraic Geometry
Picard groups of completed period images and the Deng-Robles problem
Badre Mounda and Dongzhe Zheng
A basic problem in the geometry of degenerating period maps is to determine whether their completed images admit an intrinsic algebraic description. For polarized variations of Hodge structure over smooth quasi-projective surfaces, Deng and Robles formulated such a problem in terms of the Kato-Nakayama-Usui completion of the period image and a conjectural Proj description involving the augmented Hodge line bundle and the boundary divisor on a smooth compactification of the base. We show that the essential obstruction to this description is divisor-theoretic: it may be expressed as a Picard-generation statement on the completed mixed period image. We prove this statement when the pure period image is one-dimensional, and consequently obtain the Deng-Robles Proj description in this case.
Read the full abstract ▾
Differential Geometry
ACS Condition on Minimal Isoparametric Hypersurfaces of Positive Ricci Curvature in Unit Spheres
Niang Chen
We study the Ambrozio–Carlotto–Sharp (ACS) criterion on minimal isoparametric hypersurfaces $N^{n+1}\subset S^{n+2}$ with positive
Ricci curvature, motivated by the Schoen–Marques–Neves
conjecture on Morse index.For $g=4$ distinct principal
curvatures with multiplicities $m_1,m_2$, we prove that the pointwise ACS inequality holds if and only if $\min\{m_1,m_2\}\ge 4$. Sufficiency is obtained via a moment-relaxation technique yielding the sharp bound $4a^2$ on the quadratic part of the integrand; necessity follows from an explicit extremal configuration in the top eigenspace of the shape operator. We also verify the ACS condition for $g=3$ with $m_1=m_2\in\{4,8\}$.As a consequence, for any closed embedded minimal hypersurface $M^n$ in such an ambient
manifold, $\operatorname{index}(M)\ge \tfrac{2}{d(d-1)}\, b_1(M)$ with $d=n+3$.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Asymmetric simple exclusion process with tree-like network branches
Yuki Ishiguro and Yasunobu Ando
The asymmetric simple exclusion process (ASEP) is a fundamental
stochastic model describing asymmetric many-particle
diffusion with hard-core interactions on a one-dimensional
lattice, and has been widely applied in the study of nonequilibrium transport phenomena. Motivated by the modeling of
proton transport along oxygen networks in
proton-conducting solid
oxides, we extend the ASEP to a model defined on a one-dimensional backbone
lattice with tree-like network branches. We derive the exact stationary distribution of this network ASEP and investigate its transport properties. By considering two representative network geometries for which physical quantities can be expressed in terms of certain hypergeometric series, we elucidate how the network geometry influences transport properties.
Read the full abstract ▾
Analysis of PDEs
$\Gamma$-convergence for nonlocal phase transitions involving the $H^{1/2}$ norm and surfactants
Giuliana Fusco and Tim Heilmann
We study functionals \begin{equation*} F_\varepsilon (u,\rho) := \frac{1}{\varepsilon} \int_\Omega W(u) \, dx + \frac{1}{|\ln(\varepsilon)|} \int_\Omega \int_\Omega \frac{(u(y) - u(x))^2}{|y - x|^{N+1}} \, dy \,dx + \frac{1}{|\ln(\varepsilon)|} \int_\Omega \left| \int_\Omega \frac{(u(y) - u(x))^2}{|y - x|^{N+1}} \, dy - \rho(x) \right| \,dx \end{equation*} for a double-well potential $W$ and a nonlocal, critically scaled gradient-like term, together with a surfactant term. We show compactness in the space of $BV$ functions on $\Omega$ and the $\Gamma$-convergence to an energy given as local perimeter-type functional, depending also on the limit density of surfactant on the interface, plus the total variation of the surfactant measure away from the interface.
Read the full abstract ▾
Functional Analysis
Dunford-Pettis Multilinear Operators and Their Weak Variant on Banach Spaces
Joilson Ribeiro and Fabricio Santos
In this paper, we address broader concepts of Dunford-Pettis operators, presenting new classes and results that relate this class to others already well studied in the literature, as well as an approach outside the origin. We also investigate inclusion results and conditions for the coincidence of this class with previously studied classes and with new classes that arise throughout this work.
Read the full abstract ▾
Optimization and Control
A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems
Yubo Cai, Wenqi Zhu, Coralia Cartis et al. (+1 more)
We propose the Adaptive Levenberg-Marquardt Third-Order Newton Method (ALM-TON) method for unconstrained nonconvex optimization; to our knowledge, the framework provides the first globally convergent realization of the unregularized third-order Newton method. Unlike the standard Adaptive Regularization framework with third-order models (AR3), which enforces global behavior through a quartic term, ALMTON employs an adaptive Levenberg-Marquardt (quadratic) regularization. This choice preserves a cubic model at every iteration, so that every subproblem is a tractable semidefinite programming (SDP). Algorithmically, ALMTON follows a mixed-mode strategy: it attempts an unregularized thirdorder step whenever the cubic Taylor model admits a strict local minimizer with adequate
curvature, and activates (or increases) quadratic regularization only when needed to ensure that the model is well posed and the step is globally reliable. For the Heuristic strategy, under the stated assumptions and an exact local-minimizer oracle, we prove finite termination at an $\epsilon$-approximate first-order stationary point with $O\left(\epsilon^{-2}\right)$ worst-case evaluation complexity. Moreover, if an accepted iterate enters the stated neighborhood of a positive-definite local minimizer, subsequent nonterminal steps recover the unregularized third-order Newton recursion and its cubic local rate. Under a common post hoc terminal audit over 4,500 deterministic starts on five two-dimensional nonconvex problems, both ALMTON variants satisfy the terminal criterion on $99.91 \%$ of the instances, compared with $55.42 \%$ for the unregularized third-order Newton method. This robustness gain comes at substantial SDP cost: AR$2$ is faster, so the results support robust globalization of the unregularized cubic model rather than overall empirical superiority.
Read the full abstract ▾
All authors Yubo Cai, Wenqi Zhu, Coralia Cartis, Gioele Zardini
Number Theory
Murmurations: a case study in AI-assisted mathematics
Yang-Hui He, Kyu-Hwan Lee, Thomas Oliver et al. (+1 more)
We report the emergence of a striking new phenomenon in arithmetic, which we call murmurations. First observed experimentally through averages over large arithmetic
datasets, murmurations can be detected and analyzed using standard interpretability tools from machine learning, including principal component weightings, saliency curves, and convolutional filters. Although discovered computationally, they constitute a genuinely new and intriguing phenomenon in arithmetic that can be formulated and investigated using established tools of number theory. In particular, murmurations encode subtle information about Frobenius traces and naturally belong to the framework of arithmetic statistics. More precisely, murmurations connect to central themes surrounding the
conjecture of Birch and Swinnerton-Dyer and perspectives from random
matrix theory. In this paper, we present an overview of murmurations, contextualizing them within number theory and AI.
Read the full abstract ▾
All authors Yang-Hui He, Kyu-Hwan Lee, Thomas Oliver, Alexey Pozdnyakov
Probability
Fine asymptotics of the magnetization of the annealed dilute Curie-Weiss model
Fabian Apostel, Hanna Döring and Kristina Schubert
We consider the dilute Curie-Weiss model of size $N$, which is a generalization of the classical Curie-Weiss model in which the dependency structure between the
spins is encoded not by the complete graph but by the (directed) Erdős-Rényi graph on $N$ vertices in which every edge appears independently with probability $p(N)$. In the high-temperature regime with an external
magnetic field ($0<\beta<1,h\in\mathbb{R}$) we prove for $p^{3}N^{2}\to\infty$ sharp cumulant bounds for the magnetization under the annealed Gibbs measure, which imply a central limit
theorem with rate, moderate and large deviation principles, a concentration inequality, a normal approximation with Cramér correction and mod-Gaussian convergence.
Read the full abstract ▾
Optimization and Control · Cross-listed from q-fin.MF
Competition between DEXs through Dynamic Fees
Leonardo Baggiani, Martin Herdegen and Leandro Sanchez-Betancourt
We find an approximate Nash
equilibrium in a game between decentralized exchanges (DEXs) that compete for order flow by setting dynamic trading fees. We characterize the
equilibrium via a coupled system of partial differential equations and derive tractable approximate closed-form expressions for the
equilibrium fees. Our analysis shows that the two-regime structure found in monopoly models persists under competition: pools alternate between raising fees to deter arbitrage and lowering fees to attract noise trading and increase
volatility. Under competition, however, the switching boundary shifts from the oracle price to a weighted average of the oracle and competitors' exchange rates. Our numerical experiments show that, holding total liquidity fixed, an increase in the number of competing DEXs reduces execution slippage for strategic liquidity takers and lowers fee revenue per DEX. Finally, the effect on noise traders' slippage depends on
market activity: they are worse off in low-activity
markets but better off in high-activity ones.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.mtrl-sci
Application of dual-tree complex wavelet transform for spectra background reduction
Kazimierz Skrobas, Kamila Stefanska-Skrobas, Cyprian Mieszczynski et al. (+1 more)
This paper presents a method for background removal in experimental data processing using the Dual-Tree Complex Wavelet Transform (DTCWT). The technique is based on discrete wavelet theory (DWT) and addresses limitations of commonly used numerical approaches, such as fitting or filtering methods. Compared with
Fourier-transform-based techniques, DTCWT provides improved performance for signal extraction. The proposed method is universal and enables analysis of arbitrary data ranges without restrictions on their position in time. It satisfies key requirements of signal analysis, including signal preservation and reduction of processing bias. An
algorithm for background reduction is implemented to extract and enhance meaningful spectral information. The approach is demonstrated on two different types of spectra: X-ray powder diffraction and photoluminescence measured for the $\beta-Ga_{2}O_{3}$
crystal. Practical aspects of DWT-based processing are also discussed, including the selection of wavelet families and decomposition levels. The method is available as a software package for spectral background reduction.
Read the full abstract ▾
All authors Kazimierz Skrobas, Kamila Stefanska-Skrobas, Cyprian Mieszczynski, Renata Ratajczak
Algebraic Geometry
Ulrich bundles on smooth toric threefolds with Picard number $2$
Debojyoti Bhattacharya and Francesco Malaspina
In this paper, we study Ulrich bundles on smooth toric threefolds with Picard number$~2$, namely $\mathbb P(\mathcal O_{\mathbb P^{2}}(a_0) \oplus \mathcal O_{\mathbb P^{2}}(a_1))$. We construct resolutions and monads for Ulrich bundles of arbitrary rank, and provide explicit examples together with a complete classification of those arising as pullbacks from $\mathbb{P}^2$. As a consequence, we also show that these varieties are Ulrich wild.
Read the full abstract ▾
Numerical Analysis
A Least-Squares-Based Regularity-Conforming Neural Networks (LS-ReCoNNs) for Solving Parametric Transmission Problems
Shima Baharlouei, Jamie Taylor and David Pardo
This article focuses on solving parametric transmission problems in one and two spatial dimensions. These problems belong to a class of partial differential equations that arise in the modeling of physical systems with heterogeneous materials. They often exhibit discontinuities across interfaces and singularities at points where interfaces intersect. To address these problems, we propose a new deep learning approach named {\it{Least-Squares-Based Regularity-Conforming Neural Network (LS-ReCoNN)}}. This approach proposes a loss function that is shown to be a consistent upper bound for the energy-norm error. The method represents the solution as the sum of a principal component and a singular component. The principal component is decomposed into smooth and gradient-jump parts, which capture both the regular solution behavior and reduced regularity across interfaces in one- and two-dimensional problems. The singular component is introduced to model junction singularities and it is approximated using basis functions computed from a one-dimensional finite element
eigenvalue problem. For the principal component, a separated representation is employed, consisting of parameter-dependent coefficients and space-dependent functions. A deep neural network approximates the space-dependent functions, while the parameter-dependent coefficients are determined by a least-squares solver, where the optimal coefficients for each parameter instance are obtained online by solving a low-dimensional least-squares problem. Numerical experiments in one and two dimensions demonstrate that LS-ReCoNN effectively captures singularities while maintaining solution accuracy across a wide range of parameter values.
Read the full abstract ▾
Rings and Algebras
Locally finite varieties of nonassociative algebras
Yuri Bahturin and Alexander Olshanskii
We study locally finite varieties (=primitive classes) of linear
algebras over finite fields. We do not assume that our
algebras are associative or Lie. We are interested in the basic properties of finite
algebras in these varieties such as: nilpotence, solvability, simplicity, freeness, projectivity, and injectivity. We are also interested in the numerical estimates of the ratio of the number of
algebras with various classical properties to the total number of all
algebras of a fixed dimension $n$. Among these properties are having no proper nontrivial subalgebras or no nontrivial
automorphisms, etc.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Site-Specific Finetuning of Neural Receivers with Real-World 5G NR Measurements
Nuri Berke Baytekin, Reinhard Wiesmayr, Sebastian Cammerer et al. (+2 more)
Finetuning wireless receivers to a specific deployment scenario can yield significant error-rate performance improvements without increasing processing complexity. However, site-specific finetuning has so far only been demonstrated on synthetic channel data and lacks real-world
benchmarks. In this work, we empirically study site-specific finetuning of neural receivers using real-world 5G NR physical uplink shared channel (PUSCH) data collected with an over-the-air testbed at ETH Zurich across three scenarios: (i) a small laboratory, (ii) a large office floor, and (iii) a high-mobility outdoor environment. Our results confirm substantial error-rate performance improvements from site-specific finetuning, consistent with earlier findings based on synthetic channel data. Moreover, we demonstrate that these improvements generalize across different user-equipment hardware and deployment scenarios.
Read the full abstract ▾
All authors Nuri Berke Baytekin, Reinhard Wiesmayr, Sebastian Cammerer, Chris Dick, Christoph Studer
Group Theory
On the Maximal Size of Irredundant Generating Sets in Lie Groups and Algebraic Groups
Tal Cohen and Itamar Vigdorovich
We show the following dichotomy for a connected Lie group $G$: If $G$ is amenable, then any topologically generating set $X\subset G$ of size larger than a fixed
polynomial in the dimension of $G$ must be redundant (i.e., a proper subset of $X$ still generates $G$). If $G$ is non-amenable, then it admits arbitrarily large topologically generating sets that are irredundant, and remain irredundant even after applying Nielsen transformations. The
polynomial bound for amenable groups is obtained by reduction to finite simple groups of Lie type via strong approximation. This partially answers two
conjectures by Gelander on generation in compact Lie groups and simple algebraic groups, and moreover shows that these
conjectures are implied by the Wiegold
conjecture. The construction of large Nielsen irredundant generating sets in non-amenable groups is done by extending Minsky's work to higher rank Lie groups, exhibiting dense representations in the domain of discontinuity of the $\mathrm{Out}(F_{n})$-action on the character variety.
Read the full abstract ▾
Geometric Topology
Infinite circle patterns in the Weil-Petersson class
Wai Yeung Lam
Analogous to Weil-Petersson quasicircles, we investigate infinite circle patterns in the Euclidean plane parameterized by discrete harmonic functions of finite Dirichlet energy. The space of such circle patterns forms an infinite-dimensional
Hilbert manifold homeomorphic to the Sobolev space of half-differentiable functions on the unit circle. The
Hilbert manifold is equipped with a Riemannian metric induced from the Hessian of a
hyperbolic volume functional. We relate this Riemannian metric to the
symplectic form on the Sobolev space of half-differentiable functions via an analogue of the
Hilbert transform. Every such circle pattern induces a quasiconformal homeomorphism from the unit disk to itself, whose boundary extension belongs to the Weil-Petersson class of the universal Teichmüller space. Our results shed light on Jordan domains packed by infinite circle patterns of
hyperbolic type, a subject highlighted by He and Schramm.
Read the full abstract ▾
Optimization and Control
A Short Survey of Averaging Techniques in Stochastic Gradient Methods
K. Lakshmanan
Stochastic gradient methods are among the most widely used
algorithms for large-scale optimization and machine learning. A key technique for improving the statistical efficiency and stability of these methods is the use of averaging schemes applied to the sequence of iterates generated during optimization. Starting from the classical work on
stochastic approximation, averaging techniques such as Polyak–Ruppert averaging have been shown to achieve optimal asymptotic variance and improved convergence behavior. In recent years, averaging methods have gained renewed
attention in machine learning applications, particularly in the training of deep neural networks and large-scale learning systems. Techniques such as tail averaging, exponential moving averages, and
stochastic weight averaging have demonstrated strong empirical performance and improved generalization properties. This paper provides a survey of averaging techniques in
stochastic gradient optimization. We review the theoretical foundations of averaged
stochastic approximation, discuss modern developments in
stochastic gradient methods, and examine applications of averaging in machine learning. In addition, we summarize recent results on the finite-sample behavior of averaging schemes and highlight several open problems and directions for future research.
Read the full abstract ▾