Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Friday 27 March

Rings and Algebras

Semirings of formal sums and injective partial transformations

The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of two transformations corresponds to applying them independently on distinct sets, and the product corresponds to applying both transformations in parallel. In this paper, we extend this semiring to include partial transformations; the sum and product are natural generalisations. Each (partial) transformation can be viewed as a sum (over $\mathbb{N}$) of connected (partial) transformations. We generalise this idea by working in semirings of formal sums over any semiring $\mathbb{S}$. Here we consider the case where $\mathbb{S} = \mathbb{F}_2$, the binary field, and we focus on injective partial transformations, i.e. sums of chains and cycles. While no efficient algorithm for the division problem for sums of cycles in the original semiring of discrete dynamical systems is known, we give a concise characterisation of all the solutions of the division problem for sums of cycles over $\mathbb{F}_2$. We then extend this characterisation to dividing any injective partial transformations, i.e. sums of chains and cycles over $\mathbb{F}_2$.
Read the full abstract

Complex Variables

Integral Means Spectrum for the Random Riemann Zeta Function

We study the integral means spectrum associated with the analytic function whose derivative is the so-called randomized Riemann zeta-function, introduced some time ago by Bagchi. The randomized $\zeta$-function, ${\zeta}_{\mathrm{rand}}(\sigma+ih)$, is known to represent the asymptotic statistical behaviour of the random vertical shifts of the actual $\zeta$-function in the critical strip, $1/2 <\sigma\leq 1, h\in \mathbb R$, and appears in a number of recent works on the asymptotic behavior of the moments and maxima of the $\zeta$-function on short intervals along the critical axis $\sigma=1/2$. Using probability and basic analytic number theory, we show that the complex integral means spectrum of the primitive of ${\zeta}_{\mathrm{rand}}$ is almost surely of the form conjectured 30 years ago by Kraetzer, for the so-called universal integral means spectrum of univalent functions in the disc. The Riemann $\zeta$-function and its random version have recently been rigorously related to the so-called Gaussian multiplicative chaos (GMC), initiated by Kahane 40 years ago. In the case of the holomorphic multiplicative chaos on the unit disc – an important stochastic object closely related to Liouville quantum gravity on the unit circle – we prove that the integral means spectrum of the primitive is almost surely also of the same Kraetzer form. However, we establish that neither the primitive of the random function ${\zeta}_{\mathrm{rand}}$, nor that of the holomorphic GMC are injective. Building on earlier work by one of the authors and Webb on the convergence of Riemann $\zeta$-function on the critical line to a holomorphic GMC distribution, we finally provide an alternative derivation of the integral means spectrum for the random Riemann $\zeta$-function.
Read the full abstract

Optimization and Control

The adjoint state method for parametric definable optimization without smoothness or uniqueness

We establish that nonconvex definable parametric optimization problems with possibly nonsmooth objectives, inequality constraints, conic constraint systems, and non-unique primal and dual solutions admit an adjoint state formula under a mere qualification condition. The adjoint construction yields a selection of a conservative field for the value function, providing a computable first-order object without requiring differentiation of the solution mapping. Through examples, we show that even in smooth problems, the formal adjoint construction fails without conservativity or definability, illustrating the relevance of these concepts to grasp theoretical aspects of the method. This work provides a tool which can be directly combined with existing primal-dual solvers for a wide range of parametric optimization problems.
Read the full abstract

Group Theory

Local-global principles for the existence of Levi factors

We discuss local-global principles for the existence of Levi factors (i.e., complements to the unipotent radical) for linear algebraic groups over one-variable function fields. We give examples of disconnected groups that fail the local-global principle, and prove a strong local-global principle in the presence of Levi descent.
Read the full abstract

Algebraic Geometry

Toolkit for the algebraic geometer

In this text, we outline a theory of schemes associated with a site, which generalizes a variety of geometries, such as manifolds, schemes, analytic spaces, simplicial complexes, and more. We present an abstract process of gluing model spaces via sheaf theory and recover a posteriori the underlying topological spaces that are often present in the construction of such geometric objects. We apply this formalism to semiring schemes and reason why the usual definition of semiring schemes has to be considered as the good approach to the geometry of semirings.
Read the full abstract

