Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 4 March

Dynamical Systems

Competitive tumor growth modeling and optimal radiotherapy control via logistic equations

The uncontrolled proliferation of cancer cells and their interaction with healthy tissue poses a major challenge in oncology. This manuscript develops and analyzes mathematical models that describe tumor response to radiotherapy by incorporating the Linear Quadratic model for cell survival. To improve therapeutic efficiency, the theory of optimal control is introduced on a system of coupled differential equations, allowing for the comparison of constant versus optimized radiation strategies. The analytical study of these models provides insights into the expected dynamics under different treatment scenarios, while numerical simulations validate the theoretical results and highlight the benefits of optimal control in reducing tumor burden with minimized collateral damage.
Read the full abstract

All authors Javier López-Pedrares, Alba López-Rivas, Raquel Romero-Lorenzo, Jacobo Guiu-Souto, Alberto P. Muñuzuri

Mathematical Physics

Translational dynamics of diatomic molecule in magnetic quadrupole trap

We study the translational motions of homonuclear diatomic molecules prepared in their ${}^3\Sigma$ electronic states, deeply bound vibrational states, and rotational states of well-defined parity. The trapping potential arises due to the interaction of the total spin of electrons and orbital angular momentum of nuclei with the trap's quadrupole magnetic field. The translational motion of a molecule is treated classically. We examine the Hamilton equations that govern the center of mass dynamics numerically and analytically. Using data of a hydrogen molecule at the ground vibrational state, we present global dynamics using the Poincaré section method and various types of trajectories: periodic, quasi-periodic and chaotic. We prove that the Hamiltonian system governing this motion is non-integrable. The particle's orbits are confined to a bound region of space that grows with energy, but for small energies (< 1.8 K), the motion is restricted to a processing chamber (a few centimetres). Solutions of equations of motion occurring on the symmetry axis and the horizontal plane are expressed in terms of Jacobi elliptic functions.
Read the full abstract

Combinatorics

On cosmological polytopes, their canonical forms and their duals

We compute the canonical form of the cosmological polytope for any graph in terms of the dual of the shifted cosmological polytope in two different ways. On the way, we provide an explicit coordinate description of the dual of the cosmological polytope. Moreover, we construct two triangulations of the dual cosmological polytope in terms of maximal and almost maximal tubings of the underlying graph. Though the existence of the first triangulation was already suggested by Arkani-Hamed, Benincasa and Postnikov, the second is completely new and, in particular, gives rise to a new expression of the canonical form of the cosmological polytope.
Read the full abstract

All authors Anna Birkemeyer, Torben Donzelmann, Mieke Fink, Martina Juhnke

Dynamical Systems

On Cauchy problem and stability of inversion-free feedforward control of piecewise monotonic Krasnoselskii-Pokrovskii hysteresis

We consider the non-homogeneous first-order differential equation with hysteresis described by the Krasnoselskii-Pokrovskii rate-independent hysteresis operator. Existence and uniqueness of solutions as well as the boundedness of solution in response to a bounded input are proved. The global stability of the equation is also investigated. Periodic solutions and their stability are studied in addition. The differential equation under analysis constitutes the so-called inversion-free feedforward control, which was proposed for mitigating arbitrary rate-independent hysteresis effects in the actuated systems. The experimentally identified non-smooth and non-strictly monotonic hysteresis of a magnetic shape memory alloy (MSMA) actuator serves as the case study. The performed analysis is settled in a series of theorems which are illustrated by numerical examples.
Read the full abstract

Metric Geometry

On the maximal run-length function in the Lüroth expansion

Let \( \ell_n(x) \) denote the maximal run-length among the first \( n \) digits of the Lüroth expansion of \( x\in(0,1] \). While \( \ell_n(x) \) grows logarithmically, we investigate the finer multifractal properties of the exceptional set where $\ell_n(x)$ exhibits linear growth. Specifically, we establish the Hausdorff dimension of the set \[ \left\{ x \in (0,1] : \liminf_{n \to \infty} \frac{\ell_n(x)}{n} = \alpha, \; \limsup_{n \to \infty} \frac{\ell_n(x)}{n} = \beta \right\}, \] for all \( 0 \le \alpha \le \beta \le 1 \).
Read the full abstract

Combinatorics

A sign-reversing involution for the antipode of Schur functions

We resolve a question posed by Benedetti and Sagan by constructing a signreversing involution on Takeuchi's expansion that yields the antipode for the ring of symmetric functions in terms of the Schur basis.

