We derive and prove the path-kernel formula for the linear response (parameter-derivative of averaged statistics) of SDEs. The parameter may affect the drift coefficient, the diffusion coefficient, and the initial condition. The formula tempers the unstableness by gradually moving the derivative from path-perturbation to kernel-differentiation, without assuming hyperbolicity. We prove it by direct comparison of bundles of paths across different parameter values. We also derive a pathwise Monte Carlo algorithm for estimating linear responses and demonstrate it on the 40-dimensional noisy Lorenz--96 system. Our result provides a new computational tool for optimization, and has already led to a follow-up application to data assimilation.

As social VR grows in popularity, understanding how to optimise interactions becomes increasingly important. Interpersonal distance (the physical space people maintain between each other) is a key aspect of user experience. Previous work in psychology has shown that breaches of personal space cause stress and discomfort. Thus, effectively managing this distance is crucial in social VR, where social interactions are frequent. Teleportation, a commonly used locomotion method in these environments, involves distinct cognitive processes and requires users to rely on their ability to estimate distance. Despite its widespread use, the effect of teleportation on proximity remains unexplored. To investigate this, we measured the interpersonal distance of 70 participants during interactions with embodied conversational agents, comparing teleportation to natural walking. Our findings revealed that participants maintained closer proximity from the agents during teleportation. Female participants kept greater distances from the agents than male participants, and natural walking was associated with higher agency and body ownership, though co-presence remained unchanged. We propose that differences in spatial perception and spatial cognitive load contribute to reduced interpersonal distance with teleportation. These findings emphasise that proximity should be a key consideration when selecting locomotion methods in social VR, highlighting the need for further research on how locomotion impacts spatial perception and social dynamics in virtual environments.

Arctic sea-ice loss is a defining feature of climate change and offers insight into its impact on mid-latitude air quality. Here, we investigate how variability in Arctic sea-ice extent (ASI) affects ground-level ozone ($O_3$) across eastern US states through physically and chemically mediated atmospheric pathways. Using observations and causal-inference methods grounded in atmospheric dynamics, we show that ASI drives wintertime ozone variability primarily via indirect meteorological mechanisms, including changes in humidity, temperature, and atmospheric circulation along the polar and subtropical jet streams. Inland regions exhibit the strongest sensitivity, while coastal areas are modulated by marine boundary-layer processes. Seasonal contrasts reveal that Arctic-driven dynamics suppress ozone in winter but can enhance accumulation under certain summer conditions. These findings highlight the importance of Arctic-midlatitude teleconnections in shaping regional air quality and highlight the need to integrate large-scale climate processes into ozone management and climate adaptation strategies.

Stochastic trajectory optimisation under uncertainty requires robust constraint satisfaction through chance constraints. However, existing transcription methods remain limited to scalar constraints or highly specific structures while introducing substantial conservatism. This work presents two general-purpose transcription methods for multi-dimensional Gaussian chance constraints for trajectory optimisation problems under uncertainty. The spectral radius method extends existing methods to arbitrary multi-dimensional constraints with reduced conservatism. The refined first-order method achieves superior tightness with linear complexity. In addition, a d-th order risk estimation methodology provides conservative failure probability estimates with limited conservatism in high dimensions in quadratic complexity. Applied to an optimal control with uncertainties setting, the first-order transcription achieves near-optimal fuel consumption while maintaining the failure risk below the target. The spectral radius method incurs approximately 0.7 kg additional fuel consumption due to excessive conservatism and a 51% increase in computational time due to its cubic complexity. High-dimensional tests show that the proposed risk estimation method provides accurate risk estimates, while previously developed methods exhibit exponential growth in conservatism with respect to constraint dimension.

