AI for Science

We give a short and relatively elementary proof of the Hilton-Milner Theorem.

We prove that in dimension 3, Anosov flows which are $\mathbb{R}$-covered and skewed are orbit equivalent to Reeb-Anosov flows. We characterize the existence of an invariant contact form or of a Birkhoff section with a given boundary, in terms of linking numbers between two invariant signed measures. Furthermore, we prove the existence of open book decompositions with one boundary component for Reeb-Anosov flows.

We define and study a cohomology theory for the space of Jacobi $n$-point functions generated by a vertex operator (super)algebra, using precise analogues of Zhu's reduction formulas. A cochain complex $(C^{\bullet}(W), δ^{\bullet})$ is constructed whose coboundary operators are given by Zhu-type reduction maps, and whose cohomology groups $H^{n}_{J}(W)$ we call the {reduction cohomology of Jacobi forms}. We prove that the $n$-th reduction cohomology of a $V$-module $W$ is isomorphic to the space of analytic continuations of solutions to a vertex-operator-algebraic analogue of the Knizhnik-Zamolodchikov equations. We further show that Jacobi $n$-point reduction formulas are $n$-point connections on the vertex operator algebra bundle over the torus, yielding a Bott-Segal-type theorem: $H^{n}_{J}(W)$ is isomorphic to the cohomology of the space of deformed sections of the VOA bundle.

Pinching-antenna systems (PASS) improve wireless links by configuring the locations of activated pinching antennas along dielectric waveguides, namely pinching beamforming. In this paper, a novel adjustable power radiation model is proposed for PASS, where power radiation ratios of pinching antennas can be flexibly controlled by tuning the spacing between pinching antennas and waveguides. A closed-form pinching antenna spacing arrangement strategy is derived to achieve the commonly assumed equal-power radiation. Based on this, a practical PASS framework relying on discrete activation is considered, where pinching antennas can only be activated among a set of predefined locations. A transmit power minimization problem is formulated, which jointly optimizes the transmit beamforming, pinching beamforming, and the numbers of activated pinching antennas, subject to each user's minimum rate requirement. (1) To solve the resulting highly coupled mixed-integer nonlinear programming (MINLP) problem, branch-and-bound (BnB)-based algorithms are proposed for both single-user and multi-user scenarios, which is guaranteed to converge to globally optimal solutions. (2) A low-complexity many-to-many matching algorithm is further developed. Combined with the Karush-Kuhn-Tucker (KKT) theory, locally optimal and pairwise-stable solutions are obtained within polynomial-time complexity. Simulation results demonstrate that: (i) PASS significantly outperforms conventional multi-antenna architectures, particularly when the number of users and the spatial range increase; and (ii) The proposed matching-based algorithm achieves near-optimal performance, resulting in only a slight performance loss while significantly reducing computational overheads. Code is available at https://github.com/xiaoxiaxusummer/PASS_Discrete

The deepest arithmetic invariants attached to an algebraic variety defined over a number field $F$ are conjecturally captured by the integral part of its motivic cohomology. There are essentially two ways of defining it when $X$ is a smooth projective variety: one is via the $K$-theory of a regular model, the other is through its $\ell$-adic realization. Both approaches are conjectured to coincide. This paper initiates the study of motivic cohomology for global fields of positive characteristic, hereafter named $A$-motivic cohomology, where classical mixed motives are replaced by mixed Anderson $A$-motives. Our main objective is to set the definitions of the model version and the $\ell$-adic version of the integral part of $A$-motivic cohomology, using Gardeyn's notion of maximal models of $A$-motives as the analogue of regular models of varieties. Our main result states that the model version is contained in the $\ell$-adic version. As opposed to what is expected in the number field setting, we show that the two approaches do not match in general. We conclude this work by introducing the submodule of regulated extensions of mixed Anderson $A$-motives, for which we expect the two approaches to match, and solve some particular cases of this expectation.