All authors Sourayan Banerjee, Oliver Lorscheid, Alejandro Martínez Méndez, Alejandro Vargas

Analysis of PDEs

Mixed-dispersion Schrödinger equations and Gagliardo-Nirenberg inequalities: equivalence between ground states and optimizers

We study a nonlinear Schrödinger equation with mixed dispersion in the mass competition regime, namely mass-supercritical for the Laplacian and mass-subcritical for the Bilaplacian. In this setting, the existence of a critical value of the mass $c_\varepsilon$, which divides existence and nonexistence of energy ground state solutions, was established in [Bonheure, Castéras, dos Santos, Nascimento, SIAM J. Math. Anal. 50 (2018)]. In this work, we strengthen these results by investigating the relationship between the energy ground states with critical mass, and the optimizers of mixed Gagliardo-Nirenberg-type inequalities. Moreover, we discuss the equivalence between energy and action ground states solutions.
Read the full abstract

Algebraic Geometry

The motivic tt-geometry of real quadrics

We study the tensor-triangular geometry of the category of Voevodsky motives generated by real quadrics. At the prime 2, we determine its Balmer spectrum, and find that it is a countably infinite, non-Noetherian space of Krull dimension 2. We detail the relationship between this space, the real Artin-Tate spectrum computed by Balmer-Gallauer, and Vishik's isotropic points. We conclude by combining our computation with Balmer-Gallauer's results on Artin-Tate motives to obtain a full description of the spectrum of integral motives of quadrics over real algebraic numbers.
Read the full abstract

Logic

Speedability of computably approximable reals and their approximations

An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is computable and has bounded variation. A real is computably approximable if it has some computable approximation, and left-c.e. and d.c.e. reals are defined accordingly. An approximation $\{a_s\}_{s \in \omega}$ is speedable if there exists a nondecreasing computable function $f$ such that the approximation $\{a_{f(s)}\}_{s \in \omega}$ converges in a certain formal sense faster than $\{a_s\}_{s \in \omega}$. This leads to various notions of speedability for reals, e.g., one may require for a computably approximable real that either all or some of its approximations of a specific type are speedable. Merkle and Titov established the equivalence of several speedability notions for left-c.e. reals that are defined in terms of left-c.e. approximations. We extend these results to d.c.e. reals and d.c.e. approximations, and we prove that in this setting, being speedable is equivalent to not being Martin-Löf random. Finally, we demonstrate that every computably approximable real has a computable approximation that is speedable.
Read the full abstract

All authors George Barmpalias, Nan Fang, Wolfgang Merkle, Ivan Titov

Representation Theory · Cross-listed from cs.LG

Foundation Model for Cardiac Time Series via Masked Latent Attention

Electrocardiograms (ECGs) are among the most widely available clinical signals and play a central role in cardiovascular diagnosis. While recent foundation models (FMs) have shown promise for learning transferable ECG representations, most existing pretraining approaches treat leads as independent channels and fail to explicitly leverage their strong structural redundancy. We introduce the latent attention masked autoencoder (LAMAE) FM that directly exploits this structure by learning cross-lead connection mechanisms during self-supervised pretraining. Our approach models higher-order interactions across leads through latent attention, enabling permutation-invariant aggregation and adaptive weighting of lead-specific representations. We provide empirical evidence on the Mimic-IV-ECG database that leveraging the cross-lead connection constitutes an effective form of structural supervision, improving representation quality and transferability. Our method shows strong performance in predicting ICD-10 codes, outperforming independent-lead masked modeling and alignment-based baselines.
Read the full abstract

All authors Moritz Vandenhirtz, Samuel Ruipérez-Campillo, Simon Böhi, Sonia Laguna, Irene Cannistraci, Andrea Agostini, Ece Ozkan, Thomas M. Sutter, Julia E. Vogt

Dynamical Systems · Cross-listed from cs.LG