This paper presents differential algebra-based differential dynamic programming (DADDy), a publicly available C++ framework for constrained, fuel-optimal low-thrust trajectory optimisation. The method uses differential algebra (DA) for two purposes: automatic differentiation and high-order Taylor expansions of the dynamics. These expansions replace many expensive numerical propagations with polynomial evaluations, reducing computational effort while preserving solution quality. The framework combines two complementary modules. First, a differential dynamic programming (DDP)/iterative linear-quadratic regulator (iLQR) stage computes an almost-feasible trajectory from imperfect initial guesses. Second, a polynomial-accelerated Newton stage enforces full feasibility with fast local convergence. Equality and inequality constraints are handled through an augmented Lagrangian formulation, and a pseudo-Huber homotopy is used to improve robustness for fuel-optimal objectives. The solver is evaluated on benchmark transfers in Sun-centred, Earth-Moon, and Earth-centred dynamical environments. Across these cases, the most robust configuration (iLQRDyn) converged systematically and reduced run time by 70% (Sun-centred), 51-88% (Earth-Moon), and 41-55% (Earth-centred) relative to the corresponding baseline. When convergent, the DDP-based variants are faster still. Overall, the results show that DA-based acceleration can substantially improve practical efficiency while retaining robust convergence behaviour on the tested benchmark set.

We prove an asymptotic formula for the second moment of $L$-functions associated to the Rankin-Selberg convolution of two holomorphic Hecke cusp forms with equal weight.

We study the online coloring of $σ$-interval graphs, which are interval graphs with interval lengths in $[1,σ]$ and 2-count interval graphs, which are interval graphs that require at most two distinct interval lengths. For $σ$-interval graphs, the Kierstead-Trotter algorithm has competitive ratio 3 and no online algorithm has competitive ratio better than 2. In this paper, we show that for every $\varepsilon>0$, there is a $σ>1$ such that there is no online algorithm for $σ$-interval coloring with competitive ratio less than $3-\varepsilon$. For 2-count interval graphs, we show that the greedy algorithm First-Fit has competitive ratio at most $4$, that there is no online algorithm with competitive ratio less than $2.5$ when the interval representation is unknown, and that there is no online algorithm with competitive ratio less than $2$ when the interval representation is known.

We show that induction along a Frobenius extension of Hopf algebras is a Frobenius monoidal functor in great generality, in particular, for all finite-dimensional and all pointed Hopf algebras. As an application, we show that induction functors from unimodular Hopf subalgebras to small quantum groups at roots of unity are Frobenius monoidal functors and classify such unimodular Hopf subalgebras. Moreover, we present stronger conditions on Frobenius extensions under which the induction functor extends to a braided Frobenius monoidal functor on categories of Yetter--Drinfeld modules. We show that these stronger conditions hold for any extension of finite-dimensional semisimple and co-semisimple (or, more generally, unimodular and dual unimodular) Hopf algebras.

10 is the smallest positive integer which is whether solitary or friendly is still an open question in mathematics. In this paper, we provide upper bounds for each of the prime divisors of a friend of 10. This paper is precisely a generalization of a recent paper [4] in which necessary upper bounds for the 2nd, 3rd, and 4th smallest prime divisors of a friend of 10 have been proved. Further, we establish better upper bounds for the 3rd, and 4th smallest prime divisors of a friend of 10 than the bounds given in [4].

Cell extrusion is an essential mechanism for controlling cell density in epithelial tissues. Another essential element of epithelia is curvature, which is required to achieve complex shapes, like in the lung or intestine. Here we introduce a three-dimensional bubbly vertex model to study the interplay between extrusion and curvature. We find a generic cellular bulging instability at topological defects which is much stronger than for standard vertex models. Analyzing cell shapes in three-dimensional imaging data of spherical mouse colon organoids, we infer that pentagonal cells have an increased basal interfacial tension, suggesting that cells at topological defects react to the different force conditions. Using the bubbly vertex model, we show that such basal tensions stabilize against the predicted instability and result in better cell shape control than tissue-scale mechanisms such as lumen pressure and spontaneous curvature. Our theory suggests that epithelial curvature naturally leads to bulged and extrusion-like cell shapes because the interfacial curvature of individual cells at the defects strongly amplifies buckling effected by tissue-scale topological defects in elastic sheets. Our results highlight the complex interplay of forces across scales in three-dimensional tissue organization.