Optimization and Control

Plug-and-Play blind super-resolution of real MRI images for improved multiple sclerosis diagnosis

Magnetic resonance imaging (MRI) is central to the diagnosis of multiple sclerosis, where the identification of biomarkers such as the central vein sign benefits from high-resolution images. However, most clinical brain MRI scans are performed using 1.5 T scanners, which provide lower sensitivity compared to higher-field systems. We propose a blind super-resolution framework to enhance real 1.5 T MRI images acquired in clinical settings, where only post-processed data are available and the degradation model is not fully known. The problem is formulated as a non-convex blind inverse problem involving the joint estimation of the high-resolution image and the blur kernel. Image regularization is handled through a Plug-and-Play strategy based on a pretrained denoiser, while suitable constraints are imposed on the blur kernel. To solve the resulting model, we design a heterogeneous alternating block-coordinate method in which the two variables are updated using different types of algorithms. Convergence properties are rigorously established. Experiments on FLAIR and SWI sequences acquired at 1.5 T show improved structural definition and enhanced visibility of clinically relevant features, with visual comparison against 3 T images.
Read the full abstract

All authors Matteo Cannas, Alice Mariottini, Luca Massacesi, Federica Porta, Simone Rebegoldi, Andrea Sebastiani

Number Theory

Lubin's conjecture for height-one $p$-adic dynamical systems over $p(p-1)$-tame extensions

We prove Lubin's conjecture for height-one commuting pairs of formal power series defined over the ring of integers $\mathcal{O}$ of finite extensions of $\mathbb{Q}_p$ whose ramification index is coprime to $p(p-1)$. For such a pair $(f, u)$, with $f$ noninvertible and $u$ invertible, we show that $(f, u)$ is a pair of endomorphisms of a formal group defined over $\mathcal{O}$. The proof relies on extracting a crystalline character of weight $1$ from the Galois set $T_f$ of $f$-consistent sequences, using it to define a $\mathbb{Z}_p$-module structure on $T_f$ for which $f$ is an endomorphism, and applying explicit functors in integral $p$-adic Hodge theory to recover the latent formal group.
Read the full abstract

Classical Analysis and ODEs

Catching jumps of metric-valued mappings with Lipschitz functions

It follows from recent results of V. Bakhtin, R. Oleinik, and the second named author that, given a metric space $\mathcal{X}$, a continuous map $\gamma\colon [a,b] \to \mathcal{X}$ is a map of bounded variation if and only if $f \circ \gamma$ is a function of bounded variation for every Lipschitz function $f\colon\mathcal{X} \to \mathbb{R}$. In this note, we show that the continuity assumption is of crucial importance: for many interesting examples of metric spaces there are no analogs of that characterization without the continuity assumption on $\gamma$. The interesting examples are: $\ell_2$, infinite metric trees, and Laakso-type spaces. However, for ultrametric spaces the said characterization holds without any continuity assumptions.
Read the full abstract

Analysis of PDEs

Liouville phenomenon for the Klein-Gordon equation in 1+1 dimensions

We study the Klein-Gordon equation in one spatial and one temporal dimension. Physically, this equation describes the wave function of a relativistic spinless boson with positive rest mass. Mathematically, this is the most elementary hyperbolic partial differential equation, after the wave equation itself. Relative to the origin, the spacetime splits according to the light cones, and we find four quarter-planes, two of which are timelike while the remaining two are spacelike. Not unexpectedly, the solutions behave quite differently in the two types of quarter-planes. It turns out that the spacelike quarter-planes exhibit a Liouville phenomenon, where insufficient growth forces the solutions to display a certain kind of symmetry, where the values on the two linear edges are in a one-to-one relation. This phenomenon shares features with the classical Liouville theorem as well as the Phragmen-Lindelof principle for harmonic functions. We obtain sharp transition from uniqueness to nonuniqueness.
Read the full abstract

Metric Geometry

The variety of group actions on all algebraic real hyperbolic spaces

