When estimating causal effects from observational studies, researchers often need to adjust for many covariates to deconfound the non-causal relationship between exposure and outcome, among which many covariates are discrete. The behavior of commonly used estimators in the presence of many discrete covariates is not well understood since their properties are often analyzed under structural assumptions including sparsity and smoothness, which do not apply in discrete settings. In this work, we study the estimation of causal effects in a model where the covariates required for confounding adjustment are discrete but high-dimensional, meaning the number of categories $d$ is comparable with or even larger than sample size $n$. Specifically, we show the mean squared error of commonly used regression, weighting and doubly robust estimators is bounded by $\frac{d^2}{n^2}+\frac{1}{n}$. We then prove the minimax lower bound for the average treatment effect is of order $\frac{d^2}{n^2 \log^2 n}+\frac{1}{n}$, which characterizes the fundamental difficulty of causal effect estimation in the high-dimensional discrete setting, and shows the estimators mentioned above are rate-optimal up to log-factors. We further consider additional structures that can be exploited, namely effect homogeneity and prior knowledge of the covariate distribution, and propose new estimators that enjoy faster convergence rates of order $\frac{d}{n^2} + \frac{1}{n}$, which achieve consistency in a broader regime. The results are illustrated empirically via simulation studies.

Motivated by Hadwiger's conjecture and related problems for list-coloring, we study graphs $H$ for which every graph with minimum degree at least $|V(H)|-1$ contains $H$ as a minor. We prove that a large class of apex-outerplanar graphs satisfies this property. Our result gives the first examples of such graphs whose vertex cover numbers are significantly larger than half of the number of its vertices, which breaks a barrier for attacking related coloring problems via extremal functions, and recovers all known such graphs that have arbitrarily large maximum degree. Our proof can be adapted to directed graphs to show that if $\vec H$ is the digraph obtained from a directed cycle or an in-arborescence by adding an apex source, then every digraph with minimum out-degree $|V(\vec H)|-1$ contains $\vec H$ as a subdivision or a butterfly minor respectively. These results provide the optimal upper bound for the chromatic number and dichromatic number of graphs and digraphs that do not contain the aforementioned graphs or digraphs as a minor, butterfly minor and a subdivision, respectively. Special cases of our results solve an open problem of Aboulker, Cohen, Havet, Lochet, Moura and Thomassé and strengthen results of Gishboliner, Steiner and Szabó.

Given any pair of quantum channels $Φ_1,Φ_2$ such that at least one of them has Kraus rank one, as well as any respective Stinespring isometries $V_1,V_2$, we prove that there exists a unitary $U$ on the environment such that $\|V_1-({\bf1}\otimes U)V_2\|_\infty\leq\sqrt{2\|Φ_1-Φ_2\|_\diamond}$. Moreover, we provide a simple example which shows that the factor $\sqrt2$ on the right-hand side is optimal, and we conjecture that this inequality holds for every pair of channels.

We prove the dynamical Manin-Mumford conjecture for regular polynomial maps of A^2 and irreducible curves avoiding super-attracting orbits at infinity, over any field of characteristic 0.

We develop a nilpotent approximation theory for Smith ideals, extending adic completion for commutative rings to monoid objects in locally presentable symmetric monoidal abelian categories and to $\mathbb{E}_\infty$-algebra objects in stable symmetric monoidal model categories. The main result is a formal completeness theorem: finite generation of a Smith ideal forces completeness of its nilpotent approximation. This gives a categorical analogue of the finite generation completeness phenomenon in classical adic completion, while remaining distinct from ordinary adic completion of quotient rings. As applications, we construct an almost mathematics version of nilpotent approximation and prove a homotopical completeness theorem for weakly compact Smith ideals. We then apply the general theory to motivic spectra. For the canonical morphism from algebraic cobordism to algebraic K-theory, we construct the corresponding K-theoretic nilpotent approximation of algebraic cobordism, prove its homotopical completeness and Bott periodicity, and establish a mod-$\ell$ Gabber rigidity theorem for the analogous approximation of $\mathbf{MGL}/\ell$ by $\mathbb{K}/l$.

We present general reduction procedures for Courant, Dirac and generalized complex structures, in particular when a group of symmetries is acting. We do so by taking the graded symplectic viewpoint on Courant algebroids and carrying out graded symplectic reduction, both in the coisotropic and hamiltonian settings. Specializing the latter to the exact case, we recover in a systematic way the reduction schemes of Bursztyn-Cavalcanti-Gualtieri.

