6835 papers
This paper investigates the large deviations of subgraph counts in inhomogeneous random graphs with power-law degree distributions, establishing that rare events involving numerous subgraphs correspond to the emergence of extreme hubs and deriving sharp results for clique counts when the expected subgraph number is sublinear.
This paper characterizes the real laminations of cubic polynomials on the tame boundaries of hyperbolic components of types (A), (B), and (C) by proving they are generated by the component's lamination and a single characteristic equivalence class, thereby demonstrating that all such hyperbolic cubic polynomials lack combinatorial rigidity.
This paper presents a novel, scalable computational framework implemented in the open-source SPEED software that combines model order reduction with a high-fidelity Discontinuous Galerkin Spectral Element Method to efficiently simulate the coupled electromechanical-acoustic behavior of large-scale Piezoelectric Micromachined Ultrasonic Transducer (PMUT) arrays.
This paper resolves the open question regarding cyclic permutations that avoid the decreasing pattern and the pattern by deriving explicit formulas through an analysis of cycle form structures and the application of Dilworth's theorem.
This paper establishes that a hyperbolic polynomial with a connected Julia set is combinatorially rigid if and only if it is not of the "disjoint type," specifically proving that polynomials with attracting cycles attracting at least two critical points lack combinatorial rigidity.
This paper establishes that the Fraïssé limit of the class of Boolean algebras of size less than a strongly inaccessible cardinal (under regular embeddings) shares the same completion as the Lévy collapse, while also providing a direct proof that the collapsing algebra of density cannot be expressed as the union of a -chain of regular sub-algebras of density less than .
This paper introduces a new variant of the line-based dial-a-ride problem without time windows, proposes a novel MILP formulation and a branch-and-price algorithm based on generating profitable stopping patterns, and demonstrates through computational experiments that both the exact method and a scalable root node heuristic effectively solve large instances with high efficiency and small optimality gaps.
This paper proposes Belief-Adaptive MAP and Soft BA-MAP detectors that explicitly account for state-dependent noise variance in molecular communication channels, demonstrating significant throughput improvements over conventional methods through simulations and information-theoretic analysis.
This paper establishes a polynomial-based framework linking quasi-twisted codes over finite fields to additive constacyclic codes, providing a one-to-one correspondence that enables the characterization of their respective duals and self-orthogonality conditions through trace and standard inner products.
This paper reinterprets NP witness discovery as an information-acquisition process and demonstrates that in a structureless "psocid" model where witnesses are accessed only via equality probes, the exponentially limited information gain per probe fundamentally prevents reliable recovery within polynomial time, thereby revealing an informational origin for exponential search complexity.
This paper presents explicit infinite families of non-fibered twisted torus knots by demonstrating that the leading coefficients of their Alexander polynomials can assume arbitrary integer values.
This paper provides numerical evidence demonstrating that the Hopf bifurcation occurring at the upper marginal stability curve for various shear flows in the incompressible Navier-Stokes equations is subcritical.
This paper presents a complete classification of spherical knotoids with up to six crossings and a conjectured complete classification up to seven crossings, utilizing a suite of invariants to distinguish equivalence classes while exploring their symmetries and applications to protein entanglement.
This paper establishes a sharp regularity result in spatial variables for distributional solutions to the Navier-Stokes equations that satisfy the Prodi-Serrin condition, without requiring the solutions to belong to the local Leray-Hopf class.
This paper establishes that the singular set in the parabolic obstacle problem for general obstacles has a parabolic Hausdorff dimension of at most , extending a previous result limited to constant Laplacian obstacles by combining a truncated parabolic frequency formula with monotonicity estimates and an iterative argument.
This paper investigates a five-sequence of adjoint functors induced by functions between vertex sets of simplicial complexes, utilizing this structure to establish three categorical frameworks where the Stanley-Reisner correspondence yields dualities with commutative monomial rings.
This paper establishes a large-deviation principle for the maximal energy of a spin glass with spins by deriving a Parisi-type formula for fractional moments and leveraging convex duality to show that the rate function is asymptotically quadratic near its minimum if and only if an external magnetic field is present.
This paper establishes an asymptotic expansion in inverse powers of time for the correlation functions of isometric extensions of volume-preserving Anosov flows defined on Abelian covers of closed manifolds.
This paper establishes the existence of two normalized solutions with a prescribed -norm for the stationary nonlinear Schrödinger equation with a radial potential in the mass-supercritical regime, utilizing Morse theory, spectral arguments, and radial blow-up analysis under minimal assumptions on the potential's sign, behavior at infinity, and regularity.
This paper presents an optimization-based formulation of the Red Light Green Light (RLGL) algorithm for computing stationary distributions of large Markov chains via Dirichlet-energy minimization and coordinate descent, thereby clarifying its behavior, establishing exponential convergence for specific chain classes, and suggesting practical scheduling strategies to accelerate convergence.