517 papers
This section explores the dynamic transition from Cesium to Darmstadtium, a journey through the periodic table that reveals how elements behave as we move from stable, well-known metals to the fleeting, superheavy nuclei created in particle accelerators. These studies delve into the extreme limits of atomic structure, testing our understanding of quantum mechanics and the forces that hold matter together under conditions found nowhere else on Earth.
Every new preprint in this category is sourced directly from arXiv, where researchers first share their latest findings. At Gist.Science, we process each of these documents as they appear, transforming complex academic data into both accessible plain-language overviews and detailed technical summaries to ensure these breakthroughs are understandable to everyone.
Below are the latest papers covering these fascinating discoveries in nuclear and atomic physics.
Using flag algebras, this paper proves that a uniformly random red/blue edge coloring asymptotically maximizes the number of color-alternating 6-cycles in a large clique, thereby resolving the first open case of a problem posed by Basit et al.
This paper presents an efficient online algorithm based on a Metropolis fixed-point walk that extends the validity of the Beck–Fiala conjecture to logarithmic sparsity () by minimizing prefix discrepancy, a result developed with significant assistance from an AI language model.
This paper demonstrates that Floyd's subset sampler admits an exact round-local factorization of its internal ordering coordinate, enabling the precise recycling of this randomness into a residual state to achieve a complete state-space factorization without binomial arithmetic, while proving that such immediate rank recycling is invalid for partial Fisher-Yates arrays.
This paper presents a 5-factor approximation algorithm for the Minimum Semitotal Domination problem on unit disk graphs that runs in time, improving upon the previously known 5.75-approximation with complexity.
This paper confirms a conjecture by Bang-Jensen, Picasarri-Arrieta, and Yeo by characterizing the specific subtournaments that must appear in tournaments with large acyclic dichromatic numbers, thereby establishing a local-to-global property for this parameter.
This paper establishes a new lower bound of 4 for the competitive ratio of the online graph exploration problem, improving upon the previous 10/3 bound by demonstrating that specific behavioral restrictions and graph properties can be assumed without affecting the ratio.
This paper establishes conditions for achieving optimal uniformity () in Quasi-Monte Carlo sequences by utilizing Artin-Schreier polynomials and a fast greedy procedure to construct high-dimensional, perfectly equidistributed sampling sequences.
This paper presents new, longer induced paths (snakes) in hypercube graphs for dimensions 9 through 13, thereby improving the known lower bounds for the snake-in-the-box problem and providing a computer-verifiable dataset of these record-length paths.
This paper introduces a novel reduction from matroid optimization to basis search for binary matroids that significantly improves query complexity to while maintaining parallel rounds by leveraging a new optimality certificate based on cocircuits and lattice theory.
This paper introduces a graph-theoretic framework using discrete sheaves to diagnose and localize inconsistencies in preference aggregation by identifying specific voter pairs that fail to cohere through an Obstruction Locus and Incompatibility Index, offering a purely ordinal alternative to linearization methods like HodgeRank.