For a cardinal $\kappa$, denote by $\mathbf{H}^\kappa$ the algebraic real hyperbolic space of dimension $\kappa$. For a topological group $\Gamma$, we study the set of continuous representations $\Gamma \to \operatorname{Isom}(\mathbf{H}^\kappa)$ up to continuous self-representations $\operatorname{Isom}(\mathbf{H}^\kappa)\to \operatorname{Isom}(\mathbf{H}^\kappa)$. The novelty of this work relies in considering simultaneously all cardinals, finite or infinite. We will endow this set of classes of representations with a natural topology, and show that this character variety is compact. This will also enable us to recover all previous compactifications of actions on $\mathbf{H}^n$ by certain actions on real trees for the equivariant Gromov-Hausdorff topology. A class of representations recovers in particular the homothety class of its marked length spectrum. We will define the notion of algebraic cross-ratio and prove a GNS-embedding result, enabling us to generalize some rigidity properties of the marked length spectrum. We will also introduce a notion of abstract cross-ratio, and use it to show that a wide class of groups $\Gamma$ (characterized by the existence of what we call a $3$-full action on a $\operatorname{CAT}(-1)$-space) admit at most one class of irreducible representations into $\operatorname{Isom}(\mathbf{H}^\kappa)$ whose boundedness properties are controlled by those of $(X,d)$. We will apply this to topological groups $\Gamma$ such as the isometry group $\operatorname{Isom}(\mathbf{H}^\kappa)$ itself, the automorphism group $\operatorname{Aut}(T_\omega)$ of the simplicial tree with countably infinite valency, and the automorphism group $\operatorname{PGL}_2(\mathbb{K}, \lvert\cdot \rvert)$ of the projective line over a non-Archimedean field.
Read the full abstract

Combinatorics

Asymptotics for face numbers of certain Hanner polytopes, with applications

We provide asymptotics for the number of faces of a certain family of Hanner polytopes. As a corollary, we come close to saturating the FLM inequality for a certain family of parameters.

Combinatorics

Hoffman colorability of graphs with smallest eigenvalue at least -2

In accordance with the Cameron-Goethals-Seidel-Shult Classification Theorem, we extend the characterization of Hoffman colorability of line graphs from (Abiad, Bosma, Van Veluw, 2025) to all connected graphs with smallest eigenvalue at least $-2$; we give a characterization of Hoffman colorability of generalized line graphs, and we completely classify the Hoffman colorable exceptional graphs. The 245 Hoffman colorable exceptional graphs from this classification admit a natural partial ordering, and we determine the 29 graphs that are maximal in this respect, in a way similar to the classification of maximal ($E_8$-representable) exceptional graphs as described in (Cvetković, Rowlinson, Simić, 2004). Lastly, as a byproduct and also similarly as in (loc. cit.), we determine all 39 graphs that are maximal with respect to being representable in the $E_7$ root system.
Read the full abstract

Commutative Algebra

A criterion for modules over Gorenstein local rings to have rational Poincaré series

We prove that modules over an Artinian Gorenstein local ring $R$ have rational Poincaré series sharing a common denominator if $R/\soc(R)$ is a Golod ring. If $R$ is a Gorenstein local ring with square of the maximal ideal being generated by at most two elements, we show that modules over $R$ have rational Poincaré series sharing a common denominator. By a result of \c Sega, it follows that $R$ satisfies the Auslander-Reiten conjecture. We provide a different proof of a result of Rossi and \c Sega concerning rationality of Poincaré series of modules over compressed Gorenstein local rings. We also give a new proof of the fact that modules over Gorenstein local rings of codepth at most three have rational Poincaré series sharing a common denominator, which is originally due to Avramov, Kustin and Miller.
Read the full abstract

Dynamical Systems

Topological-numerical analysis of global dynamics in the discrete-time two-gene Andrecut-Kauffman model

We conduct a topological–numerical analysis of global dynamics in a discrete-time two-gene Andrecut–Kauffman model. This model describes gene expression regulation through nonlinear interactions. We use a numerical method to construct Morse decomposition of the system across a wide range of parameters at a fixed finite resolution in the state space and in the parameter space, both spaces split into uniform rectangular grids (a technique also called "pixelation"). We obtain qualitative results by effectively computing the Conley indices of the constructed isolating neighborhoods that form the Morse decomposition. We represent the Morse decomposition and connecting orbits by a directed acyclic graph. We introduce pictograms to convey the information provided by the Conley index in an easy to understand schematic way. We show and analyze bifurcations captured using this technique. We call this method CMAD for short (Conley-Morse graphs for the Analysis of Dynamics). The main advantage of our method is that it finds isolating neighborhoods of both stable and unstable invariant sets and that it provides validated (rigorous) numerical results: we actually obtain computer assisted proof that the constructed sets are indeed isolating neighborhoods of Morse sets in a certain Morse decomposition of the system. In particular, this means that we have captured all the interesting dynamics within the analyzed range of the phase space perceived at the given finite resolution. We also conduct numerical simulations aimed at showing the location of attractors in the isolating neighborhoods found. The results demonstrate the usefulness of topological methods in understanding the global structure of dynamics at finite (coarse) resolution in an applied dynamical system depending on a few parameters, like the gene regulatory model that we analyze.
Read the full abstract