In this paper, we present a QUBO formulation designed to solve a series of generalisations of the LinkedIn queens game, a version of the N-queens problem, for the Takuzu game (or Binairo), for the most recent LinkedIn game, Tango, and for its generalizations. We adapt this formulation for several particular cases of the problem, as Tents \& Trees, by trying to optimise the number of variables and interactions, improving the possibility of applying it on quantum hardware by means of Quantum Annealing or the Quantum Approximated Optimization Algorithm (QAOA). We also present two new types of problems, the Coloured Chess Piece Problem and the Max Chess Pieces Problem, with their corresponding QUBO formulations.

We consider minimum time multicasting problems in directed and undirected graphs: given a root node and a subset of $t$ terminal nodes, multicasting seeks to find the minimum number of rounds within which all terminals can be informed with a message originating at the root. In each round, the telephone model we study allows the information to move via a matching from the informed nodes to the uninformed nodes. Since minimum time multicasting in digraphs is poorly understood compared to the undirected variant, we study an intermediate problem in undirected graphs that specifies a target $k < t$, and requires that only $k$ of the terminals be informed in the minimum number of rounds. For this problem, we improve the implications of the previous results and obtain a multiplicative approximation factor of $\tilde{O}(t^{1/3})$. For the directed version, we obtain an additive $\tilde{O}(k^{1/2})$ approximation algorithm (with a polylogarithmic multiplicative factor). Our algorithms are based on reductions to the related problems of finding $k$-trees of minimum poise (sum of maximum degree and diameter) and applying a combination of greedy network decomposition techniques and set covering under partition matroid constraints. We also study the problem of bounded degree Directed Steiner Tree, for which we obtain improved polylogarithmic approximations for the special case of bounded treewidth graphs. This extends prior work on the Group Steiner Tree problem.

We consider the Brown measure of $a+\mathfrak{c}$, where $a$ lies in a commutative tracial von Neumann algebra $\mathcal{B}$ and $\mathfrak{c}$ is a $\mathcal{B}$-valued circular element. Under certain regularity conditions on $a$ and the covariance of $\mathfrak{c}$ this Brown measure has a density with respect to the Lebesgue measure on the complex plane which is real analytic apart from jump discontinuities at the boundary of its support. With the exception of finitely many singularities this one-dimensional spectral edge is real analytic. We provide a full description of all possible edge singularities as well as all points in the interior, where the density vanishes. The edge singularities are classified in terms of their local edge shape while internal zeros of the density are classified in terms of the shape of the density locally around these points. We also show that each of these countably infinitely many singularity types occurs for an appropriate choice of $a$ when $\mathfrak{c}$ is a standard circular element. The Brown measure of $a+\mathfrak{c}$ arises as the empirical spectral distribution of a diagonally deformed non-Hermitian random matrix with independent entries when its dimension tends to infinity.

We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; b) develops efficient approximations of the utility, namely, the expected information gain; c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties we wish to be robust against; and d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

We construct functorial Igusa stacks for all Hodge-type Shimura varieties, proving a conjecture of Scholze and extending earlier results of the fourth-named author for PEL-type Shimura varieties. Using the Igusa stack, we construct a sheaf on $\mathrm{Bun}_G$ that controls the cohomology of the corresponding Shimura variety. We use this sheaf and the spectral action of Fargues-Scholze to prove a compatibility between the cohomology of Shimura varieties of Hodge type and the semisimple local Langlands correspondence of Fargues-Scholze, generalizing the Eichler-Shimura relation of Blasius-Rogawski to arbitrary level at $p$. When the given Shimura variety is proper, we show moreover that the sheaf is perverse, which allows us to prove new torsion vanishing results for the cohomology of Shimura varieties.

