Complex Variables
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 5 March
The Teichmüller space of a closed set in the Riemann sphere is a simply connected complex Banach manifold. Its complex structure follows from Lieb isomorphism. In this paper, we show the conformal naturality of Lieb isomorphism. We then study Douady-Earle section for these Teichmüller spaces. In particular, we study the real-analyticity of Douady-Earle section for classical Teichmüller spaces. We give two explicit examples of maximal holomorphic motions over simply connected complex Banach manifolds. As an application of the real-analyticity of the Douady-Earle section for the classical Teichmüller spaces of Riemann surfaces, we prove a new result showing that a family of Jordan curves varies real-analytically over a simply connected complex Banach manifold and as quasiconformal images of the one at the basepoint, provided that a finite number of marked points on the Jordan curves vary holomorphically over the same parameter space.
Information Theory · Cross-listed from q-fin.MF
Riemannian Geometry of Optimal Rebalancing in Dynamic Weight Automated Market Makers
We show that when a dynamic-weight AMM rebalances by creating arbitrage opportunities, the per-step log loss is the KL divergence between successive weight vectors. The Fisher-Rao metric is therefore the natural Riemannian metric on the weight simplex. The loss-minimising interpolation under the leading-order expansion of this KL cost is SLERP (Spherical Linear Interpolation) in the Hellinger coordinates $\eta_i = \sqrt{w_i}$: a geodesic on the positive orthant of the unit sphere, traversed at constant speed. The SLERP midpoint equals the (AM+GM)/normalise heuristic of prior work (Willetts & Harrington, 2024), so the heuristic lies on the geodesic. This identity holds for any number of tokens and any magnitude of weight change; using this link, all dyadic points on the geodesic can be reached by recursive AM-GM bisection without trigonometric functions. SLERP's relative sub-optimality on the full KL cost is proportional to the squared magnitude of the overall weight change and to $1/f^2$, where $f$ is the number of interpolation steps. Under driftless GBM prices, the fractional value loss from each weight update is price-independent, and the cross term between weight and price changes telescopes, so the constant-price geometry carries over. LVR exposure introduces a finite optimal step count $f^*$, which lies in the perturbative regime where SLERP remains near-optimal.
Read the full abstract
Numerical Analysis
Approaching the optimal closure: equivariance, inductive bias, and Reynolds-number generalization in data-driven LES
Data-driven closures for large-eddy simulation (LES) are commonly built to respect the symmetries of the Navier–Stokes equations, on the premise that this improves accuracy and generalization. We test this premise in a controlled comparison of three data-driven LES closures that share a pointwise, Galilean-invariant velocity-gradient construction but span non-equivariant, octahedral-equivariant, and tensor-basis designs: an unconstrained multi-layer perceptron (MLP), a group-convolutional network whose exactly equivariant weights we synthesize in closed form, and a tensor-basis neural network (TBNN). The designs follow from an analysis of which symmetries survive discretization on a uniform grid, where the continuous orthogonal group reduces to the 48-element octahedral group. Across a range of network sizes the three closures saturate to the same a priori and a posteriori accuracy, and a direct conditional-mean estimate identifies the a priori floor as the one-point optimal closure of Langford and Moser. The equivariant and tensor-basis models reach this floor with $25$ times fewer parameters than the MLP: the inductive bias buys parameter efficiency rather than a lower error floor. Finally, we train the closures across several viscosities and supply the global filter-scale Reynolds number $\operatorname{Re}_\Delta = \Delta^2 \| \nabla \bar{u} \| / \nu$ as an input, a scaling-invariant feature dictated by the same symmetry analysis. The closures then generalize across Reynolds number: they hold their dissipation calibration at held-out viscosities and filter ratios where Reynolds-blind closures mis-dissipate, and partially correct it on an out-of-distribution Taylor–Green flow. Reynolds-number generalization is thus largely a calibration that the right input feature supplies.
Read the full abstract
Probability
Dyson Brownian motion on a Jordan curve
Zabrodin recently proposed a generalization of Dyson Brownian motion to a setting where the particles are confined to a smooth Jordan curve in the plane. In this paper, we discuss a rigorous construction of such a process on a rectifiable Jordan curve and study some of its basic properties. Under further smoothness assumptions, we derive the associated Fokker-Planck-Kolmogorov equation, prove convergence towards the stationary Coulomb gas distribution, study large deviations at low temperature, and derive the limiting mean-field McKean–Vlasov equation in the many-particle limit.
Read the full abstract
Probability
Maximum of sparsely equicorrelated Gaussian fields and applications
We investigate the extreme values of a sparse and equicorrelated Gaussian field on a triangle: the correlations on every vertical or horizontal line are all equal to a parameter $r \in [0,1/2]$ and are zero everywhere else. This problem is closely linked with various problems in high-dimensional statistics and extreme-value theory. We identify the threshold for $r$ at which the standard Gumbel law breaks down. Our result is based on a subtle application of the Chen-Stein method for Poisson approximation. As applications, we discuss the implication of our results on multiple testing and resolve several questions that were left open in \cite{heiny2024maximum}, \cite{tang2022asymptotic} and \cite{Jiang19}.
Read the full abstract
Combinatorics
Andrews–Gordon type identities with parity restrictions through particle motion
In this paper, we use the particle motion bijection introduced by Warnaar and developed by the two authors, Jouhet and Konan, to study q-series and partition identities of the Andrews–Gordon type with parity restrictions. These restrictions are of the type “even (resp. odd) parts appear an even number of times". We prove $q$-series identities where a multisum equals a sum of products, which generalise identities of Andrews and Kim–Yee in a similar way that Stanton's identities generalised the Andrews–Gordon identities. As a consequence of our results, we obtain a simple proof of a recent identity of Chern–Li–Stanton–Xue–Yee related to Ariki–Koike algebras.
Read the full abstract
Analysis of PDEs
Besov regularity of solutions to the Dirichlet problem for the Bessel $(p,s)$-Laplacian
We study the Dirichlet problem for a class of fractional $p$-Laplacian operators of order $s \in (0,1)$ defined through the Riesz fractional gradient, which differs fundamentally from the standard fractional $p$-Laplacian. Our analysis combines the framework of Lions-Calderón spaces, Besov embeddings, and an adaptation of Nirenberg's difference quotient method, originally developed by Savaré, to the fractional Riesz setting. As a main result, we establish global Besov regularity estimates for weak solutions. Concretely, in the superquadratic regime $p \geq 2$, we prove $u \in \dot{B}_{p,\infty}^{s+1/p}(\Omega)$ for $s \in [\frac{1}{p'},1)$, and $u \in \dot{B}_{p,\infty}^{s+\frac{s}{p-1}}(\Omega)$ for $s \in (0,\frac{1}{p'})$. In the subquadratic case $1<p<2$, we show $u \in \dot{B}_{p,\infty}^{s+1/2}(\Omega)$ for $s \in [\frac{1}{2},1)$, and $u \in \dot{B}_{p,\infty}^{2s}(\Omega)$ for $s \in (0,\frac12)$, with quantitative bounds depending on the source data.
Read the full abstract
Algebraic Geometry
On Ehrhart theory for tropical vector bundles
The notion of a tropical vector bundle on a toric variety was recently introduced by Khan-Maclagan and Kaveh-Manon. In this paper, we study the Euler characteristic and rank of global sections for tropical vector bundles. We associate a convex chain (a finite integer linear combination of indicator functions of convex polytopes) to a tropical vector bundle encoding its Euler characteristic. We then see that the Khovanskii-Pukhlikov theory of convex chains gives a combinatorial Hirzebruch-Riemann-Roch theorem for tropical vector bundles. This, in particular, applies to toric vector bundles. Also, we extend Klyachko's resolution of a toric vector bundle by split toric vector bundles to tropical vector bundles. As shown by Kaveh-Manon, every matroid comes with a tautological tropical vector bundle. We answer positively a question posed by Kaveh-Manon about equality of Euler characteristic with rank of space of global sections (in other words, vanishing of higher cohomologies) for the tautological bundle of a matroid.
Read the full abstract
Numerical Analysis
Worst-case $L_p$-approximation of periodic functions using median lattice algorithms
We study the worst-case approximation of multivariate periodic functions from the weighted Korobov space $H_{d,\alpha,\boldsymbol{\gamma}}$ with smoothness $\alpha>1/2$ and weights $\boldsymbol{\gamma}$ in the Lebesgue norm $L_p([0,1]^d)$ for $1\le p\le\infty$. We analyze a median lattice algorithm that reconstructs a truncated Fourier series by approximating the coefficients on a hyperbolic-cross-type index set using $R$ rank-1 lattice sampling rules with independent randomly chosen generating vectors, and then aggregating the resulting coefficient estimators via the componentwise median. For an odd number of repetitions $R$ and an odd prime lattice size $N$, where $R$ depends logarithmically on $N$, we prove high-probability error bounds in both $L_\infty$ and $L_2$. Interpolation then yields the result for all $ p \in [1,\infty]$. In particular, with high probability, the worst-case $L_p$-error satisfies, for any $\beta>0$, an upper bound of the following form \[ \ C_{d,\alpha,\beta,\boldsymbol{\gamma},\tau,p}\,R^{\frac{1}{2}+(\frac12 - \frac1p)_+} N^{- \alpha + (\frac12 - \frac1p)_+ + \beta }, \] where $(x)_+ = \max\{x, 0\}$, and the constant $C_{d,\alpha,\beta,\boldsymbol{\gamma},\tau,p}$ is independent of $N$ and $R$. For $p=\infty$, $C_{d,\alpha,\beta,\boldsymbol{\gamma},\tau,\infty}$ is dimension-independent under the summability condition $\sum_{j=1}^\infty \gamma_j^{1/(2\alpha)}<\infty$. These results extend recent analyses of median-based lattice approximation in $L_2$ and complement related multiple-shift lattice approaches, showing that median aggregation yields nearly optimal $L_p$-approximation rates (up to logarithmic factors and an arbitrarily small loss) in weighted Korobov spaces.
Read the full abstract
Combinatorics
Hitting time for Hamilton cycles in pseudorandom graphs
Consider the random subgraph process on a base graph $G$ with $n$ vertices: we generate a sequence $\{G_t\}_{t=0}^{|E(G)|}$ by taking a uniformly random ordering of the edges of $G$ and then adding these edges one by one to the empty graph $G_0$ on the same vertex set. We prove that there is a constant $C > 0$ such that if $G$ is an $(n,d,\lambda)$-graph with $d/\lambda \ge C$, then with high probability, the hitting time for the appearance of a Hamilton cycle coincides with the hitting time for reaching minimum degree $2$. This resolves questions posed by Alon–Krivelevich in 2019 and by Frieze–Krivelevich in 2002. As a consequence, we determine the sharp threshold for Hamilton cycles in $(n,d,\lambda)$-graphs with $d/\lambda\ge C$ for all $d$ sufficiently large. Lastly, we extend our result to the minimum degree $2k$ versus $k$ edge-disjoint Hamilton cycles setting for $k \leq c\cdot \min\{d,\log n\}$ where $c$ is a constant depending on $C$. This advances on a question asked by Frieze.
Read the full abstract
Combinatorics · Cross-listed from hep-th
Gauge-string duality, monomial bases and graph determinants
Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras $\mathcal{A}$, obtained by incrementally adjoining one generator at each step to produce a non-linear generating set for $\mathcal{A}$. We define degeneracy graphs, which are finite layered tree graphs whose nodes represent projectors in the successive subalgebras. Using combinatorial properties of the degeneracy graph, we give a simple formula for constructing a linear basis of $\mathcal{A}$ in terms of monomials in the generators. The nodes can be labelled by formal variables corresponding to the eigenvalues of the generators added at each layer. We prove that the construction is compatible with the required counting of projectors in $\mathcal{A}$, and give explicit constructions of the projectors in terms of the monomials, in the cases of one- and two-layer degeneracy graphs with arbitrary numbers of nodes. More generally, we provide extensive computational evidence for the invertibility of the matrix relating the proposed monomial basis to the projector basis, by evaluating its determinant. In the 1-layer case, this is a Vandermonde determinant. A simple formula for the non-vanishing determinant in the general layer case is conjectured and supported by the computational data. The construction is illustrated with examples including centres of symmetric group algebras and maximally commuting subalgebras generated by JucysMurphy elements. We outline applications of the monomial basis to algorithms for constructing matrix units in non-commutative semisimple algebras, with relevance to orthogonal bases of multi-matrix gauge-invariant operators and to quantum information theory.
Read the full abstract
Differential Geometry
Ultralimits of Sobolev maps and stability of Dehn functions
We show that the ultralimit of a bounded sequence of Lipschitz maps into pointed metric spaces extends naturally to $p$-bounded sequences of Sobolev maps and that this ultralimit for Sobolev maps enjoys desirable properties. We use this to prove the stability of Dehn functions under ultraconvergence of pointed length spaces, thus resolving a problem posed by several researchers in the field. As an application, we obtain a simpler proof of a recent result of Stadler–Wenger, previously proved in the locally compact case by Lytchak–Wenger, characterizing spaces of curvature bounded above by $\kappa$ via an isoperimetric inequality for curves.
Read the full abstract
Differential Geometry
Estimates of eigenvalues of elliptical differential problems in divergence form
In this paper, we compute universal estimates of eigenvalues for a class of coupled systems of elliptic differential equations in divergence form on a bounded domain in Euclidean space, which includes the well-known Lamé and the Laplacian operator. Furthermore, we also give universal estimates of eigenvalues for a class of fourth-order elliptic differential problems in divergence form, which encloses the well-known bi-Laplacian operator. In both cases, as applications, we obtain the gap between consecutive eigenvalues as well as an upper bound for each eigenvalue.
Read the full abstract
Probability
Drift parameter estimation in the double mixed fractional Brownian model via solutions of Fredholm equations with singular kernels
We consider drift parameter estimation in a model driven by the sum of two independent fractional Brownian motions with different Hurst indices. Although the maximum likelihood estimator (MLE) for this model is known theoretically, its computation requires solving an operator equation involving fractional covariance operators. We develop an effective numerical method for approximating the solution of this equation by reformulating it as a Fredholm integral equation of the second kind with a weakly singular kernel. The resulting algorithm enables practical computation of the MLE. Numerical experiments illustrate the performance of the method.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Computing Scaled Relative Graphs of Discrete-time LTI Systems from Data
Graphical methods for system analysis have played a central role in control theory. The Scaled Relative Graph (SRG) has recently emerged as a useful tool for stability analysis of feedback interconnections. In this paper, we further extend its applicability by showing how the SRG of a discrete-time linear-time-invariant (LTI) system can be computed exactly from its state-space representation using linear matrix inequalities. We additionally propose a fully data-driven approach where we demonstrate how to compute the SRG exclusively from input-output data. Furthermore, we introduce a robust version of the SRG, which can be computed from noisy data trajectories and contains the SRG of the actual system.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
3d-3d correspondence and abelian flat connection
We realize a homological block of a knot complement in $S^3$ for $G_{\mathbb{C}}=SL(2,\mathbb{C})$ as a half-index of a 3d $\mathcal{N}=2$ theory via an expression of the homological block as an inverted Habiro series by working out some examples, which we expect to extend to general knots. Also, by choosing a certain set of poles in the integral expression of the half-index, we obtain the colored Jones polynomial.
Read the full abstract
Classical Analysis and ODEs
Weighted Chui's conjecture
The goals of this paper are threefold. First, we show that a counterpart of the Newman bound related to the Chui conjecture is valid in the case where the gradient of Coulomb potential is generated by arbitrary positive charges placed at the boundary of a unit ball. Second, we prove that our bound is sharp in the two-dimensional case. Finally, we discuss a related problem, where the unit charges are placed in the unit disc.
Read the full abstract
Information Theory · Cross-listed from eess.IV
Adaptive Sampling for Storage of Progressive Images on DNA
The short lifespan of traditional data storage media, coupled with an exponential increase in storage demand, has made long-term archival a fundamental problem in the data storage industry and beyond. Consequently, researchers are looking for innovative media solutions that can store data over long time periods at a very low cost. DNA molecules, with their high density, long lifespan, and low energy needs, have emerged as a viable alternative to digital data archival. However, current DNA data storage technologies are facing challenges with respect to cost and reliability. Thus, coding rate and error robustness are critical to scale DNA storage and make it technologically and economically achievable. Moreover, the molecules of DNA that encode different files are often located in the same oligo pool. Without random access solutions at the oligo level, it is very impractical to decode a specific file from these mixed pools, as all oligos need to first be sequenced and decoded before a target file can be retrieved, which greatly deteriorates the read cost. This paper introduces a solution to efficiently encode and store images into DNA molecules, that aims at reducing the read cost necessary to retrieve a resolution-reduced version of an image. This image storage system is based on the Progressive Decoding Functionality of the JPEG2000 codec but can be adapted to any conventional progressive codec. Each resolution layer is encoded into a set of oligos using the JPEG DNA VM codec, a DNA-based coder that aims at retrieving a file with a high reliability. Depending on the desired resolution to be read, the set of oligos as well as the portion of the oligos to be sequenced and decoded are adjusted accordingly. These oligos will be selected at sequencing time, with the help of the adaptive sampling method provided by the Nanopore sequencers, making it a PCR-free random access solution.
Read the full abstract
Combinatorics · Cross-listed from cs.CG
What induces plane structures in complete graph drawings?
This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is obeyed: any two adjacent curves do not cross, or any two non-adjacent curves cross at most once. Here, two curves are called adjacent if they share an endpoint. On the other hand, we demonstrate how to draw all curves such that any two adjacent curves cross exactly once, any two non-adjacent curves cross at least once and at most twice, and thus no two curves are disjoint. Furthermore, we analyze the emergence of disjoint curves without these mild assumptions, and characterize the plane structures in complete graph drawings guaranteed by each of the rules above.
Read the full abstract
Functional Analysis
Extending quasiconvex functions from uniformly convex sets
Let $X$ be a normed space of a finite dimension at least two, and $C\subsetneq X$ a closed convex set with nonempty interior. We are interested in extending Lipschitz quasiconvex functions on $C$ to quasiconvex functions on $X$. We show that, unlike what holds for convex functions, in general one cannot obtain Lipschitz extensions (except for trivial cases). If we require just uniformly continuous or continuous extensions, such extendability properties for $C$ are shown to be characterized by some geometric properties of $C$.
Read the full abstract
Optimization and Control
Optimization with Parametric Variational Inequality Constraints on a Moving Set Based on a Smoothing Method
This paper focuses on optimization problems constrained by Parametric Variational Inequalities (PVI) defined on a moving set. Unlike most existing works on mathematical programs with equilibrium constraints, the equilibrium constraints have parameters not only in the function but also in the related set. We show that the solution function of the PVI is Lipschitz continuous with respect to the upper-level decision variables and the solution set of the optimization problem is nonempty and bounded. Moreover, we prove that the metric regularity of the constraints holds automatically, which allows us to characterize stationary points without any additional assumptions. A Smoothing Implicit Gradient Algorithm (SIGA) is proposed based on the smoothing approximation of the PVI with a novel scheme for updating the smoothing parameter. We prove the convergence of SIGA to a stationary point and validate the efficiency of SIGA by numerical examples from synthetic problems and portfolio management with real data.
Read the full abstract
Numerical Analysis
An efficient and accurate numerical method for computing the ground states of three-dimensional rotating dipolar Bose-Einstein condensates under strongly anisotropic trap
In this article, we propose an efficient and spectrally accurate numerical method to compute the ground states of three-dimensional (3D) rotating dipolar Bose-Einstein condensates (BEC) under strongly anisotropic trapping potentials.The kernel singularity, convolution non-locality and density anisotropy together complicate the dipolar potential evaluation. The fast rotation mechanism not only induces a complicated energy landscape with many local minima, but also creates a large number of vortices in the condensates. Such factors collectively make the ground state computation challenging in terms of convergence, accuracy and efficiency, especially for 3D anisotropic systems. Coupled with Fourier spectral discretization, we proposed a preconditioned conjugate gradient method (PCG) by integrating the anisotropic truncated kernel method (ATKM) for the dipolar potential evaluation. An adaptive step size control strategy is designed and ATKM allows for a spectral accuracy without introducing any extra anisotropy-dependent memory requirement or computational time. Our algorithm is spectrally accurate, highly efficient and memory-economic. Extensive numerical results are presented to confirm the accuracy and efficiency, together with applications to study impacts of the model parameters on critical rotational frequency, energies and chemical potential. Furthermore, these simulations reveal additional novel ground state patterns, such as bent vortices.
Read the full abstract
Probability
Regularization of the superposition principle: Potential theory meets Fokker-Planck equations
For a solution to a (possibly nonlinear) Fokker-Planck equation (FPE) the powerful superposition principle renders a probability measure on path space with one dimensional time marginals equal to this solution, and additionally solving the martingale problem for the Kolmogorov operator given by the FPE. The superposition principle thus reveals that such parabolic PDEs have a probabilistic counter part. The aim of this work is to go a substantial further step and, by exploiting the superposition principle, construct a full fledged Markov process, i.e. a family of path space measures for a large set of space time starting points connected by the Markov property, associated to the (linearized) FPE in the above way. Under very general (merely measurability) conditions on the coefficients of the FPE this is achieved in this paper in such a way that the resulting process is a right process, which is a particularly useful class of Markov processes, enjoying among other regularity properties the strong Markov property, which is fundamental for the analysis of the underlying FPE as a (nonlinear) parabolic PDE by probabilistic tools. As two main applications we construct fundamental flow solutions for the FPE and we prove a well-posedeness result for the parabolic Dirichlet problem through probabilistic means for more general coefficients than could be treated in the existing literature. Furthermore, we introduce a Choquet capacity for such FPEs using the corresponding right process. The validity of the strong Markov property in the context of the superposition principle was an open problem even in the linear case. In this paper we solve this also in the nonlinear case, i.e. for path laws of solutions to McKean-Vlasov SDEs with Nemytskii type coefficients. A main application here is the FPE given by the generalized porous media equation and its corresponding McKean-Vlasov SDE.
Read the full abstract
Mathematical Physics
Quantum "Twin Peaks" or Path Integrals in the Future Light Cone
By analogy with the Wiener measure on the Euclidean plane that is invariant under the group of rotations and quasi-invariant under the group of diffeomorphisms, we construct the path integrals measure that is invariant under the Lorentz group and quasi-invariant under the group of diffeomorphisms. The correspondence between the paths in the future cone of the Minkowskian plane and the paths in the coverings of the Euclidean plane is established.
Read the full abstract
Functional Analysis
Complete Nevanlinna-Pick property of $\mathbb K$-Invariant Reproducing Kernels
Let $\Omega$ be a Cartan domain and $K = \sum_{\underline s}a_{\underline s}K_{\underline s}$ be a $\mathbb K$-invariant kernel on $\Omega$. In this article, we first obtain a necessary condition on $K$ to have the complete Nevanlinna-Pick property in terms of the sequence $\{a_{\underline s}\}_{\underline s}$ with the assumption that each $a_{\underline s}$ is non-zero and $K$ is non-vanishing. This generalizes the well-known Kaluza's Lemma in the context of $\mathbb K$-invariant kernels. The notion of the characteristic function of the classical Sz.-Nagy–Foias Theory is extended to a commuting tuple of $\frac{1}{K}$-contraction where $K$ is an irreducible $\mathbb K$-invariant kernel. An explicit construction of the characteristic function of a $\frac{1}{K}$-contraction is provided. A characterization of a $\mathbb K$-invariant kernel with the complete Nevanlinna-Pick property is obtained via the existence of characteristic functions associated with $\frac{1}{K}$-contractions.
Read the full abstract
Probability
New Berry-Esseen bounds for parameter estimation of Gaussian processes observed at high frequency
The purpose of this paper is to estimate the limiting variance of asymptotically stationary Gaussian processes observed at high frequency, using the second moment estimator (SME). We study rates of convergence of the central limit theorem for the SME in terms of the total variation, Kolmogorov and Wasserstein distances, using some novel techniques and sharp estimates for cumulants. We apply our approach to provide Berry-Esseen bounds in Kolmogorov and Wasserstein distances for estimators of the drift parameters of Gaussian Ornstein-Uhlenbeck processes. Moreover, we prove that most of our estimates are strictly sharper than the ones obtained in the existing literature.
Read the full abstract
Metric Geometry
The Minkowski problem of $p$-affine dual curvature measures
For $p\in (-\infty,0)\cup(0,1)$ and a convex body $K\subset\mathbb{R}^n$ with the origin in its interior, we construct the family of $p$-affine dual curvature measures $\mathcal{I}_p(K,\cdot)$ with respect to $K$. The affine-invariant measure $\widetilde{C}_{n-1}^{\mathrm{a}}(K, \cdot)$ given in the paper [9] is the limit case of $\mathcal{I}_p(K,\cdot)$ as $p\rightarrow 1^-$. The classical cone-volume measure is the limit case of the affine measures $2|p|\mathcal{I}_p(K,\cdot)/(n^2V(\mathrm{I}_pK))$ when $p\rightarrow 0$ and $V(K)=2$, where $\mathrm{I}_pK$ denotes the $L_p$ intersection body of $K$. The Minkowski problems for the $p$-affine dual curvature measures are proposed and studied. Specifically, we give a sufficient condition for the existence of a solution to the even Minkowski problem for $p$-affine dual curvature measure. Moreover, a necessary condition is given when $p\in (0,1)$. The smooth case of this Minkowski problem is equivalent to solving a new type of partial differential equations with respect to $p$-cosine transforms.
Read the full abstract
Number Theory
Iwasawa invariants and class number parity of multi-quadratic number fields
In this paper, based mainly on the method of Iwasawa and Kida, by studying in detail the Hasse's unit index and the ramifications of prime ideals, we obtain explicit results of Iwasawa invariants $ \lambda_{2} $ of the cyclotomic $ \Z_{2}$-extensions of number fields. In particular, under Greenberg's conjecture, we obtain an explicit formula of $ \lambda_{2} $ for imaginary multi-quadratic number fields. As an application, we give a criteria of determining class number parity of multi-quadratic number fields.
Read the full abstract
Logic · Cross-listed from cs.LO
The Complexity of the Constructive Master Modality
We introduce the semantically-defined constructive master-modality logics $\sf CK^*$ and $\sf WK^*$, extending the basic constructive modal logic $\sf CK$ and the Wijesekera-style logic $\sf WK$ obtained by impossing infallibility. Using translations between our logics and fragments of $\sf PDL$, we show that both $\sf CK^*$ and $\sf WK^*$ are EXPTIME-complete and admit an exponential-size finite model property. In particular, for their diamond-free fragment, also studied by Afshari et al. and Celoni, we establish EXPTIME-completeness, thereby settling the conjecture of Afshari et al. As an application, we embed $\sf CS4$ and $\sf WS4$ into the master-modality logics, showing that their validity problems are in EXPTIME.
Read the full abstract
General Mathematics
Analysis of the Riemann Zeta Function via Recursive Taylor Expansions
We present an unconditional proof that non-trivial zeros of the Riemann Zeta function must lie strictly on the critical line $\text{Re}(s) = 0.5$. By defining a recursive path of Taylor expansions originating from the domain of absolute convergence, we translate the zeta function towards the critical region, which is an easy-to-understand form of the analytical continuation. We then assume the existence of off-critical-line (off-line) zeros, which exist in pairs symmetric by the critical line. If the pairs are zero in value, their real and imaginary components differences should be both zero. However, we derive a contradiction against the assumption via basic logical deduction, proving the non-existence of the off-line zeros.