Crowdsourced smartphone-based earthquake early warning systems recently emerged as reliable alternatives to the more expensive solutions based on scientific-grade instruments. For instance, during the 2023 Turkish-Syrian deadly event, the system implemented by the Earthquake Network citizen science initiative provided a forewarning up to 25 seconds. We develop a statistical methodology based on a survival mixture cure model which provides full Bayesian inference on epicentre, depth and origin time, and we design an efficient tempering MCMC algorithm to address multi-modality of the posterior distribution. The methodology is applied to data collected by the Earthquake Network, including the 2023 Turkish-Syrian and 2019 Ridgecrest events.

Time series anomaly detection plays a crucial role in a wide range of real-world applications. Reconstruction-based methods have become the mainstream paradigm, but they suffer from over-generalization and under-generalization problems, which are challenging to balance. To address this, we introduce multi-scale clustering to enhance reconstruction-based methods. At the representation level, we integrate the cluster center representations of normal patterns to constrain the model to target representative normal patterns for reconstruction, preventing dominance of powerful capacity and representation capability. At the anomaly criterion level, we derive anomaly confidence score based on cluster membership probability and combine it with reconstruction error, providing dual criteria for detection. Furthermore, the effectiveness of the cluster center representations and anomaly confidence score depends on the clustering performance. Accordingly, we extract neighborhood-centered representations for multi-view clustering to improve clustering performance. Extensive experiments on multiple real-world datasets from diverse application domains demonstrate the state-of-the-art performance of SCAN.

Let $B(m, n)$ be the number of ways to colour a $2m \times 2n$ grid in black and white so that, in each row and each column, half of the cells are white and half are black. Bhattacharya conjectured that the exponent of $2$ in the prime factorisation of $B(m, n)$ equals $s_2(m)s_2(n)$, where $s_2(x)$ denotes the number of $1$s in the binary expansion of $x$. We confirm this conjecture in some infinite families of special cases; most significantly, when $m$ is of the form either $2^k$ or $2^k + 1$ and $n$ is arbitrary. The proof when $m = 2^k + 1$ is substantially more difficult, and in connection with it we develop some general techniques for the analysis of inequalities between binary digit sums.

Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and $J-S(D)$ and $J-S(C)$ also have the same eigenvalues, where $J$ is the all-ones matrix. Such graphs that are not isomorphic are generalized cospectral mates. We derive tight upper bounds on the number of non-isomorphic generalized cospectral mates an oriented graph can admit, based on arithmetic criteria involving the determinant of its skew-walk matrix. As a special case, we also provide a criterion for an oriented graph to be weakly determined by its generalized skew spectrum (WDGSS), that is, its only generalized cospectral mate is its transpose. These criteria relate directly to the controllability of graphs, a fundamental concept in the control of networked systems, thereby connecting spectral characterization of graphs to graph controllability.

This paper explores a construction of the elliptic classes of the Springer resolution using the periodic Hecke module. The module is established by employing the Poincaré line bundle over the product of the abelian variety of elliptic cohomology and its dual. Additionally, we introduce the elliptic twisted group algebra, which acts on the periodic module. The construction of the elliptic twisted group algebra is such that the Demazure-Lusztig (DL) operators with dynamical parameters are rational sections. We define elliptic classes as rational sections of the periodic module, and give explicit formulas of the restriction to fixed points. Our main result shows that a natural assembly of the DL operators defines a rational isomorphism between the periodic module and the one associated to the Langlands dual root system. This isomorphism intertwines the (opposite) elliptic classes with the fixed point basis in the dual system.

We introduce a Green function and analogues of other related kernels for finite and infinite networks whose edge weights are complex-valued admittances with positive real part. We provide comparison results with the same kernels associated with corresponding reversible Markov chains, i.e., where the edge weights are positive. Under suitable conditions, these lead to comparison of series of matrix powers which express those kernels. We show that the notions of transience and recurrence extend by analytic continuation to the complex-weighted case even when the network is infinite. Thus, a variety of methods known for Markov chains extend to that setting.