The K-energy functional is extended to complexified Kähler classes, providing a variational approach to study the scalar curvature equation with B-field introduced by Schlitzer and Stoppa. The extended K-energy is convex along geodesics in the space of almost calibrated representatives of the complexified Kähler class. This fact is used to show that, in some situations, solutions of the scalar curvature equation with B-field are unique in their class, up to pullbacks by reduced automorphisms of the manifold.

We extend discrete Morse-Bott theory to the setting of loop-free (or acyclic) categories. First of all, we state a homological version of Quillen's Theorem A in this context and introduce the notion of cellular categories. Second, we present a notion of vector field for loop-free categories. Third, we prove a homological collapsing theorem in the absence of critical objects in order to obtain the Morse inequalities. Examples are provided through the exposition. This answers partially a question by T. John: whether there is a Morse theory for loop-free (or acyclic) categories? [14].

We define the eñe product for the multiplicative group of polynomials and formal power series with coefficients on a commutative ring and unitary constant coefficient. This defines a commutative ring structure where multiplication is the additive structure and the eñe product is the multiplicative one. For polynomials with complex coefficients, the eñe product acts as a multiplicative convolution of their divisor. We study its algebraic properties, its relation to symmetric functions on an infinite number of variables, to tensor products, and Hecke operators. The exponential linearizes also the eñe product. The eñe product extends to rational functions and formal meromorphic functions. We also study the analytic properties over the complex numbers, and for entire functions. The eñe product respects Hadamard-Weierstrass factorization and is related to the Hadamard product. The eñe product plays a central role in predicting the phenomenon of the "statistics on Riemann zeros" for Riemann zeta function and general Dirichlet $L$-functions discovered by the author. It also gives reasons to believe in the Riemann Hypothesis as explained in the survey "Notes on the Riemann Hypothesis".

In this paper, we give an axiomatic characterization of the cap product in the Hochschild theory of associative unital algebras which are projective over a commutative unital ring. We also give an interpretation of the cap product with coefficients in the algebra via chain maps. We illustrate these results by computing the cap product for truncated polynomial algebras $k[x]/(x^N)$ and for polynomial algebras, where it is identified with the contraction of differential forms by polyvector fields.

We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the product of the sizes of the vertices. We provide an explicit expression for the fluid limit of the number of connected components normalized by its initial value, when the time is smaller than the inverse of the sum of the square of the initial vertex sizes. We also identify the diffusion limit of the rescaled fluctuations around the fluid limit. This is applied to several examples. In the particular setting of the Erdős-Rényi graph process, we explicit the fluid limit of the number of connected components normalized, and the diffusion limit of the scaled fluctuations in the sub-critical regime, where the mean degree is between zero and one.

In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in signal processing. In particular, we derive the exact joint and marginal distributions for two steps, numerical solutions for a general number of steps, and approximations for a large number of steps. Furthermore, we provide an exact characterization of the support for an arbitrary number of steps. The results in this work provide a reference for future work involving such problems.

We present two improvements to arithmetic in the Jacobian of global function fields based on the approach of Hess. The first reduces the number of expensive reduction steps by optimizing for typical inputs rather than worst-case behavior, assuming the function field contains a degree-one place. The second introduces a memory-time trade-off that speeds up computations by caching frequently used intermediate results. Our asymptotic analysis and empirical experiments show that our improved algorithms are significantly faster in practice than previously published methods. To the best of our knowledge, our publicly-available software implementation of Jacobian arithmetic is the first to support unique representatives of divisor classes.

We investigate the Magnus expansion for a generic time-dependent two-level system under single-axis driving.By virtue of the su(2) Lie algebra, the expansion is decomposed into a commutator-free form. To illustrate the usefulness of the gained expression, we then revisit the Landau-Zener-Stückelberg-Majorana model, with a focus on non-adiabatic transitions as well as the Stokes phase. In addition, the semiclassical Rabi model is systematically treated by determining the Floquet quasienergy up to different orders. We demonstrate how to employ suitable picture transformations as well as on how to enforce the symmetry of the underlying model in order to guarantee convergence of the expansion as well as to achieve satisfactory agreement with the exact results. For both models that we studied it turns out that a third order approximation yields results that are in next to perfect agreement with exact analytical ones. Surprisingly, in the case of the semiclassical Rabi model, even the second order Magnus approximation in the adiabatic picture produces almost exact results for a large parameter range.