Automatic feature identification in least-squares policy iteration using the Koopman operator framework

In this paper, we present a Koopman autoencoder-based least-squares policy iteration (KAE-LSPI) algorithm for reinforcement learning (RL). The KAE-LSPI algorithm is based on reformulating the so-called least-squares fixed-point approximation method in terms of extended dynamic mode decomposition (EDMD), thereby enabling automatic feature learning via the Koopman autoencoder (KAE) framework. The approach is motivated by the lack of a systematic procedure for selecting features or kernels in linear RL techniques. Unlike previous approaches, no features or kernels need to be fixed a priori in our method. We discuss the theoretical convergence of KAE-LSPI under suitable assumptions, similar to kernel-based least-squares policy iteration (KLSPI). We empirically compare our method with two existing algorithms: least-squares policy iteration (LSPI) and KLSPI. In particular, for the chainwalk problem, the resulting policies are either optimal or nearly optimal for both three approaches. For the cart-pole system, KAE-LSPI outperforms the other two approaches in terms of policy performance.
Read the full abstract

Statistics Theory

The relative value of interventional and observational samples in Bayesian Causal Linear Gaussian Models

We investigate the asymptotic properties of Bayesian bivariate causal discovery for Gaussian Linear Structural Equation Models (SEMs) with heteroscedastic noise. We demonstrate that with purely observational data, the posterior distribution over the models fails to consistently identify the true causal structure - a consequence of the fundamental non-identifiability within the Markov Equivalence Class. Specifically, if the true generating mechanism corresponds to a connected graph (A -> B or B -> A), the asymptotic behavior of the posterior is given by the ratio between the prior on the true model and the push-forward prior of the alternative. In contrast, for the independence model, we establish that the posterior concentrates at a stochastic polynomial rate of O_p(n^{-1/2}). To resolve this non-identifiability, we incorporate m interventional samples and characterize the concentration rates as a function of the observational-to-total sample ratio, \eta. We identify a sharp concentration dichotomy: while the independence graph maintains a polynomial O_p(N^{-1/2}) rate (where N = n+m), connected graphs undergo a phase transition to exponentially fast convergence. This highlights an exponential relative importance between the two data types, as altering the amount of one data type directly changes the exponent governing the concentration speed. We derive explicit formulae for the exponential decay rates and provide precise conditions under which mixing observational and interventional data optimizes concentration speed. Finally, our theoretical findings are validated through empirical simulations in Bayesian Gaussian equivalent (BGe)-style prior specifications offering a principled foundation for experimental design in Bayesian causal discovery.
Read the full abstract

All authors Valentinian Lungu, Anish Dhir, Mark van der Wilk, Ioannis Kontoyiannis

Mathematical Physics

Magnetic Weyl Super Calculus: Schatten-class properties, commutator criterion, and complete positivity

We combine our previous results on magnetic pseudo-differential operators for Hörmander symbols dominated by tempered weights [arXiv:2511.07184] with the magnetic Weyl super calculus of Lee and Lein [arXiv:2201.11487, arXiv:2405.19964]. This allows us to extend some previous results on the semi-super and super Moyal algebra, as well as to prove boundedness, compactness, and Schatten-class properties of super operators. Moreover, we prove a Beals-type commutator criterion for super operators and we also formulate sufficient conditions on super symbols in order to give rise to completely positive and trace preserving maps. For most of the proofs we use decompositions of operators and super operators based on Parseval frames of smoothing operators.
Read the full abstract

Representation Theory

The Schwartz space for the $ (k, a) $-generalized Fourier transform and the minimal representation of the conformal group

