Tootfinder

This https://arxiv.org/abs/2503.11804 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_grqc_…

Hyperboloidal initial data without logarithmic singularities
Andersson and Chruściel showed that generic asymptotically hyperboloidal initial data sets admit polyhomogeneous expansions, and that only a non-generic subclass of solutions of the conformal constraint equations is free of logarithmic singularities. The purpose of this work is twofold. First, within the evolutionary framework of the constraint equations, we show that the existence of a well-defined Bondi mass brings the asymptotically hyperboloidal initial data sets into a subclass whose Cauc…

On the Ding and Helleseth's 8th open problem about optimal ternary cyclic codes
Dong He, Peipei Zheng, Qunying Liao
https://arxiv.org/abs/2506.09651 ht…

On the Ding and Helleseth's 8th open problem about optimal ternary cyclic codes
The cyclic code is a subclass of linear codes and has applications in consumer electronics, data storage systems and communication systems due to the efficient encoding and decoding algorithms. In 2013, Ding, et al. presented nine open problems about optimal ternary cyclic codes. Till now, the 1st, 2nd, 6th and 7th problems were completely solved, the 3rd, 8th and 9th problems were incompletely solved. In this manuscript, we focus on the 8th problem. By determining the root set of some special …

Identifying Merger-Driven Long Gamma-Ray Bursts based on Machine Learning
Si-Yuan Zhu, Hui-Ying Deng, Fu-Wen Zhang, Qian-Zi Mo, Pak-Hin Thomas Tam
https://arxiv.org/abs/2506.08675

Identifying Merger-Driven Long Gamma-Ray Bursts based on Machine Learning
Gamma-ray bursts (GRBs) are classified as Type I GRBs originated from compact binary mergers and Type II GRBs originated from massive collapsars. While Type I GRBs are typically shorter than 2 seconds, recent observations suggest that some extend to tens of seconds, forming a potential subclass, Type IL GRBs. However, apart from their association with kilonovae, so far no rapid identification is possible. Given the uncertainties and limitations of optical and infrared afterglow observations, an…

The error-correcting pair for several classes of NMDS linear codes
Dong He, Zhaohui Zhang, Qunying Liao
https://arxiv.org/abs/2506.07380 https://

The error-correcting pair for several classes of NMDS linear codes
The error-correcting pair is a general algebraic decoding method for linear codes. The near maximal distance separable (NMDS) linear code is a subclass of linear codes and has applications in secret sharing scheme and communication systems due to the efficient performance, thus we focus on the error-correcting pair of NMDS linear codes. In 2023, He and Liao showed that for an NMDS linear code $\mathcal{C}$ with minimal distance $2\ell+1$ or $2\ell+2$, if $\mathcal{C}$ has an $\ell$-error-correc…

Phase transitions induced by resonant light: a phenomenological approach
A. Kudlis, L. S. Ricco, H. Sigur{\dh}sson, I. A. Shelykh
https://arxiv.org/abs/2506.05964

Phase transitions induced by resonant light: a phenomenological approach
We present a phenomenological framework to describe a subclass of light-induced phase transitions (LIPTs) in condensed matter systems, specifically those mediated by the resonant generation of excitons. Our approach extends the classical Landau theory by introducing dynamic coupling between the system's order parameter and complex excitonic fields, along with Langevin-type forces that drive the system toward states of minimal free energy. The model is applied in the context of all-optical reson…

The minimum size of maximal bipartite IC-plane graphs with given connectivity
Guiping Wang, Yuanqiu Huang, Zhangdong Ouyang, Licheng Zhang
https://arxiv.org/abs/2506.00878

The minimum size of maximal bipartite IC-plane graphs with given connectivity
Recently, the problem of establishing bounds on the edge density of 1-planar graphs, including their subclass IC-planar graphs, has received considerable attention. In 2018, Angelini et al. showed that any n-vertex bipartite IC-planar graph has at most 2.25n-4 edges, which implies that bipartite IC-planar graphs have vertex-connectivity at most 4. In this paper, we prove that any n-vertex maximal bipartite IC-plane graph with connectivity 2 has at least 3/2n-2 edges, and those with connectivity…

Linearly Distributive Fox Theorem
Rose Kudzman-Blais
https://arxiv.org/abs/2506.02180 https://arxiv.org/pdf/2506.02180

Linearly Distributive Fox Theorem
Linearly distributive categories (LDC), introduced by Cockett and Seely to model multiplicative linear logic, are categories equipped with two monoidal structures that interact via linear distributivities. A seminal result in monoidal category theory is the Fox theorem, which characterizes cartesian categories as symmetric monoidal categories whose objects are equipped with canonical comonoid structures. The aim of this work is to extend the Fox theorem to LDCs and characterize the subclass of …

Multi-sample rank tests for location against Lehmann-type alternatives
Nikolay I. Nikolov, Eugenia Stoimenova
https://arxiv.org/abs/2506.01914 https://

Multi-sample rank tests for location against Lehmann-type alternatives
This paper deals with testing the equality of $k$ ($k\ge 2$) distribution functions against possible stochastic ordering among them. Two classes of rank tests are proposed for this testing problem. The statistics of the tests under study are based on precedence and exceedance statistics and are natural extension of corresponding statistics for the two-sample testing problem. Furthermore, as an extension of the Lehmann alternative for the two-sample location problem, we propose a new subclass of…

Complex wave functions, CPT and quantum field theory for classical generalized Ising models
Christof Wetterich
https://arxiv.org/abs/2505.24392 https://

Complex wave functions, CPT and quantum field theory for classical generalized Ising models
The quantum or quantum field theory concept of a complex wave function is useful for understanding the information transport in classical statistical generalized Ising models. We relate complex conjugation to the discrete transformations charge conjugation ($C$), parity ($P$) and time reversal ($T$). A subclass of generalized Ising models are probabilistic cellular automata (PCA) with deterministic updating and probabilistic initial conditions. Two-dimensional PCA correspond to discretize…

This https://arxiv.org/abs/2505.13653 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_…

UGC 10043 in Depth: Dissecting the Polar Bulge and Subtle LSB Features
Galaxies with polar structures -- of which polar-ring galaxies (PRGs) are a prominent subclass -- contain components that are kinematically decoupled and highly inclined relative to the host galaxy's major axis. Modern deep optical surveys provide a powerful means of detecting low surface brightness (LSB) features around galaxies, offering critical insights into the formation and evolution of galaxies with polar structures. UGC 10043 is an edge-on galaxy notable for its prominent bulge, which e…

This https://arxiv.org/abs/2412.17187 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Generalized Homogeneous Derivations of Graded Rings
In this manuscript, we introduce a novel concept in graded rings called generalized homogeneous derivations, which serve as a natural generalization of the homogeneous derivations introduced by Kanunnikov. We establish the specialized notion of gr-generalized derivations, a subclass that preserves the degree of homogeneous elements. We extend several significant results, originally established for prime rings, to the context of gr-prime rings. Furthermore, we characterize when gr-semiprime ring…

MemAscend: System Memory Optimization for SSD-Offloaded LLM Fine-Tuning
Yong-Cheng Liaw, Shuo-Han Chen
https://arxiv.org/abs/2505.23254 https://

MemAscend: System Memory Optimization for SSD-Offloaded LLM Fine-Tuning
Owing to the huge success of generative artificial intelligence (AI), large language models (LLMs) have emerged as a core subclass, underpinning applications such as question answering, text generation, and code completion. While fine-tuning these models on domain-specific data can yield significant performance gains, it also poses daunting computational challenges, especially for researchers and small organizations with limited hardware resources. Although SSD offloading (i.e., ZeRO-Infinity) …