We address the inverse problem of recovering a degeneracy point within the diffusion coefficient of a one-dimensional complex parabolic equation by observing the normal derivative at one point of the boundary. The strongly degenerate case is analyzed. In particular, we derive sufficient conditions on the initial data that guarantee the stability and uniqueness of the solution obtained from a one-point measurement. Moreover, we present more general uniqueness theorems, which also cover the identification of the initial data, the coefficient of the zero order term and the degeneracy power, using measurements taken over time. Our method is based on a careful analysis of the spectral problem and relies on an explicit form of the solution in terms of Bessel functions. Our investigation also covers the case of real 1-D degenerate parabolic systems of equations coupled with a specific structure. Theoretical results are also supported by numerical simulations.

We develop a geometric approach to the regularized double shuffle relations for multiple zeta values, based on convolution of perverse sheaves on $\mathbb{C}^*$ and inspired by the approach of Deligne and Terasoma. We introduce semi-holonomy isomorphisms associated with pro-unipotent paths and show that their compatibility with multiplicative convolution is equivalent to a condition on the pro-unipotent fundamental group, the homological pentagon equation. We prove that this condition is equivalent to the regularized double shuffle relations, yielding a geometric proof that the pentagon equation implies these relations. The approach is purely topological and avoids Hodge-theoretic and Tannakian methods.

In this paper, we introduce a new semi-discrete modulus of smoothness, which generalizes the definition given by Kolomoitsev and Lomako (KL) in 2023 (in the paper published in the J. Approx. Theory), and we establish very general one- and two- sided error estimates under non-restrictive assumptions for pointwise linear operators. The proposed results have been proved exploiting the regularization and approximation properties of certain Steklov integrals introduced by Sendov and Popov in 1983. By the definition of semi-discrete moduli of smoothness here proposed, we derive sharper estimates than those that can be achieved by the classical averaged moduli of smoothness ($τ$-moduli). Furthermore, a Rathore-type theorem is established, and a new notion of K-functional is also introduced showing its equivalence with the semi-discrete modulus of smoothness and its realization. One-sided estimates of approximation can be established for classical operators on bounded domains, such as the Bernstein polynomials. In the case of approximation operators on the whole real line, one-sided estimates can be achieved, e.g., for the Shannon sampling (cardinal) series, as well as for the so-called generalized sampling operators.

Given a closed, oriented Lagrangian submanifold $L$ in a Liouville domain $\overline{M}$, one can define a Maurer-Cartan element with respect to a certain $L_\infty$-structure on the string homology $\widehat{H}_\ast^{S^1}(\mathcal{L}L;\mathbb{R})$, completed with respect to the action filtration. When the first Gutt-Hutchings capacity of $\overline{M}$ is finite, and $L$ is a $K(π,1)$ space, we show that $L$ bounds a pseudoholomorphic disc of Maslov index 2. This confirms a general form of Audin's conjecture and generalizes the works of Fukaya and Irie in the case of $\mathbb{C}^n$ to a wide class of Liouville manifolds, which includes low degree smooth affine hypersurfaces in $\mathbb{C}^{n+1}$. In particular, when $\dim_\mathbb{R}(\overline{M})=6$, every closed, orientable, prime Lagrangian 3-manifold $L\subset\overline{M}$ is diffeomorphic either to a spherical space form, or $S^1\timesΣ_g$, where $Σ_g$ is a closed oriented surface.

We introduce the notion of Karamata regular operators, which is a notion of regularity that is suitable for obtaining concrete convergence rates for common fixed point problems. This provides a broad framework that includes, but goes beyond, Hölderian error bounds and Hölder regular operators. By concrete, we mean that the rates we obtain are explicitly expressed in terms of a function of the iteration number $k$ instead, of say, a function of the iterate $x^k$. While it is well-known that under Hölderian-like assumptions many algorithms converge linearly/sublinearly (depending on the exponent), little it is known when the underlying problem data does not satisfy Hölderian assumptions, which may happen if a problem involves exponentials and logarithms. Our main innovation is the usage of the theory of regularly varying functions which we showcase by obtaining concrete convergence rates for quasi-cylic algorithms in non-Hölderian settings. This includes certain rates that are neither sublinear nor linear but sit somewhere in-between, including a case where the rate is expressed via the Lambert W function. Finally, we connect our discussion to o-minimal geometry and show that, under mild assumptions, definable operators in any o-minimal structure are always Karamata regular.