This paper studies an analog of the classical Schwartz space $ \mathscr{S}(\mathbb{R}^N) $ in the framework of $ (k, a) $-deformed harmonic analysis associated with the $ (k, a) $-generalized Fourier transform $ \mathscr{F}_{k, a} $. Motivated by the observation that $ \mathscr{S}(\mathbb{R}^N) $ coincides with the space of smooth vectors for the Segal–Shale–Weil representation, we define the $ (k, a) $-generalized Schwartz space $ \mathscr{S}_{k, a}(\mathbb{R}^N) $ as the space of smooth vectors for the unitary representation associated with $ \mathscr{F}_{k, a} $. Since this definition is intrinsic to the representation, it follows immediately that $ \mathscr{S}_{k, a}(\mathbb{R}^N) $ is preserved by $ \mathscr{F}_{k, a} $. As main results, we explicitly determine $ \mathscr{S}_{k, a}(\mathbb{R}^N) $ for $ N = 1 $, as well as for general $ N $ when $ k = 0 $ and $ a $ is rational. We also explicitly determine the space of smooth vectors for the $ L^2 $-model of the minimal representation of the conformal group $ \widetilde{\mathit{SO}}_0(N + 1, 2) $ studied by Kobayashi–Mano.
Read the full abstract

Optimization and Control

Towards European Hydrogen Market Design: Perspectives from Transmission System Operators

Despite hydrogen being central to Europe's decarbonisation strategy, only a small share of renewable hydrogen projects reached final investment decision. A key barrier is uncertainty about how future hydrogen markets will be designed and operated, particularly under Renewable Fuels of Non-Biological Origin requirements. This study investigates the extent to which future hydrogen market design can be adapted from existing natural gas markets, and the challenges it must address. The analysis was based on a survey on future hydrogen market design targeting European gas transmission system operators, the stakeholder group responsible for operating the network and implementing the Network Codes. The survey provided an assessment of mechanism transferability and identified challenges for the early development of the hydrogen market. Core market design principles and trading frameworks are broadly transferable from natural gas markets, as entry-exit systems and virtual trading points. Capacity allocation requires targeted adaptation to improve coupling with electricity markets. Tariffs require adaptation through intertemporal cost allocation, distributing infrastructure costs over time to protect early adopters. Balancing regimes should be revisited to reflect hydrogen's physical characteristics and different linepack flexibility usages. Key challenges for early hydrogen markets include: temporal mismatches between variable renewable supply and expected relatively stable industrial demand, limited operational flexibility due to scarce storage and reduced pipeline linepack, fragmented regional hydrogen clusters, and regulatory uncertainty affecting long-term investment decisions. These findings provide empirical input to the hydrogen Network Codes and offer guidance to policymakers designing hydrogen market frameworks.
Read the full abstract

K-Theory and Homology

Bordisms and unbounded $KK$-theory

This monograph studies $KK$-theory in its unbounded model. The central object is the $KK$-bordism group obtained by imposing the $KK$-bordism relation on unbounded $KK$-cycles. In the paradigm of noncommutative geometry, an unbounded $KK$-cycle is a noncommutative geometry in its own right and our approach allows for the study of mildly noncommutative geometries (orbifolds, foliations et cetera) as if they were closed manifolds. The techniques we introduce enable us to directly import manifold techniques and arguments into the important yet technical field of unbounded $KK$-theory. Recent decades have seen a tremendous progress in the study of the unbounded model for $KK$ as well as secondary invariants, the first motivated by refining computational tools in Kasparov's $KK$-theory and the second by applications to geometry and topology. The aim of this work is to provide a common framework for these two areas: equipping unbounded $KK$-cycles with a geometrically motivated relation recovering Kasparov's $KK$-theory that is computationally tractable for working with secondary invariants.
Read the full abstract

Spectral Theory

Resonances on geometrically finite graphs

In analogy with the spectral theory of geometrically finite hyperbolic manifolds, we initiate the study of resonances on geometrically finite (q+1)-regular graphs of groups. We prove the meromorphic continuation of the resolvent of the adjacency operator on such spaces and give a geometric characterization of the resonant states. In contrast to the hyperbolic surfaces setting, geometrically finite graphs have only finitely many resonances, and these resonances may be computed explicitly, yet they exhibit many of the same qualitative phenomena as in the hyperbolic manifolds setting. Particularly interesting examples arise from algebraic curves over finite fields.
Read the full abstract

Optimization and Control

