A new approach to producing multidisciplinary lists of highly cited researchers is described and used for compiling a multidisciplinary list of highly cited researchers. This approach is essentially related to the recently discovered law of the constant ratios (Podlubny, 2004) and gives a better-balanced representation of different scientific fields.

Let $K$ be a field of characteristic $p>0$, $A=K[[Y]]$ be a power series ring in one variable and $Q(A)$ be the field of fraction of $A$. Suppose that $R=A[X_1,\ldots,X_n]$ is a standard $\mathbb{N}^n$-graded polynomial ring over $A$, i.e., $\operatorname{deg} (A)=\underline{0}\in \mathbb{N}^n$ and $\operatorname{deg}(X_j)=e_j\in \mathbb{N}^n$. Assume that $M=\bigoplus_{\underline{u}\in \mathbb{Z}^n} M_{\underline{u}}$ is a $\mathbb{Z}^n$-graded $\mathcal{F}$-finite, $\mathcal{F}$-module over $R$. In this article we prove that, $\displaystyle M_{\underline{u}}\cong E(A/YA)^{a(\underline{u})}\oplus Q(A)^{b(\underline{u})}\oplus A^{c(\underline{u})}$ for some finite numbers $a(\underline{u}), b(\underline{u}), c(\underline{u})\geq 0$. Let for a subset of $U$ of $\mathcal{S}=\{1, \ldots, n\}$, define a block to be the set $\displaystyle\mathcal{B}(U)=\{\underline{u} \in \mathbb{Z}^n \mid u_i \geq 0 \mbox{ if } i \in U \mbox{ and } u_i \leq -1 \mbox{ if } i \notin U \}$. Note that $\bigcup_{U\subseteq \mathcal{S}}\mathcal{B}(U)=\mathbb{Z}^n$. We prove that the sets $\{a(\underline{u})\mid \underline{u}\in \mathbb{Z}^n\}$, $\{b(\underline{u})\mid \underline{u}\in \mathbb{Z}^n\}$ and $\{c(\underline{u})\mid \underline{u}\in \mathbb{Z}^n\}$ are constant on $\mathcal{B}(U)$ for each subset $U$ of $\{1,\ldots,n\}$. In particular, these results holds for composition of local cohomology modules of the form $ H^{i_1}_{I_1}(H^{i_2}_{I_2}(\dots H^{i_r}_{I_r}(R)\dots)$ where $I_1,\ldots,I_r$ are $\mathbb{N}^n$-graded ideals of $R$. This provides a positive characteristic analogue of the results proved in \cite{TS-23} by the authors in characteristic zero.

We study closed-loop stability and suboptimality for MPC and infinite-horizon optimal control solved using a surrogate model that differs from the real plant. We employ a unified framework based on quadratic costs to analyze both finite- and infinite-horizon problems, encompassing discounted and undiscounted scenarios alike. Plant-model mismatch bounds proportional to states and controls are assumed, under which the origin remains an equilibrium. Under continuity of the model and cost-controllability, exponential stability of the closed loop can be guaranteed. Furthermore, we give a suboptimality bound for the closed-loop cost recovering the optimal cost of the surrogate. The results reveal a tradeoff between horizon length, discounting and plant-model mismatch. The robustness guarantees are uniform over the horizon length, meaning that larger horizons do not require successively smaller plant-model mismatch.

The family $\mathcal{P}_{d}^{λ_{d-1}}$ of all probability measures on $[0,1]^d$ whose $(d-1)$-dimensional marginals are all equal to the Lebesgue measure $λ_{d-1}$ on $[0,1]^{d-1}$ contains remarkably pathological elements: Working with Iterated Function Systems with Probabi\-lities (IFSPs) we construct measures $μ\in \mathcal{P}_{d}^{λ_{d-1}}$ of the following two types: (i) $μ$ has self-similar fractal support; (ii) $μ$ has self-similar support and models the situation of complete/functional dependence in each direction.As our main results concerning type (i) we prove, firstly, that for every $d\geq 3$ the set $\mathcal{D}_d$ of Hausdorff dimensions of the supports of elements in $\mathcal{P}_{d}^{λ_{d-1}}$ is dense in $[d-1,d]$; and, secondly, that the subset of elements in $\mathcal{P}_{d}^{λ_{d-1}}$ having fractal support is dense in $\mathcal{P}_{d}^{λ_{d-1}}$ with respect to the Wasserstein metric. Moreover, we show the existence of an element in $\mathcal{P}_{3}^{λ_{2}}$ of type (ii) whose support is a Sierpinski tetrahedron and study some generalizations.

We study Schrödinger operators on metric and discrete decorated graphs. The values taken by the integrated density of states (IDS) on spectral gaps are called gap labels. A natural question is which gap labels can occur. We answer this for graphs arising from uniquely ergodic one-dimensional dynamical systems by proving Johnson-Schwartzman gap-labelling theorems in both the metric and discrete settings. Our results extend Johnson-Schwartzman gap labelling beyond the standard one-dimensional setting. Unlike in one dimension, these graphs may contain cycles, which prevent the use of Sturm oscillation theory and require different spectral methods. We also analyze discontinuities of the IDS for certain graph families and show that not every admissible label corresponds to an open spectral gap. This reveals a mechanism of gap closing driven by graph geometry rather than by the underlying dynamics.

This paper addresses the decentralized non-uniform area coverage problem for multi-agent systems, a critical task in missions with high spatial priority and resource constraints. While existing density-based methods often rely on computationally heavy Eulerian PDE solvers or heuristic planning, we propose Stochastic Density-Driven Optimal Control (D$^2$OC). This is a rigorous Lagrangian framework that bridges the gap between individual agent dynamics and collective distribution matching. By formulating a stochastic MPC-like problem that minimizes the Wasserstein distance as a running cost, our approach ensures that the time-averaged empirical distribution converges to a non-parametric target density under stochastic LTI dynamics. A key contribution is the formal convergence guarantee established via reachability analysis, providing a bounded tracking error even in the presence of process and measurement noise. Numerical results verify that Stochastic D$^2$OC achieves robust, decentralized coverage while outperforming previous heuristic methods in optimality and consistency.

Gromov's theorem states that a finitely generated group has polynomial growth if and only if it is virtually nilpotent. A key ingredient in its proof is the small doubling property. In this work, we study entropy analogues of this property for random walks on groups. We show that if a finitely supported symmetric random walk $R_n$ satisfies \[ \mathrm{H}(R_{2n}) \le \mathrm{H}(R_n) + \log K \] at some sufficiently large scale $n$, then the underlying group is virtually nilpotent, with bounds depending on $K$ and $μ_{\min}$. Our approach adapts Tao's entropy Balog--Szemerédi--Gowers argument to unimodular locally compact groups, combined with structural results on approximate groups. As applications, we obtain entropy-based criteria for polynomial growth. We also deduce an entropy gap phenomenon: if $G$ is not virtually nilpotent, then the entropy of random walks on $G$ grows faster than a universal superlogarithmic function.

The purpose of this paper is two-fold. First we show that Kim's building-up construction of binary self-dual codes is equivalent to Chinburg-Zhang's Hilbert symbol construction. Second we introduce a $q$-ary version of Chinburg-Zhang's construction in order to construct $q$-ary self-dual codes efficiently. For the latter, we study self-dual codes over split finite fields \(\F_q\) with \(q \equiv 1 \pmod{4}\) through three complementary viewpoints: the building-up construction, the binary arithmetic reduction of Chinburg--Zhang, and the hyperbolic geometry of the Euclidean plane. The condition that \(-1\) be a square is the common algebraic input linking these viewpoints: in the binary case it underlies the Lagrangian reduction picture, while in the split \(q\)-ary case it produces the isotropic line governing the correction terms in the extension formulas. As an application of our efficient form of generator matrices, we construct optimal self-dual codes from the split boxed construction, including self-dual \([6,3,4]\) and \([8,4,4]\) codes over \(\GF{5}\), MDS self-dual \([8,4,5]\) and \([10,5,6]\) codes over \(\GF{13}\), and a self-dual \([12,6,6]\) code over \(\GF{13}\). These structural statements are accompanied by a Lean~4 formalization of the algebraic core.

Deterrence coalitions that collectively own their deterrence technology, need an institutional design to decide when to retaliate against an attack or incident. This choice of institutional design, formalized through a social choice function, introduces a tradeoff between credible deterrence and escalation risk. We study this tradeoff via a simple signalling model, and use it to construct an associated binary classification problem to determine institutional designs that perform well in a variety of environments. For a small coalition of four members, we compute and study the statistics of the empirical ROC curves associated to a variety of choice functions and probability distributions for retaliation and false positives.

We study the topology of Lagrangian submanifolds in standard symplectic vector spaces $\mathbb{C}^n$ using ideas from open-closed string topology. Specifically, for a closed, oriented, spin Lagrangian $L$, we construct a (possibly curved) deformation of the dg associative algebra of chains on the based loop space of $L$. This is done via pushing forward moduli spaces of pseudo-holomorphic discs with boundaries on $L$, viewed as chains in the free loop space, along a string topology closed-open map. As an application, we prove that if $π_2(L)=0$, then $L$ has non-vanishing Maslov class, generalizing previous results due to Viterbo, Cieliebak-Mohnke, Fukaya, and Irie.

We study numerical invariants associated with the reduction of singularities of holomorphic foliation germs on $(\mathbb{C}^2, 0)$. Building on our previous work on generalized curve foliations, we extend explicit formulas for several fundamental invariants to arbitrary foliations. In particular, we provide general expressions for the discrepancy vector, the Milnor and intrinsic Milnor numbers, and classical indices along a separatrix as Camacho-Sad, Variation, Gómez-Mont-Seade-Verjovsky and also the Baum-Bott index. These extensions require a careful analysis of the contributions of saddle-nodes arising in the desingularization process. As applications, we recover results of Brunella and Cavalier-Lehmann, as well as a related statement appearing in [8], within a unified and purely numerical framework. Furthermore, we obtain intrinsic characterizations of generalized curve foliations in terms of indices and of second type foliations in terms of the discrepancy vector.

Consider critical Bernoulli percolation on $\mathbb{Z}^d$ for $d$ large; let $y_0, \dots, y_{k-1}$ be $k$ distinct points in $\mathbb{R}^d$. We prove that the probability that $\{\lfloor n y_i\rfloor\}_{i=0}^{k-1}$ all lie in the same open cluster, rescaled by an appropriate power of $n$, converges as $n \to \infty$ to an explicit constant. This confirms a conjecture of Aizenman and Newman.

We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be discrete. We show, under natural extension hypotheses, that discreteness forces finiteness. We also obtain a uniform bound for the number of fixed points of automorphisms in compact subgroups whose elements admit such extensions.

We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We study fundamental properties of this spectrum, such as density and limit points, and show that its structure is related to several notions of primality of an algebra. We introduce a quantitative measure of primality $\Prim(\A)\in[0,1]$ that characterizes the functional approximation capacity. We show that the degree of primality is related to the size of the spectrum. We also prove that all non-primal two-element algebras satisfy the universal bound $\Prim(\A)\le 1/2$.

The conventional power allocation strategy via water-filling relies on the premise that the power amplifier (PA) operates sufficiently below saturation such that a linear RF chain model holds. This work integrates the PA nonlinearity directly into the power allocation formulation, thereby removing the linearity assumption altogether and enabling operation in regimes where distortion noise is non-negligible. Leveraging the Bussgang theorem, we establish a statistical linearization of the PA's hard-limiting model to characterize the trade-off between signal gain and power-dependent distortion. We propose a projected gradient descent algorithm that optimizes power allocation while identifying an optimal spatial back-off strategy. We also derive a closed-form thermal noise variance threshold that separates the noise-limited and distortion-limited operating regimes as a function of the distortion noise variance and the channel Frobenius norm. Numerical simulations validate that our amplifier-aware strategy provides significant capacity gains in the saturation regime compared to standard water-filling.

We introduce the concept of deck transformations within the category of developable complexes of groups. Drawing inspiration from classical covering theory for topological spaces, we propose an alternative construction of the universal development of a developable complex of groups, formulated in terms of equivalence classes of paths. This framework allows us to provide a natural characterization of the group of deck transformations.

We establish a two-weight fractional Poincaré-Sobolev sandwich, consisting of a two-weight fractional Poincaré-Sobolev inequality and a two-weight embedding from the first-order Sobolev space to a Triebel-Lizorkin space defined via a difference norm. Our constants are asymptotically sharp as the fractional parameter approaches $1$. Our results are new even in the one-weight case. For each inequality we give explicit quantitative dependence on Muckenhoupt weight characteristics and treat both subcritical and critical regimes, the former via elementary methods and the latter via sparse domination. As one of our main tools, we establish a new sparse domination result for Triebel-Lizorkin difference norms. Our methods unify, simplify and significantly extend various earlier approaches.

The Koopman-von Neumann equation describes the evolution of wavefunctions associated with autonomous ordinary differential equations and can be regarded as a quantum physics-inspired formulation of classical mechanics. The main advantage compared to conventional transfer operators such as Koopman and Perron-Frobenius operators is that the Koopman-von Neumann operator is unitary even if the dynamics are non-Hamiltonian. Projecting this operator onto a finite-dimensional subspace allows us to represent it by a unitary matrix, which in turn can be expressed as a quantum circuit. We will exploit relationships between the Koopman-von Neumann framework and classical transfer operators in order to derive numerical methods to approximate the Koopman-von Neumann operator and its eigenvalues and eigenfunctions from data. Furthermore, we will show that the choice of basis functions and domain are crucial to ensure that the operator is well-defined. We will illustrate the results with the aid of guiding examples, including simple undamped and damped oscillators and the Lotka-Volterra model.

Gibbs states are a natural model of quantum matter at thermal equilibrium. We investigate the role of external fields in shaping the entanglement structure and computational complexity of high-temperature Gibbs states. External fields can induce entanglement in states that are otherwise provably separable, and the crossover scale is $h\asymp β^{-1} \log(1/β)$, where $h$ is an upper bound on any on-site potential and $β$ is the inverse temperature. We introduce a quasi-local Lindbladian that satisfies detailed balance and rapidly mixes to the Gibbs state in $\mathcal{O}(\log(n/ε))$ time, even in the presence of an arbitrary on-site external field. Additionally, we prove that for any $β<1$, there exist local Hamiltonians for which sampling from the computational-basis distribution of the corresponding Gibbs state with a sufficiently large external field is classically hard, under standard complexity-theoretic assumptions. Therefore, high-temperature Gibbs states with external fields are natural physical models that can exhibit entanglement and classical hardness while also admitting efficient quantum Gibbs samplers, making them suitable candidates for quantum advantage via state preparation.

Data-driven control has emerged as a powerful paradigm for synthesizing controllers directly from data, bypassing explicit model identification. However, this reliance on data introduces new and largely unexplored vulnerabilities. In this paper, we show that an attacker can systematically poison the data used for control synthesis, causing any linear state-feedback controller synthesized by the planner to destabilize the physical system. Concerningly, we show that the attacker can achieve this objective without knowledge of the system model or the controller synthesis procedure. To this end, we develop a recursive data-poisoning mechanism that generates falsified state trajectories, inducing a precise geometric shift in the apparent system dynamics. More broadly, our results establish that data-driven control pipelines can be deterministically destabilized by model-agnostic attacks operating solely at the data level. Numerical simulations corroborate these findings for both noise-free and noisy data.

This work is inspired by a remark of de Gennes about polyelectrolytes, which are charged polymers. A common model for a polymer is a self-avoiding or self-repelling random walk or Brownian motion. For polyelectrolytes, the repelling potential is the Coulomb potential arising from pairs of charged particles. We show that in the continuous case of Brownian motion in three dimensions, the radius of gyration of a polyelectrolyte of length T grows linearly with T, up to logarithmic corrections.

We develop methods for constructing and computing conformal invariants of submanifolds, with a particular emphasis on conformal submanifold scalars and conformally invariant integrals of natural submanifold scalars. These methods include a direct construction of the extrinsic ambient space, a construction of global invariants of conformally compact minimal submanifolds of conformally compact Einstein manifolds via renormalized extrinsic curvature integrals, and the introduction of a large class of conformal submanifold scalars that are easily computed at minimal submanifolds of Einstein manifolds. As an application, we derive an explicit Gauss--Bonnet--Chern-type formula relating the renormalized area of a conformally compact $k$-dimensional minimal submanifold of a conformally compact Einstein manifold to its Euler characteristic and the integral of a conformal submanifold scalar of weight $-k$. As another application, we prove a rigidity result for conformally compact minimal submanifolds of conformally compact hyperbolic manifolds.

In this work, we extend the meshfree generalized multiscale exponential integration framework introduced in Nikiforov et al. (2025) to the simulation of three-dimensional advection--diffusion problems in heterogeneous and high-contrast media. The proposed approach combines meshfree generalized multiscale finite element methods (GMsFEM) for spatial discretization with exponential integration techniques for time advancement, enabling stable and efficient computations in the presence of stiffness induced by multiscale coefficients and transport effects. We introduce new constructions of multiscale basis functions that incorporate advection either at the snapshot level or within the local spectral problems, improving the approximation properties of the coarse space in advection-dominated regimes. The extension to three-dimensional settings poses additional computational and methodological challenges, including increased complexity in basis construction, higher-dimensional coarse representations, and stronger stiffness effects, which we address within the proposed framework. A series of numerical experiments in three-dimensional domains demonstrates the viability of the method, showing that it preserves accuracy while allowing for significantly larger time steps compared to standard time discretizations. The results highlight the robustness and efficiency of the proposed approach for large-scale multiscale simulations in complex heterogeneous media.

We consider two-dimensional periodic gravity water waves with constant nonzero vorticity $γ$, in infinite depth and with periodic boundary conditions. We prove that, if the characteristic wave number $\frac{γ^2}{g}$ is rational, the system admits smooth small-amplitude solutions whose high Sobolev norms grow arbitrarily large while lower-order norms remain arbitrarily small, thereby exhibiting a genuine transfer of energy toward high frequencies. This yields the first rigorous construction of weakly turbulent solutions for a quasilinear hydrodynamic wave system, in a regime where the flow remains smooth. Moreover, the growth occurs simultaneously in the free surface and in the vertical component of the velocity at the interface, showing that the instability involves the full hydrodynamic evolution. The proof relies on a new mechanism for generating energy cascades in quasilinear dispersive PDEs with sublinear dispersion and a nonlinear transport structure. A central ingredient is to exploit quasi-resonances from 2-wave interactions to produce a transport operator that drives energy to high modes and causes Sobolev norm growth. A virial-type argument then shows that the resulting instability affects both the free surface elevation and the velocity field.

Along with some known and less known results, we discuss new insights relating combinatorics of words and the ordering of the rationals from a dynamical systems point of view, somehow continuing along the path started in [BI]. We obtain in particular a set of results that structure and enrich the correspondence between the Stern-Brocot (SB) ordering of rational numbers and the corresponding ordering of Farey-Christoffel (FC) words, a class of words that, since their appearance in literature at the end of the 18th century, have revealed numerous relationships with other fields of mathematics. Among the results obtained here is the construction of substitution rules that act on the FC words in a parallel way to the maps on the positive reals that generate the permuted SB tree both vertically and horizontally. We further show that these rules naturally induce a map of the space of (infinite) Sturmian sequences into itself. Finally, a complete correspondence is obtained between the vertical and horizontal motions on the SB tree and the geodesic motions along scattering geodesics and the horocyclic motion along Ford circles in the upper half-plane, respectively.

We perform a comprehensive study of a certain class of discrete symmetries of families of Feynman integrals, defined as affine changes of variables that map different sectors of the family into each other. We show that these transformations are always encoded into permutations of the Feynman parameters that relate the Lee-Pomeransky polynomials of the two sectors, irrespective of the integral representation used to define the Feynman integrals. We then construct an affine map in loop-momentum space that encodes such a permutation. We also show that these symmetries can be naturally embedded into the framework of twisted cohomology theories, and the period and intersection parings are invariant under the symmetry transformations. If we focus on symmetries within a fixed sector, we obtain a group acting on the twisted cohomology group, and we study the decomposition of this action into irreducible representations. One of our main mathematical results is that the character of this representation is proportional to the Euler characteristic of the corresponding fixed-point set. We then study the implications for Feynman integrals, in particular for the intersection matrix in a canonical basis. We also present a formula for the number of master integrals in a given sector in the presence of a non-trivial symmetry group in terms of the Euler characteristics of fixed-point sets. As an application, we obtain the numbers of master integrals for banana integrals with up to four loops for arbitrary configurations of non-zero masses. In order to achieve our results, we had to combine tools from various different areas of mathematics, including graph theory, group theory and algebraic topology.

We present a categorical framework for formal systems in which inference rules with $m$ metavariables over a category of syntax $\mathscr{S}$, taken to be a cartesian PROP, are represented by operations of arity $k \to n$ equipped with spans $k \leftarrow m \to n$ in $\mathscr{S}$, encoding the hypotheses and conclusions in a common metavariable context. Composition is by substitution of metavariables, which is the sole primitive operation, as in Metamath. Proofs in this setting form a symmetric monoidal category whose monoidal structure encodes the combination and reuse of hypotheses. This structure admits a proof-checking algorithm; we provide an open-source implementation together with a surface syntax for defining formal systems. As a demonstration, we encode the formulae and inference rules of first-order logic in Metacat, and give axioms and representative derivations as examples.

Let $f:\mathbb{R}^n\to\mathbb{R}$ be an unknown object, and suppose the observations are tomographic projections of randomly rotated copies of $f$ of the form $Y = P(R\cdot f)$, where $R$ is Haar-uniform in $\mathrm{SO}(n)$ and $P$ is the projection onto an $m$-dimensional subspace, so that $Y:\mathbb{R}^m\to\mathbb{R}$. We prove that, whenever $d\le m$, the $d$-th order moment of the projected data determines the full $d$-th order Haar-orbit moment of $f$, independently of the ambient dimension $n$. We further provide an explicit algorithmic procedure for recovering the latter from the former. As a consequence, any identifiability result for the unprojected model based on $d$-th order group-invariant moment extends directly to the tomographic setting at the same moment order. In particular, for $n=3$, $m=2$, and $d=2$, our result recovers a classical result in the cryo-EM literature: the covariance of the 2D projection images determines the second order rotationally invariant moment of the underlying 3D object.

This paper presents a technique to drive the state of a constrained nonlinear system to a specified target state in finite time, when the system suffers a partial loss in control authority. Our technique builds on a recent method to control constrained nonlinear systems by building a simple, linear driftless approximation at the initial state. We construct a partition of the finite time horizon into successively smaller intervals, and design controlled inputs based on the approximate dynamics in each partition. Under conditions that bound the length of the time horizon, we prove that these inputs result in bounded error from the target state in the original nonlinear system. As successive partitions of the time horizon become shorter, the error reduces to zero despite the effect of uncontrolled inputs. A simulation example on the model of a fighter jet demonstrates that the designed sequence of controlled inputs achieves the target state despite the system suffering a loss of control authority over one of its inputs.

Many essential biological functions, such as breathing and locomotion, rely on the coordination of robust and adaptable rhythmic patterns, governed by specific network architectures known as connectomes. Rhythmic adaptation is often linked to slow structural modifications of the connectome through synaptic plasticity, but such mechanisms are too slow to support rapid, localized rhythmic transitions. Here, we propose a neuromodulation-based control architecture for dynamically reconfiguring rhythmic activity in networks with fixed connectivity. The key control challenge is to achieve reliable rhythm switching despite neuronal degeneracy, a form of structured variability where widely different parameter combinations produce similar functional output. Using equivariant bifurcation theory, we derive necessary symmetry conditions on the neuromodulatory projection topology for the existence of target gaits. We then show that an adaptive neuromodulation controller, operating in a low-dimensional feedback gain space, robustly enforces gait transitions in conductance-based neuron models despite large parametric variability. The framework is validated in simulation on a quadrupedal gait control problem, demonstrating reliable gallop-to-trot transitions across 200 degenerate networks with up to fivefold conductance variability.