These notes provide a detailed and self-contained exposition of basic theory of CP maps and continuous-time Markovian evolution.The infinite-dimensional (separable) setting is handled as an extension of the finite-dimensional one.The treatment stands on two legs.For the finite-dimensional part, a basis-free version of the Choi-Jamiolkowski isomorphism called simply Jamiolkowski transform.And, for the extension, the ground matrix element topology (GMET), which does for the superoperators on trace-class operators what the weak-operator topology does for bounded operators on a Hilbert space. Background in open quantum systems or quantum information theory is not assumed.

In this paper, we propose a neural multiscale decomposition method (NeuralMD) for solving the nonlinear Klein-Gordon equation (NKGE) with a dimensionless parameter $\varepsilon\in(0,1]$ from the relativistic regime to the nonrelativistic limit regime. The solution of the NKGE propagates waves with wavelength at $O(1)$ and $O(\varepsilon^2)$ in space and time, respectively, which brings the oscillation in time. Existing collocation-based methods for solving this equation lead to spectral bias and propagation failure. To mitigate the spectral bias induced by high-frequency time oscillation, we employ a multiscale time integrator (MTI) to absorb the time oscillation into the phase. This decomposes the NKGE into a nonlinear Schrödinger equation with wave operator (NLSW) with well-prepared initial data and a remainder equation with small initial data. As $\varepsilon \to 0$, the NKGE converges to the NLSW at rate $O(\varepsilon^{2})$, and the contribution of the remainder equation becomes negligible. Furthermore, to alleviate propagation failure caused by medium-frequency time oscillation, we propose a gated gradient correlation correction strategy to enforce temporal coherence in collocation-based methods. As a result, the approximation of the remainder term is no longer affected by propagation failure. Comparative experiments with existing collocation-based methods demonstrate the superior performance of our method for solving the NKGE with various regularities of initial data over the whole regime.

A proper-time method for constructing models of dynamic gravitational-wave fields is presented. Using the proper-time method, analytical (not numerical) models of secondary gravitational waves are constructed as perturbative solutions of linearized field equations against the background of the exact wave solution of Einstein's equations for the vacuum in the Bianchi VI universe in a privileged wave coordinate system. Relations for the proper time of test particles against the background of a strong gravitational wave are used. The analytical form of the metric components for secondary gravitational waves is found from compatibility conditions for the field equations. From the field equations, an explicit form of ordinary differential equations and their solutions is obtained for functions included in small corrections to the metric for secondary gravitational waves. It is shown that there exists a continuum of gravitational wave parameters for which the perturbative solutions are stable.

Valley splitting in strained Si/SiGe quantum wells is a central parameter for silicon spin qubits and is commonly described with envelope-function and effective-mass theories. These models provide a computationally efficient continuum description and have been shown to agree well with atomistic approaches when the confinement potential is slowly varying on the lattice scale. In modern Si/SiGe heterostructures with atomically sharp interfaces and engineered Ge concentration profiles, however, the slowly varying potential approximation underlying conventional (local) envelope-function theory is challenged. We formulate an exact multi-valley envelope-function model by combining Burt-Foreman-type envelope-function theory, which does not rely on the assumption of a slowly varying potential, with a valley-sector decomposition of the Brillouin zone. This construction enforces band-limited envelopes, which satisfy a set of coupled integro-differential equations with a non-local potential energy operator. Using degenerate perturbation theory, we derive the intervalley coupling matrix element within this non-local model and prove that it is strictly invariant under global shifts of the confinement potential (choice of reference energy). We then show that the conventional local envelope model generically violates this invariance due to spectral leakage between valley sectors, leading to an unphysical energy-reference dependence of the intervalley coupling. The resulting ambiguity is quantified by numerical simulations of various engineered Si/SiGe heterostructures. Finally, we propose a simple spectrally filtered local approximation that restores the energy-reference invariance exactly and provides a good approximation to the exact non-local theory.

We provide a structural analysis for McCarthy algebras, the variety generated by the three-element algebra defining the logic of McCarthy (the non-commutative version of Kleene three-valued logics). Our analysis will be conducted in a very general algebraic setting by introducing McCarthy algebras as a subvariety of unital bands (idempotent monoids) equipped with an involutive (unary) operation $'$ satisfying $x''\approx x$; herein referred to as i-ubands. Prominent (commutative) subvarieties of i-ubands include Boolean algebras, ortholattices, Kleene algebras, and involutive bisemilattices, hence i-ubands provides an algebraic common ground for several non-classical logics. Our main contributions consist in providing for McCarthy algebras: reduced and equivalent axiomatizations; a semilattice decomposition theorem; and representations as certain decorated posets from which the algebraic structure can be uniquely determined.