Adjoint-Compatible Surrogates of the Expected Information Gain for Optimal Experimental Design

We consider optimal experimental design for parameter estimation in dynamical systems governed by controlled ordinary differential equations. In such problems, Fisher-based criteria are attractive because they lead to time-additive objectives compatible with adjoint-based optimal control, but they remain intrinsically local and may perform poorly under strong nonlinearities or non-Gaussian prior uncertainty. By contrast, the expected information gain (EIG) provides a principled Bayesian objective, yet it is typically too costly to evaluate and does not naturally admit an adjoint-compatible formulation. In this work, we introduce adjoint-compatible surrogates of the EIG based on an exact chain-rule decomposition and tractable approximations of the posterior distribution of the unknown parameter. This leads to two surrogate criteria: an instantaneous surrogate, obtained by replacing the posterior with the prior, and a Gaussian tilting surrogate, obtained by reweighting the prior through a design-driven quadratic information factor. We establish theoretical properties of these surrogates, including exactness of the Gaussian tilting surrogate in the linear-Gaussian setting, and illustrate their behavior on benchmark controlled dynamical systems. The results show that the proposed surrogates remain competitive in nearly Gaussian regimes and provide clearer benefits over Fisher-based designs when prior uncertainty is non-Gaussian or multimodal.
Read the full abstract

Numerical Analysis

Adaptive low-rank exponential integrators for large-scale differential Riccati equation

Matrix differential Riccati equation (DRE) typically exhibits transient and steady-state phases, posing challenges for fixed-step time integration methods, which may lack accuracy during transients or oversample in steady regimes. In this work, we propose adaptive low-rank matrix-valued exponential integrators for large-scale stiff DRE. The methods combine embedded exponential Rosenbrock-type schemes and adaptive step-size control, enabling an automatic adjustment to the evolving solution dynamics. This improves the accuracy during rapid transient phases while maintaining high accuracy in the steady state. Numerical experiments on benchmark problems demonstrate that the proposed adaptive integrators consistently improve accuracy and computational efficiency compared with fixed-step low-rank schemes.
Read the full abstract

Metric Geometry

Classical and continuous Gromov-Hausdorff distances

Starting from the definition of the Gromov-Hausdorff distance via distortion of correspondences, we add the requirement of semicontinuity of each correspondence and its inverse. It turns out that in the case of lower semicontinuity we obtain the same classical Gromov-Hausdorff distance, while for upper semicontinuity we are able to prove coincidence with the classical one only in cases where the spaces are either totally bounded or boundedly compact.
Read the full abstract

Optimization and Control

Substitution for minimizing/maximizing a tropical linear (fractional) programming

Tropical polyhedra seem to play a central role in static analysis of softwares. These tropical geometrical objects play also a central role in parity games especially mean payoff games and energy games. And determining if an initial state of such game leads to win the game is known to be equivalent to solve a tropical linear optimization problem. This paper mainly focus on the tropical linear minimization problem using a special substitution method on the tropical cone obtained by homogenization of the initial tropical polyhedron. But due to a particular case which can occur in the minimization process based on substitution we have to switch on a maximization problem. Nevertheless, forward-backward substitution is known to be strongly polynomial. The special substitution developed in this paper inherits the strong polynomiality of the classical substitution for linear systems. This special substitution must not be confused with the exponential execution time of the tropical Fourier-Motzkin elimination. Tropical fractional minimization problem with linear objective functions is also solved by tropicalizing the Charnes-Cooper's transformation of a fractional linear program into a linear program developed in the usual linear algebra. Let us also remark that no particular assumption is made on the polyhedron of interest. Finally, the substitution method is illustrated on some examples borrowed from the litterature.
Read the full abstract

Numerical Analysis

The diffuse interface approximation to fluid-structure interaction