We prove the method of power iteration for matrices with at most finite entries from the Levi-Civita field $\mathcal C$ under the assumption that there exists an eigenvalue with the strictly largest in absolute value complex part. In this case the weak convergence of a start vector to the eigenvector, that corresponds to the largest eigenvalue, is proven. Further, we prove that the Rayleigh quotient of the largest eigenvector also converges weakly to the corresponding eigenvalue. As a corollary, the same holds for matrices and polynomials over the Puiseux series field. In addition to that, we deliver an implementation of our method in Python.

Associated to any root datum, there is an elliptic affine Hecke algebra defined by Ginzburg, Kapranov, and Vasserot. In this study, we establish a Fourier-Mukai functor from the representation category of the elliptic affine Hecke algebra to the corresponding category associated with the Langlands dual root datum. To achieve this connection, we employ the elliptic Hecke algebra with dynamical parameters as an intermediary.

We investigate properties of spectrum of normalized Laplacian $\mathcal L$ for finite graphs over non-Archimedean ordered fields. We prove a Cheeger's inequality for first non-zero eigenvalue. Then we describe properties of the operator $\mathcal P=I-\mathcal L$, which is a generalization of transition operator. We show that Cheeger estimate $α_1\preceq \sqrt{1-h^2}$ for the second largest eigenvalue of $\mathcal P$ is crucial for investigation of the convergence of analogue of random walk to equilibrium over a non-Archimedean ordered fields. We consider examples over the Levi-Civita field.

Many seismic imaging methods use wave field extrapolation operators to redatum sources and receivers from the surface into the subsurface. We discuss wave field extrapolation operators that account for internal multiple reflections, in particular propagator matrices, transfer matrices and Marchenko focusing functions. A propagator matrix is a square matrix that `propagates' a wave-field vector from one depth level to another. It accounts for primaries and multiples and holds for propagating and evanescent waves. A Marchenko focusing function is a wave field that focuses at a designated point in space at zero time. Marchenko focusing functions are useful for retrieving the wave field inside a heterogeneous medium from the reflection response at its surface. By expressing these focusing functions in terms of the propagator matrix, the usual approximations (such as ignoring evanescent waves) are avoided. While a propagator matrix acts on the full wave-field vector, a transfer matrix (according to the definition employed in this paper)`transfers' a decomposed wave-field vector (containing downgoing and upgoing waves) from one depth level to another. It can be expressed in terms of decomposed Marchenko focusing functions. We present propagator matrices, transfer matrices and Marchenko focusing functions in a consistent way and discuss their mutual relations. In the main text we consider the acoustic situation and in the appendices we discuss other wave phenomena. Understanding these mutual connections may lead to new developments of Marchenko theory and its applications in wave field focusing, Green's function retrieval and imaging.

A method of constructing algebraic-geometric codes with many automorphisms arising from Galois points for algebraic curves is presented.

In Part I, the present authors introduced the notion of a quasi-Galois point, for investigating the automorphism groups of plane curves. In this second part, the number of quasi-Galois points for smooth plane curves is described. In particular, sextic or quartic curves with many quasi-Galois points are characterized.

Let $G$ be a cyclic $p$-group or generalized quaternion group, $X\in π_0 S_G$ be a virtual $G$-set, and $V$ be a fixed point free complex $G$-representation. Under conditions depending on the sizes of $G$, $X$, and $V$, we construct a self map $v\colonΣ^V C(X)_{(p)}\rightarrow C(X)_{(p)}$ on the cofiber of $X$ which induces an equivalence in $G$-equivariant $K$-theory. These are transchromatic $v_{1,\vec{0}}$-self maps, in the sense that they are lifts of classical $v_1$-self maps for which the telescope $C(X)_{(p)}[v^{-1}]$ can have nonzero rational geometric fixed points.