7189 papers
This paper derives an exact analytical three-dimensional channel impulse response for a fully absorbing spherical receiver under uniform drift by utilizing joint first-hitting time-location statistics and a Girsanov-based measure change to overcome previous symmetry-breaking limitations.
This paper introduces PANDAExpress, a novel algorithm that eliminates the impractical polylogarithmic factor of the original PANDA framework by employing a new probabilistic inequality and a dynamic hyperplane partitioning scheme, thereby achieving optimal, specialized-algorithm-level runtimes for conjunctive queries and disjunctive datalog rules under arbitrary degree constraints while maintaining full generality.
This paper presents a multiscale optimization framework for Lipschitz continuous functions that accelerates convergence and reduces computational costs by solving coarse-grid problems to warm-start fine-grid iterations, achieving provably tighter error bounds and significant speedups in applications like probability density estimation.
This paper establishes a unified theoretical framework for CUR matrix approximation and the Nyström method by deriving determinant-based error bounds that connect local projection errors to global quality and quantify the benefits of oversampling through volume sampling.
This paper proposes a stochastic gradient descent algorithm that dynamically maximizes revenue in a single-server queue with balking customers by using a novel Infinitesimal Perturbation Analysis procedure to estimate effective arrival rates based solely on observable joining behavior, thereby converging to the optimal price under mild regularity conditions.
This paper demonstrates that designs minimizing variance under a bias constraint, or minimizing bias under a variance constraint, are equivalent to minimax designs with appropriately tuned constants, and conversely, any minimax design solves these constrained optimization problems for suitable bounds.
This paper proposes a new formulation of 3-crossed modules equipped with a novel lifting mechanism, proving that they induce quasi-categories and arise naturally from the Moore complex of length 3, thereby establishing a robust foundation for extending the equivalence between higher algebraic structures and Gray 3-groups.
This paper demonstrates that the optimal homothetic quadratic discrepancy for planar convex bodies does not necessarily follow a single order of growth, but can instead exhibit prescribed polynomial-order oscillations between logarithmic and square-root rates depending on the geometry of the boundary.
This paper employs topological and ergodic perspectives, including thermodynamic formalism and Alexandroff compactification, to prove that the Collatz function possesses a unique cycle with no divergent orbits, while also extending these finiteness and non-divergence results to Baker and Syracuse maps.
This paper establishes a universal, asymptotically optimal concentration bound for sums of arbitrarily dependent random variables by leveraging the subadditivity of expected shortfall and constructing explicit extremal couplings, while providing practical conditions for deriving simple tail profiles based on convex transformation order comparisons.
This paper completes Le Cam's program by establishing a necessary and sufficient condition for the existence of nontrivial hypothesis tests between two sets of probability measures without requiring a common dominating measure, specifically by utilizing the closures of their convex hulls within the space of bounded finitely additive measures.
This paper negatively resolves the question of whether bipartite graphs are well-quasi-ordered by the bipartite minor relation by constructing an infinite set of pairwise incomparable 2-connected bipartite graphs and providing examples that distinguish the bipartite minor relation from the standard graph minor relation.
This paper introduces a novel, heuristic-driven computational method for unit commitment that achieves orders-of-magnitude performance improvements over current state-of-the-art tools without requiring linearized approximations, thereby enabling the analysis of large-scale, complex power systems with volatile loads and distributed generation.
This paper establishes that for a generic set of finite-dimensional irreducible representations of the fundamental group of a surface's unit tangent bundle, the twisted Ruelle zeta function either vanishes at zero with an order determined by the genus or equals the Reidemeister--Turaev torsion, thereby extending Fried's conjecture to generic acyclic representations and confirming the constancy of the vanishing order for untwisted zeta functions across a dense set of Anosov metrics.
This paper computes minimal zero-free regions for the Riemann zeta-function to prove the existence of a prime between consecutive perfect th powers for , specifically establishing this result for and a specific subset of integers for , while quantifying the progress toward Legendre's conjecture.
This paper establishes that the degenerations of cohomological Hall algebras associated with 2-Calabi-Yau categories and preprojective algebras, with respect to the "less perverse" filtration, are isomorphic to the enveloping algebra of the current Lie algebra of the BPS Lie algebra, a result proven at the sheafified level and extended to torus-deformed settings to connect these structures with Maulik-Okounkov Yangians.
This paper establishes a connection between the Bakry-Emery curvature of fractional Laplacian generators and fractional Brownian motion covariance, reformulating curvature inequalities as generalized eigenvalue problems that yield explicit bounds for the Cauchy case and demonstrate a scalar shift under confining drift.
This paper establishes a universality principle for visibility in hyperbolic space, proving that the critical intensity and mean visible volume for a Poisson process of -geodesic hyperplanes are independent of the interpolation parameter and identical to the case of totally geodesic hyperplanes.
This paper establishes concentration bounds for random Euclidean combinatorial optimization problems with -costs in dimensions by combining Poincaré inequalities with robust geometric mechanisms, while proposing a conjectural transfer principle to potentially extend these results to all .
This paper verifies the local analogue of Jiang's conjecture regarding the upper bound of geometric wavefront sets for Arthur type representations of split classical -adic groups with large , thereby establishing related upper bound conjectures by combining Waldspurger's endoscopic transfer with recent wavefront set computations.