We consider a fluid-structure interaction problem in the Eulerian, phase-field formulation. The problem is described using the Navier–Stokes equations for a viscous, incompressible fluid, coupled with the incompressible hyperelasticity system, both written in the Eulerian coordinates. This allows the problem to be written in a unified formulation, using a single field for the fluid and structure velocities. To track the position of the domain, we use a phase-field approach, resulting in a coupled Cahn–Hilliard–Navier–Stokes-type of problem for the diffuse interface fluid-structure interaction. Under certain assumptions, we prove the convergence of the diffuse interface model to the sharp interface fluid-structure interaction problem. To solve the problem numerically, we propose a novel, strongly coupled, second-order partitioned computational method where the system is decoupled into the Cahn–Hilliard problem, the transport problem for the left Cauchy–Green deformation tensor, and the Navier–Stokes problem. The problems are solved iteratively until convergence at each time step. The performance of the method is illustrated on two computational examples.
Read the full abstract

Analysis of PDEs

Steady weak solutions to an inflow/outflow driven compressible fluid-structure interaction problem

We study a stationary 3D/2D fluid-structure interaction problem between an elastic structure described by the linear plate equation and a fluid described by the compressible Navier-Stokes equations with hard-sphere pressure and inflow/outflow boundary data. This problem is motivated by wind-tunnel configuration and by the need for physically relevant steady states about which compressible flow-plate dynamics can be linearized. The main difficulty in the analysis is the lack of uniform estimates, both for approximate and weak solutions. In particular, the fixed-point construction for approximate solution yields a density estimate depending on approximate parameter, while the pressure estimate for the weak solution is only finite and non-quantifiable. As a result, large pressure loads can drive outward volume growth, while low pressure regions may lead to contact and therefore domain degeneration. This necessitates a novel approach based on a Lipschitz domain-correction (barrier) mechanism that provides a framework in which solutions can be constructed without volume blow-up or degeneration of the domain. Constrained by the possibly very large fluid pressure load, our main result is the existence of a weak solution for a sufficiently large plate stiffness. Keywords: fluid-structure interaction, compressible Navier-Stokes, stationary weak solutions, hard-sphere pressure, inflow/outflow, linear plate, mathematical aeroelasticity
Read the full abstract

All authors Boris Muha, Šárka Nečasová, Milan Pokorný, Sr{\dj}an Trifunović, Justin T. Webster

Functional Analysis · Cross-listed from stat.ML

Kantorovich–Kernel Neural Operators: Approximation Theory, Asymptotics, and Neural Network Interpretation

This paper studies a class of multivariate Kantorovich-kernel neural network operators, including the deep Kantorovich-type neural network operators studied by Sharma and Singh. We prove density results, establish quantitative convergence estimates, derive Voronovskaya-type theorems, analyze the limits of partial differential equations for deep composite operators, prove Korovkin-type theorems, and propose inversion theorems. This paper studies a class of multivariate Kantorovich-kernel neural network operators, including the deep Kantorovich-type neural network operators studied by Sharma and Singh. We prove density results, establish quantitative convergence estimates, derive Voronovskaya-type theorems, analyze the limits of partial differential equations for deep composite operators, prove Korovkin-type theorems, and propose inversion theorems. Furthermore, this paper discusses the connection between neural network architectures and the classical positive operators proposed by Chui, Hsu, He, Lorentz, and Korovkin.
Read the full abstract

Algebraic Geometry

Automorphism groups of Mori Del Pezzo fibrations over an irrational curve

We study the automorphism groups of Mori Del Pezzo fibrations over a smooth projective curve $C$ of positive genus. From that, we obtain a classification of maximal connected algebraic subgroups of $\mathrm{Bir}(C\times \mathbb{P}^2)$. Our results hold over any algebraically closed field of characteristic zero.
Read the full abstract

Optimization and Control

Random Walks with Traversal Costs: Variance-Aware Performance Analysis and Network Optimization