All authors Dorian Falęcki, Mikołaj Rosman, Michał Palczewski, Paweł Pilarczyk, Agnieszka Bartłomiejczyk

Numerical Analysis

Optimal convergence of local discontinuous Galerkin methods for convection-diffusion equations

The $hp$ local discontinuous Galerkin (LDG) method proposed by Castillo et al. [Math. Comp.,~71 (238): 455-478, 2002] has been shown to be an efficient approach for solving convection-diffusion equations. However, theoretical analysis indicates that, for solutions with limited spatial regularity, the method exhibits suboptimal convergence in $p$, suffering a loss of one order, comparing to numerical experiments. The purpose of this paper is to close the gap between theoretical estimates and numerical evidence. This is accomplished by establishing new approximation results for the associated Gauss-Radau projections of functions in suitable function spaces that can optimally characterize the regularity of singular solutions. We show that such a framework arises aturally and enables the study of various types of singular solutions, with full consistency between theoretical analysis and numerical results. This investigation sheds light on the resolution of the suboptimality in $p$ observed in the literature for several other types of DG schemes in different settings.
Read the full abstract

All authors Wenjie Liu, Ruiyi Xie, Li-Lian Wang, Zhimin Zhang

Dynamical Systems

Steady State Distribution and Stability Analysis of Random Differential Equations with Uncertainties and Superpositions: Application to a Predator Prey Model

We present a computational framework to investigate steady state distributions and perform stability analysis for random ordinary differential equations driven by parameter uncertainty. Using the nonlinear Rosenzweig McArthur predator prey model as a case study, we characterize the non-trivial equilibrium steady state of the system and investigate its complex distribution when the parameter probability densities are multi-modal mixture models with partially overlapping or separated components. In consequence, this application includes both, uncertainties and superpositions, of the system parameters. In addition, we present the stability analysis of steady states based on the eigenvalue distribution of the system's Jacobian matrix in this stochastic regime. The steady state posterior density and stability metrics are computed with a recently published Monte Carlo based numerical scheme specifically designed for random equation systems (Hoegele, 2026). Particularly, the simplicity of this stochastic extension of dynamic systems combined with a broadly applicable computational approach is demonstrated. Numerical experiments show the emergence of multi-modal steady state distributions of the predator prey model and we calculate their stability regions, illustrating the method's applicability to uncertainty quantification in dynamical systems.
Read the full abstract

Information Theory

Advances in List Decoding of Polynomial Codes

Error-correcting codes are a method for representing data, so that one can recover the original information even if some parts of it were corrupted. The basic idea, which dates back to the revolutionary work of Shannon and Hamming about a century ago, is to encode the data into a redundant form, so that the original information can be decoded from the redundant encoding even in the presence of some noise or corruption. One prominent family of error-correcting codes are Reed-Solomon Codes which encode the data using evaluations of low-degree polynomials. Nearly six decades after they were introduced, Reed-Solomon Codes, as well as some related families of polynomial-based codes, continue to be widely studied, both from a theoretical perspective and from the point of view of applications. Besides their obvious use in communication, error-correcting codes such as Reed-Solomon Codes are also useful for various applications in theoretical computer science. These applications often require the ability to cope with many errors, much more than what is possible information-theoretically. List-decodable codes are a special class of error-correcting codes that enable correction from more errors than is traditionally possible by allowing a small list of candidate decodings. These codes have turned out to be extremely useful in various applications across theoretical computer science and coding theory. In recent years, there have been significant advances in list decoding of Reed-Solomon Codes and related families of polynomial-based codes. This includes efficient list decoding of such codes up to the information-theoretic capacity, with optimal list-size, and using fast nearly-linear time, and even sublinear-time, algorithms. In this book, we survey these developments.
Read the full abstract

Analysis of PDEs

Linearized Stability of Non-Isolated Equilibria of Quasilinear Parabolic Problems in Interpolation Spaces

The stability of non-isolated equilibria to quasilinear parabolic problems of the form $u' = A(u)u + f(u)$ is established in interpolation spaces (and thus extending previous results relying on maximal regularity). The approach allows full flexibility in choosing the interpolation methods and requires only low regularity assumptions on the semilinear part $f$. Applications to concrete problems are presented, including the capillarity-driven Hele–Shaw problem and the fractional mean curvature flow.
Read the full abstract