A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.

Max-plus algebra is a semiring with addition $a\oplus b = \max(a,b)$ and multiplication $a\otimes b = a+b$. It is applied in cases, such as combinatorial optimization and discrete event systems. We consider the power of max-plus square matrices, which is equivalent to obtaining the all-pair maximum weight paths with a fixed length in the corresponding weighted digraph. Each $n$-by-$n$ matrix admits the CSR expansion that decomposes the matrix into a sum of at most $n$ periodic terms after $O(n^{2})$ times of powers. In this study, we propose an $O(n(m+n \log n))$ time algorithm for the CSR expansion, where $m$ is the number of nonzero entries in the matrix, which improves the $O(n^{4} \log n)$ algorithm known for this problem. Our algorithm is based on finding the roots of the characteristic polynomial of the max-plus matrix. These roots play a similar role to the eigenvalues of the matrix, and become the growth rates of the terms in the CSR expansion.

The Richards equation, a nonlinear elliptic parabolic equation, is widely used to model infiltration in porous media. We develop a finite element method for solving the Richards equation by introducing a new bounded auxiliary variable to eliminate unbounded terms in the weak formulation of the method. This formulation is discretized using a semi-implicit scheme and the resulting nonlinear system is solved using Newton's method. Our approach eliminates the need of regularization techniques and offers advantages in handling both dry and fully saturated zones. In the proposed techniques, a non-overlapping Schwarz domain decomposition method is used for modeling infiltration in layered soils. We apply the proposed method to solve the Richards equation using the Havercamp and van Genuchten models for the capillary pressure. Numerical experiments are performed to validate the proposed approach, including tests such as modeling flows in fibrous sheets where the initial medium is totally dry, two cases with fully saturated and dry regions, and an infiltration problem in layered soils. The numerical results demonstrate the stability and accuracy of the proposed numerical method. The numerical solutions remain positive in the presence of totally dry zones. The numerical investigations clearly demonstrated the capability of the proposed method to effectively predict the dynamics of flows in unsaturated soils.

A complex hyperplane arrangement $\mathcal{A}$ is said to be decomposable if there are no elements in the degree 3 part of its holonomy Lie algebra besides those coming from the rank 2 flats. When this purely combinatorial condition is satisfied, it is known that the associated graded Lie algebra of the arrangement group $G$ decomposes (in degrees greater than 1) as a direct product of free Lie algebras. It follows that the $I$-adic completion of the Alexander invariant $B(G)$ also decomposes as a direct sum of "local" invariants and the Chen ranks of $G$ are the sums of the local contributions. Moreover, if $B(G)$ is separated, then the degree 1 cohomology jump loci of the complement of $\mathcal{A}$ have only local components, and the algebraic monodromy of the Milnor fibration is trivial in degree 1.

In this paper, we study how to find rational motions that move a line along a given rational ruled surface. Our goal is to find motions with the lowest possible degree using dual quaternions. While similar problems for point trajectories are well known, the case of line trajectories is more complicated and has not been studied. We explain when such motions exist and how to compute them. Our method gives explicit formulas for constructing these motions and shows that, in many cases, the solution is unique. We also show examples and explain how to use these results to design simple mechanisms that move a line in the desired way. This work helps to better understand the relationship between rational motions and ruled surfaces and may be useful for future research in mechanism design.

Data consisting of a graph with a function mapping into $\mathbb{R}^d$ arise in many data applications, encompassing structures such as Reeb graphs, geometric graphs, and knot embeddings. As such, the ability to compare and cluster such objects is required in a data analysis pipeline, leading to a need for distances between them. In this work, we study the interleaving distance on discretization of these objects, called mapper graphs when $d=1$, where functor representations of the data can be compared by finding pairs of natural transformations between them. However, in many cases, computation of the interleaving distance is NP-hard. For this reason, we take inspiration from recent work by Robinson to find quality measures for families of maps that do not rise to the level of a natural transformation, called assignments. We then endow the functor images with the extra structure of a metric space and define a loss function which measures how far an assignment is from making the required diagrams of an interleaving commute. Finally we show that the computation of the loss function is polynomial with a given assignment. We believe this idea is both powerful and translatable, with the potential to provide approximations and bounds on interleavings in a broad array of contexts.