We introduce weighted Markovian graphs, a random walk model that decouples the transition dynamics of a Markov chain from (random) edge weights representing the cost of traversing each edge. This decoupling allows us to study the accumulated weight along a path independently of the routing behavior. Crucially, we derive closed-form expressions for the mean and variance of weighted first passage times and weighted Kemeny constants, together with their partial derivatives with respect to both the weight and transition matrices. These results hold for both deterministic and stochastic weights with no distributional assumptions. We demonstrate the framework through two applications, highlighting the dual role of variance. In surveillance networks, we introduce the surprise index, a coefficient-of-variation metric quantifying patrol unpredictability, and show how maximizing it yields policies that are both efficient and hard to anticipate. In traffic networks subject to cascading edge failures, we develop a minimal-intervention framework that adjusts speed limits to preserve connectivity under three increasingly flexible regulatory policies.
Read the full abstract

All authors Thao Le, Robbert van der Burg, Bernd Heidergott, Ines Lindner, Alessandro Zocca

Information Theory · Cross-listed from cs.CR

Cryptanalysis of a PIR Scheme based on Linear Codes over Rings

In this paper we present an attack on a recently proposed code-based Private Information Retrieval (PIR) scheme. Indeed, the server can retrieve the index of the desired file with high probability in polynomial time. The attack relies on the fact that random codes over finite rings are free with high probability and that the dimension of the rowspan of the query matrix decreases when the rows corresponding to the desired index are removed.
Read the full abstract

Complex Variables

Continuity of the complex Monge-Ampère operator on compact Hermitian manifolds

In this note, we establish several results concerning the continuity (or weak convergence) of the complex Monge-Ampère operator on compact Hermitian manifolds. At the end of this note, we find a weak solution of the complex Monge-Ampère equation on a compact Hermitian manifold under the assumption of the existence of a smooth subsolution.
Read the full abstract

Complex Variables

Continuous solutions of Dirichlet problem to Hessian type equations for $(\omega,m)-\beta$-subharmonic functions on a ball in $\mathbb{C}^n$

In this paper, we investigate the continuity of solutions to the Dirichlet problem for complex Hessian-type equations associated with $(\omega, m)-\beta$-subharmonic functions on a ball in $\mathbb{C}^n$, where $ \beta=d d^c\|z\|^2=\frac{i}{2} \sum_{j=1}^n d z_j \wedge d \bar{z}_j $ is denoted the flat metric on $\mathbb{C}^n$.
Read the full abstract

Number Theory

Arithmetic sums and products of infinite multiple zeta-star values

Multiple zeta-star values are variants of multiple zeta values which allow equality in the definition. Similar to the theory of continued fractions, every real number which is greater than $1$ can be realized as an unique infinite multiple zeta-star values in a natural way. In this paper, we investigate the arithmetic sums and products of infinite multiple zeta-star values with restricted indices. Moreover, inspired by the theory of continued fractions and Cantor set, we propose a series of conjectures concerning the algebraic points and arithmetic sums and products of infinite multiple zeta-star values with certain indices.
Read the full abstract

Combinatorics

Ascending Convex Polyominoes

Convex polyominoes can be refined according to the number of direction changes in monotone paths connecting pairs of cells, leading to the notion of $k$-convexity. In particular, the cases $k=1$ and $k=2$ correspond to $L$-convex and $Z$-convex polyominoes, two well-studied subclasses of convex polyominoes, with intermediate families such as centered and $4$-stack polyominoes. These families exhibit remarkably different combinatorial behaviours, suggesting that geometric constraints have a strong impact on the nature of the generating function: $L$-convex and centered polyominoes possess rational generating functions and growth of order $(2+\sqrt{2})^n$ and $4^n$, respectively, while $Z$-convex, 4-stack, and convex polyominoes have algebraic functions and asymptotics of order $n4^n$, $\sqrt{n}\,4^n$, and $n4^n$ respectively. In this paper we investigate the structure of $Z$-convex polyominoes by introducing a refinement based on the NW- and NE-convexity degrees, which yields a decomposition into three disjoint subclasses $C(1,2)$, $C(2,1)$, and $C(2,2)$. To enumerate these families we introduce ascending polyominoes, admitting a simple geometric characterization, and construct a generating tree that leads to functional equations for the corresponding generating functions. By solving these equations we obtain explicit algebraic generating functions and the asymptotic growth for all the subclasses.
Read the full abstract