Results 111 to 120 of about 449 (213)
On computing local monodromy and the numerical local irreducible decomposition
Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source
Birational geometry of Fano fibrations
An algebraic variety is called rationally connected if two generic points can be connected by a curve isomorphic to the projective line. The output of the minimal model program applied to rationally connected variety is variety admitting Mori fiber ...
Krylov, Igor
core
On the additive image of zeroth persistent homology
Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
Rational points on even‐dimensional Fermat cubics
Abstract We show that even‐dimensional Fermat cubic hypersurfaces are rational over any field of characteristic not equal to three, by constructing explicit rational parameterizations with polynomials of low degree. As a byproduct of our rationality constructions, we obtain estimates for the number of their rational points over a number field and ...
Alex Massarenti
wiley +1 more source
AI in chemical engineering: From promise to practice
Abstract Artificial intelligence (AI) in chemical engineering has moved from promise to practice: physics‐aware (gray‐box) models are gaining traction, reinforcement learning complements model predictive control (MPC), and generative AI powers documentation, digitization, and safety workflows.
Jia Wei Chew +4 more
wiley +1 more source
ABSTRACT The main purpose of this paper is to design a fully discrete local discontinuous Galerkin (LDG) scheme for the generalized Benjamin–Ono equation. First, we prove the L2$$ {L}^2 $$‐stability for the proposed semi‐discrete LDG scheme and obtained a suboptimal order of convergence for power nonlinear flux.
Mukul Dwivedi, Tanmay Sarkar
wiley +1 more source
Sections and projections of the outer and inner regularizations of a convex body
Abstract We establish new geometric inequalities comparing the volumes of sections and projections of a convex body, whose barycenter or Santaló point is at the origin, with those of its inner and outer regularizations. We also provide functional extensions of these inequalities to the setting of log‐concave functions. Our approach relies on the recent
Natalia Tziotziou
wiley +1 more source
On the Lang–Trotter conjecture for Siegel modular forms
Abstract Let f$f$ be a genus‐two cuspidal Siegel eigenform. We prove an adelic open image theorem for the compatible system of Galois representations associated with f$f$, generalizing the results of Ribet and Momose for elliptic modular forms. Using this result, we investigate the distribution of the Hecke eigenvalues ap$a_p$ of f$f$, and obtain upper
Arvind Kumar, Moni Kumari, Ariel Weiss
wiley +1 more source
Evolution and Conceptual Insights into the Geometric Phase of Light: A Comprehensive Review
This review presents a unified account of the geometric phase of light, linking its fundamental principles to diverse manifestations in polarization, spatial, and vector modes. By connecting theoretical frameworks with key experimental realizations, it reveals a coherent physical picture that deepens understanding and stimulates new directions in ...
A. Srinivasa Rao
wiley +1 more source
Topological Graph Neural Networks: A Novel Approach for Geometric Deep Learning
This graphical abstract illustrates the Topological Graph Neural Network (TopGNN) architecture. It demonstrates a parallel processing approach where an input graph is simultaneously analyzed by a standard GNN Encoder to capture local node features and by Persistent Homology to extract global topological features (like cycles and voids), visualized as a
Amarjeet +7 more
wiley +1 more source

