Three Exceptional Values Do Not Force Bounded Type
A symmetric meromorphic construction places the preimages of 0, 1, and infinity on the real axis while making every other point divisor non-Blaschke in both half-planes.
Aug 29, 20264 min2608.26062
Mathematics
Pure and applied mathematics including algebra, analysis, geometry, and combinatorics.
Sort:
Calabi Curvature Operator Characterizes Complex Projective Space
A new Bochner identity turns a Calabi-operator positivity condition into a rigidity result for Kähler–Einstein manifolds.
Aug 26, 20263 min2608.23778
Empirical Likelihood Preserves Shape in Covariate-Adjusted Trials
A covariate-balanced empirical measure lets randomized-experiment analyses improve efficiency while retaining valid distribution and survival-curve shape.
Aug 24, 20263 min2608.19423
Hypergraph Alon-Tarsi Bounds Track Edge Density
Permuting nonconstant edge coefficients gives an arbitrary-field bound of $2\lceil\mathrm{ed}(H)\rceil+1$, connecting polynomial structure to hypergraph density.
Aug 21, 20264 min2501.00157
Two Rainbow Cycles Extend Lehel’s Partition Theorem
Under proper edge colouring, an existence proof partitions every sufficiently large complete graph into two vertex-disjoint rainbow cycles.
Aug 19, 20264 min2608.17996
Halpern Iteration Improves Higher-Order MVI Complexity Bounds
A large-step inexact Halpern wrapper accelerates tensor-based monotone variational-inequality solvers from polynomial rates up to a claimed near-$T^{-p}$ convergence rate.
Aug 16, 20264 min2608.08463
Universal Density Parameter Determines Graph Percolation Thresholds
Unfolding and refolding witness graphs lets the authors characterize critical activation density for every fixed graph H, including witnesses larger than the host graph.
Aug 14, 20264 min2605.15066
Non-Backtracking Walks Reach Collisions Near the Square-Root Scale
Expected self-intersection time is O(√n log n) on bounded-degree graphs and O(√n) for regular graphs with a uniform spectral gap.
Aug 11, 20263 min2608.09729
Comparability-Graph Unions Can Have Chromatic Number k^d
For every positive d and k, the authors construct a union of d comparability graphs with clique number k and chromatic number k^d, extending the separation to fractional coloring and the independence ratio.
Aug 9, 20262 min2606.09415
Reflection Labels Establish Shellability for Shifted Lower Bruhat Intervals
An explicit reflection labeling gives every shifted lower interval a controlled chain structure across arbitrary Coxeter groups.
Aug 6, 20264 min2608.04417