Algebraic Geometry

Cobordism-valued intersection theory on $\overline{\mathcal{M}}_{0,n}$

We calculate the genus zero cobordism-valued Gromov-Witten invariants of a point by refining the string equation on $\overline{\mathcal{M}}_{0,n}$ from the Chow ring to algebraic cobordism. This gives inductive formulas for cobordism-valued psi-class intersections on $\overline{\mathcal{M}}_{0,n}$, and in particular the cobordism classes $[\overline{\mathcal{M}}_{0,n}]$, and for their images in $K$-theory. Explicit formulas are given up to $n = 8$.
Read the full abstract

Commutative Algebra

Graphs, Axial Algebras and their Automorphism Groups

We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We determine their fusion laws, prove them to be simple in almost all cases, and determine their automorphism group under some conditions on the degrees and girth of the graph. A construction of a class of these graphs with prescribed automorphism group enables us to construct for each group $G$ infinitely many simple (axial) algebras (with a fixed fusion law) such that the automorphism group of the algebra is isomorphic to $G$.
Read the full abstract

Algebraic Geometry

Existence of the minimal model program for log canonical generalized pairs

We introduce linearly decomposable (LD) generalized pairs, which serve as a workable substitute for rational decompositions in the non-NQC setting. Using LD generalized pairs, together with a refinement of special termination and Kollár-type gluing theory, we prove the existence of flips for log canonical generalized pairs without assuming the klt condition, the NQC condition, or $\mathbb Q$-factoriality. Together with the cone and contraction theorems, this yields the existence of the minimal model program for arbitrary log canonical generalized pairs.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

The projected isotropic normal distribution with applications in neuroscience

This paper is motivated by a cutting-edge application in neuroscience: the analysis of electroencephalogram (EEG) signals recorded under flash stimulation. Under commonly used signal-processing assumptions, only the phase angle of the EEG is required for the analysis of such applications. We demonstrate that these assumptions imply that the phase has a projected isotropic normal distribution. We revisit this distribution and derive several new properties, including closed-form expressions for its trigonometric moments. We then examine the distribution of the mean resultant and its square – a statistic of central importance in phase-based EEG studies. The distribution of the resultant is analytically intricate; to make it practically useful, we develop two approximations based on the well-known resultant distribution for the von Mises distribution. We then study inference problems for this projected isotropic normal distribution. The method is illustrated with an application to EEG data from flash-stimulation experiments.
Read the full abstract

Numerical Analysis

A Bi-Stage Framework for Automatic Development of Pixel-Based Planar Antenna Structures

Development of modern antennas is a cognitive process that intertwines experience-driven determination of topology and tuning of its parameters to fulfill the performance specifications. Alternatively, the task can be formulated as an optimization problem so as to reduce reliance of geometry selection on engineering insight. In this work, a bi-stage framework for automatic generation of antennas is considered. The method determines free-form topology through optimization of interconnections between components (so-called pixels) that constitute the radiator. Here, the process involves global optimization of connections between pixels followed by fine-tuning of the resulting topology using a surrogate-assisted local-search algorithm to fulfill the design re-quirements. The approach has been demonstrated based on two case studies concerning development of broadband and dual-band monopole antennas.
Read the full abstract

Numerical Analysis

Unsupervised Surrogate-Assisted Synthesis of Free-Form Planar Antenna Topologies for IoT Applications

Design of antenna structures for Internet of Things (IoT) applications is a challenging problem. Contemporary radiators are often subject to a number of electric and/or radiation-related requirements, but also constraints imposed by specifics of IoT systems and/or intended operational environments. Conventional approaches to antenna design typically involve manual development of topology intertwined with its tuning. Although proved useful, the approach is prone to errors and engineering bias. Alternatively, geometries can be generated and optimized without supervision of the designer. The process can be controlled by suitable algorithms to determine and then adjust the antenna geometry according to the specifications. Unfortunately, automatic design of IoT radiators is associated with challenges such as determination of desirable geometries or high optimization cost. In this work, a variable-fidelity framework for performance-oriented development of free-form antennas represented using the generic simulation models is proposed. The method employs a surrogate-assisted classifier capable of identifying a suitable radiator topology from a set of automatically generated (and stored for potential re-use) candidate designs. The obtained geometry is then subject to a bi-stage tuning performed using a gradient-based optimization engine. The presented framework is demonstrated based on six numerical experiments concerning unsupervised development of bandwidth-enhanced patch antennas dedicated to work within 5 GHz to 6 GHz and 6 GHz to 7 GHz bands, respectively. Extensive benchmarks of the method, as well as the generated topologies are also performed.
Read the full abstract