In present work, we present a couple-channel formalism for the description of tunneling time of a quantum particle through a composite compound with multiple energy levels or a complex structure that can be reduced to a quasi-one-dimensional multiple-channel system.

We describe the K-moduli spaces of weighted hypersurfaces of degree $2(n+3)$ in $\mathbb{P}(1,2,n+2,n+3)$. We show that the K-polystable limits of these weighted hypersurfaces are also weighted hypersurfaces of the same degree in the same weighted projective space. This is achieved by an explicit study of the wall crossing for K-moduli spaces $M_w$ of certain log Fano pairs with coefficient $w$ whose double cover gives the weighted hypersurface. Moreover, we show that the wall crossing of $M_w$ coincides with variation of GIT except at the last K-moduli wall which gives a divisorial contraction. Our K-moduli spaces provide new birational models for some natural loci in the moduli space of marked hyperelliptic curves.

We give a counterexample to the PIA (precise inversion of adjunction) conjecture for minimal log discrepancies. We also give a counterexample to the LSC conjecture for families.

We establish that all rings of $S$-integers are universally definable in function fields in one variable over certain ground fields including global and non-archimedean local fields. That is, we show that the complement of such a ring of $S$-integers is always a diophantine set. As a technical tool, we use a reciprocity exact sequence for quadratic Witt groups in function fields over almost arbitrary base fields (of any characteristic), which is new and of potentially independent interest.

Hausdorff $Φ$-dimension is a notion of Hausdorff dimension developed using a restricted class of coverings of a set. We introduce an effective version of Hausdorff $Φ$-dimension, which we call constructive $Φ$-dimension. We prove a point-to-set principle for $Φ$-dimension, through which we get point-to-set principles for Hausdorff dimension, continued fraction dimension, and dimension of Cantor coverings as special cases. We also provide a Kolmogorov complexity characterization of constructive $Φ$-dimension. A class of covering sets $Φ$ is said to be ``faithful'' to Hausdorff dimension if the $Φ$-dimension and Hausdorff dimension coincide for every set. Similarly, $Φ$ is said to be ``faithful'' to constructive dimension if the constructive $Φ$-dimension and constructive dimension coincide for every set. We derive the necessary and sufficient conditions for the constructive dimension faithfulness of the coverings generated by the Cantor series expansion, based on the terms of the expansion. Using the point-to-set principle for Cantor coverings and a new technique for the construction of sequences satisfying a certain Kolmogorov complexity condition, we show that the notions of ``faithfulness'' of Cantor coverings at the Hausdorff and constructive levels are equivalent. Hence we show the necessary and sufficient conditions for Hausdorff dimension faithfulness of Cantor coverings, thereby giving an information theoretic proof of the result by Albeverio, Ivanenko, Lebid, and Torbin.

Bismuth, the heaviest of all group V elements with strong spin-orbit coupling, is famously known to exhibit many interesting transport properties, and effects such as Shubnikov-de Haas and de Haas-van Alphen were first revealed in its bulk form. However, the transport properties have not yet been fully explored experimentally in thin bismuth nor in its 2D limit. In this work, bismuth flakes with average thicknesses ranging from 29 to 69 nm were mechanically exfoliated by a micro-trench technique and were used to fabricate four-point devices. Due to mixing of components, Onsager's relations were used to extract the longitudinal ($R_{xx}$) and Hall ($R_{xy}$) resistances where the latter shows a Hall anomaly that is consistent with the Anomalous Hall Effect (AHE). Our work strongly suggests that that there could be a hidden mechanism for time-reversal symmetry breaking in pure bismuth thin films.