Dynamical Systems

Equi-Baire One Families of Möbius Transformations and One-Parameter Subgroups of $\mathrm{PSL}(2,\mathbb{C}$)

We study the Equi-Baire one property families of Möbius transformations on the Riemann sphere. For a loxodromic map $f$, we show its iterates $\{f^n\}$ form an orbitally Equi-Baire one family on the attracting basin. For a one-parameter subgroup $\{f_t \}$, we prove it is Equi-Baire one on all compact sets of $\widehat{\mathbb{C}}$ if and only if the subgroup is relatively compact in $\mathrm{SL}(2,\mathbb{C})$. This provides a dynamical characterization of the Equi-Baire one condition for Möbius families.
Read the full abstract

Information Theory

Linear codes arising from geometrical operation

We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords from a geometric point of view, interpreting them in terms of the combinatorial structure of the associated simplicial complex. This approach allows us to describe the minimum distance of the codes in terms of certain geometric features of the complex. Subsequently, we analyse how various topological operations on simplicial complexes affect the classical parameters of the codes. This study leads to the formulation of geometric criteria that make it possible to explicitly control and manipulate these parameters. Finally, as an application of the obtained results, we construct several families of optimal linear codes over F2 using these geometric methods. Thanks to the previously established geometric properties, we can precisely determine the parameters of these families.
Read the full abstract

Optimization and Control

A successive difference-of-convex method for a class of two-stage nonconvex nonsmooth stochastic conic program via SVI

We consider a class of two-stage nonconvex nonsmooth stochastic conic program, where the objective functions in both stages can contain nonsmooth terms that are functions with easily computed proximal mappings, further composed with affine mappings. This kind of problem is capable of modeling various applications. Solving these problems, however, can be challenging due to the two-stage structure with possibly large number of scenarios, the nonconvex, nonsmooth and even non-Lipschitz discontinuous terms, as well as the conic constraints. In this paper, we define a KKT point of the problem, show that it is a necessary optimality condition under mild conditions, and transform it to an equivalent nonmonotone nonsmooth two-stage stochastic variational inequality (SVI). We then propose a successive difference-of-convex (SDC) method by making use of Moreau envelope to solve it, the subproblems of which are approximately solved by the progressive hedging method for solving maximal monotone two-stage SVI. We show the rigorous convergence of our method under suitable assumptions. An extension of Markowitz's mean-variance model is provided as an application and numerical results on it demonstrate the effectiveness of the model and the SDC method.
Read the full abstract

Dynamical Systems

A variational principle for holomorphic correspondences

In this paper, we consider a dynamical system on the Riemann sphere that evolves through a set-valued map, namely a holomorphic correspondence. Analogous to the investigation of the dynamics effected by a continuous map defined on a compact metric space, wherein the concept of measure-theoretic entropy of the map and its utility in defining the pressure of a function are well-studied, we define the measure-theoretic entropy of a holomorphic correspondence and use the same to define the pressure of continuous functions. These ideas naturally lead to the formulation of a variational principle in the context of the dynamics of a holomorphic correspondence.
Read the full abstract

Differential Geometry

Topological and rigidity results for four-dimensional hypersurfaces in space forms

Exploiting the special features of four-dimensional Riemannian geometry, we derive topological and rigidity results for hypersurfaces immersed in space forms of dimension 5. First, we provide a complete description of the Weyl tensor for four-dimensional hypersurfaces, by means of which we derive a new characterization result for isoparametric hypersurfaces; then, we prove sharp topological bounds on the Weyl functional for closed, minimal hypersurfaces, involving the Euler characteristic in the case of an ambient space with constant non-negative sectional curvature. Then, inspired by a famous conjecture by Chern and the so-called second pinching problem, we find estimates for the norm of the second fundamental form in terms of the Euler characteristic in the minimal, constant scalar curvature case, under a cross-sectional area assumption. Finally, we prove some rigidity results by means of integral inequalities on the derivatives of the second fundamental form, also dealing with special curvature conditions, such as half harmonic Weyl curvature and Bach-flatness. We also extend some of the local results to the case of a locally conformally flat 5-dimensional ambient space.
Read the full abstract