We study truncated gauge-orbits through principal parts of irregular-singular connection germs, in the untwisted/unramified setting: for any connected complex reductive structure group $G$, in the general multilevel case. In particular, we compute the stabilisers of the formal normal forms using filtrations of Levi root systems, showing that they are connected. When the residue is semisimple we then stratify the space of orbits by the conjugacy class of the stabilisers, i.e., by quotients of root-valuation strata; the dense stratum corresponds to the generic setting of isomonodromic deformations, à la Jimbo--Miwa--Ueno. Then we adapt a result of Alekseev--Lachowska to deformation-quantise nongeneric orbits. The $\ast$-product involves affine-Lie-algebra modules, extending: (i) the parabolic Verma modules (in the case of regular singularities); and (ii) the `singularity' modules of F.--R. (in the case of generic irregular singularities). They contain Whittaker vectors for the Gaiotto--Teschner/Bonelli--Maruyoshi--Tanzini Virasoro pairs in irregular Liouville conformal field theory, and they provide all the quotients obtained by leaving the aforementioned dense strata. We also construct Shapovalov forms for the corresponding representations of truncated-current Lie algebras, which enter into the category $\mathcal O$ of Chaffe--Topley; and we state a sharp irreducibility criterion. Finally, we use these representations to construct vector bundles of genus-zero vacua/covacua, equipped with flat connections à la Knizhnik--Zamolodchikov/Reshetikhin.

C/2019 Y4 (ATLAS) is an Oort cloud comet with an orbital period of $\sim$5895$\,{\rm yr}$. Starting in March 2020, its nucleus underwent disintegration. In order to investigate the gas and dust properties of C/2019 Y4 (ATLAS) during its disintegration, we obtained long-slit spectra at 3600--8700$\,{\rm\mathring{A}}$ and $BVRI$ multi-band images with the Xinglong 2.16-Meter Telescope in April 2020. Our observations revealed that C/2019 Y4 (ATLAS) exhibited strong emission bands of CN, C$_2$, C$_3$, and NH$_2$ which are superimposed on a dust scattering continuum, typical of cometary spectra in the optical. The production rates of CN, C$_2$, and C$_3$ derived using the Haser model and the corresponding C$_2$/CN and C$_3$/CN ratios suggest that C/2019 Y4 (ATLAS) is a ``typical'' Oort cloud comet under the A'Hearn classification, although it appears less dusty as revealed by the $Afρ$ quantities. Its dust-scattering reflectivity is slightly red, with a gradient of $\sim$5% per $10^3\,{\rm\mathring{A}}$. We model the reflectivity gradient in terms of porous dust and find that the red color is accounted for by porous dust.

The Spatial Pattern Matching (SPM) query allows for the retrieval of Points of Interest (POIs) based on spatial patterns defined by keywords and distance criteria. However, it does not consider the connectivity between POIs. In this study, we introduce the Qualitative and Quantitative Spatial Pattern Matching (QQ-SPM) query, an extension of the SPM query that incorporates qualitative connectivity constraints. To answer the proposed query type, we propose the QQESPM algorithm, which adapts the state-of-the-art ESPM algorithm to handle connectivity constraints. Performance tests comparing QQESPM to a baseline approach demonstrate QQESPM's superiority in addressing the proposed query type.

We prove the precise inversion of adjunction formula for finite linear group quotients of complete intersection varieties defined by semi-invariant equations. As an application, we prove the semi-continuity of minimal log discrepancies for them. These results extend the results in our first paper, where we prove the same results for complete intersection varieties defined by ``invariant equations".

Typically, a randomized experiment is designed to test a hypothesis about the average treatment effect and sometimes hypotheses about treatment effect variation. The results of such a study may then be used to inform policy and practice for units not in the study. In this paper, we argue that given this use, randomized experiments should instead be designed to predict unit-specific treatment effects in a well-defined population. We then consider how different sampling processes and models affect the bias, variance, and mean squared prediction error of these predictions. The results indicate, for example, that problems of generalizability (differences between samples and populations) can greatly affect bias both in predictive models and in measures of error in these models. We also examine when the average treatment effect estimate outperforms unit-specific treatment effect predictive models and implications of this for planning studies.

For a $k$-uniform hypergraph $\mathcal{H}$, the \emph{codegree squared sum} $\text{co}_2(\mathcal{H})$ is the square of the $\ell_2$-norm of the codegree vector of $\mathcal{H}$, and for a family $\mathscr{F}$ of $k$-uniform hypergraphs, the codegree squared extremal number $\text{exco}_2(n, \mathscr{F})$ is the maximum codegree squared sum of a hypergraph on $n$ vertices which does not contain any hypergraph in $\mathscr{F}$. Balogh, Clemen and Lidický recently introduced the codegree squared extremal number and determined it for a number of $3$-uniform hypergraphs, including the complete graphs $K_4^3$ and $K_5^3$. In this paper, we give a number of exact or asymptotic results for hypergraph Turán problems in the $\ell_2$-norm, including the first exact results for arbitrary $k$. Namely, we prove a version of the classical Erdős-Ko-Rado theorem for the codegree squared extremal number: if $\mathcal{F} \subset \binom{[n]}{k}$ is intersecting and $n\ge 2k$, then \[\text{co}_2(\mathcal{F}) \le \binom{n-1}{k-1}(1+(n-k+1)(k-1)),\] with equality only for the star for $n > 2k$. Our main tool is an inequality of Bey, which also gives a general upper bound on $\text{exco}_2(n, \mathscr{F})$. We also prove versions of the Erdős Matching Conjecture and the $t$-intersecting Erdős-Ko-Rado theorem for the codegree squared extremal number for large $n$, determine the exact codegree squared extremal number of minimal and linear $3$-paths and $3$-cycles, and determine asymptotically the codegree squared extremal number of minimal and linear $s$-paths and $s$-cycles for $s\ge 4$. Lastly, we derive a number of exact or asymptotic results for graph Turán-type problems in the $\ell_2$-norm from spectral extremal results for certain forbidden subgraph problems and the well-known Hofmeister's inequality.

A search for the critical point of the strongly interacting matter by studying power-law fluctuations within the framework of intermittency is ongoing. In particular, experimental data on proton and pion production in heavy-ion collisions are analyzed in transverse momentum space. In this regard, a simple Monte Carlo model with an explicit power-law multi-particle correlation in transverse momentum space is introduced. The model is intended as a phenomenological tool to study the sensitivity of intermittency analyses to power-law correlated particles in the presence of various detector effects.

Contact Boolean algebras are one of the main algebraic tools in region-based theory of space. T. Ivanova provided strong motivations for the study of merely semilattices with a contact relation. Another significant motivation for considering an even weaker underlying structure comes from event structures with binary conflict in the theory of concurrent systems in computer science. All the above-hinted notions deal with a binary contact relation. Several authors suggested the more general study of $n$-ary ``hypercontact'' relations and noticed that, in general, a hypercontact relation cannot be retrieved from just a binary contact relation. A similar evolution occurred in the study of the just mentioned event structures in computer science. In an effort to unify the above lines of research, in this paper we study join semilattices with a hypercontact relation. We provide representation theorems into Boolean algebras, with or without overlap hypercontact relation. With a single exception, our proofs are choice-free. We also present several examples and problems; in particular, we briefly discuss some connections with event structures and hypergraphs.

We show non-asymptotic exponential convergence of Sinkhorn iterates to the Schrödinger potentials, solutions of the quadratic Entropic Optimal Transport problem on $\mathbb{R}^ d$. Our results hold under mild assumptions on the marginal inputs: in particular, we only assume that they admit an asymptotically positive log-concavity profile, covering as special cases log-concave distributions and bounded smooth perturbations of quadratic potentials. Up to the authors' knowledge, these are the first results which establish exponential convergence of Sinkhorn's algorithm in a general setting without assuming bounded cost functions or compactly supported marginals.