Tootfinder

TrajLens: Visual Analysis for Constructing Cell Developmental Trajectories in Cross-Sample Exploration
Qipeng Wang, Shaolun Ruan, Rui Sheng, Yong Wang, Min Zhu, Huamin Qu
https://arxiv.org/abs/2507.15620

TrajLens: Visual Analysis for Constructing Cell Developmental Trajectories in Cross-Sample Exploration
Constructing cell developmental trajectories is a critical task in single-cell RNA sequencing (scRNA-seq) analysis, enabling the inference of potential cellular progression paths. However, current automated methods are limited to establishing cell developmental trajectories within individual samples, necessitating biologists to manually link cells across samples to construct complete cross-sample evolutionary trajectories that consider cellular spatial dynamics. This process demands substantial…

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q 1$
Hengfeng Liu, Chunming Tang, Zhengchun Zhou, Dongchun Han, Hao Chen
https://arxiv.org/abs/2506.16793

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes supporting combinatorial $t$-designs have attracted growing interest, yet constructing such codes remains highly challenging. In 2020, Ding and Tang initiated the study of NMDS codes supporting 2-designs by constructing the first infinite family, followed by severa…

Constructing material network representations for intelligent amorphous alloys design
S. -Y. Zhang, J. Tian, S. -L. Liu, H. -M. Zhang, H. -Y. Bai, Y. -C. Hu, W. -H. Wang
https://arxiv.org/abs/2507.16336

Constructing material network representations for intelligent amorphous alloys design
Designing high-performance amorphous alloys is demanding for various applications. But this process intensively relies on empirical laws and unlimited attempts. The high-cost and low-efficiency nature of the traditional strategies prevents effective sampling in the enormous material space. Here, we propose material networks to accelerate the discovery of binary and ternary amorphous alloys. The network topologies reveal hidden material candidates that were obscured by traditional tabular data r…

Constructing and characterizing prime $\mathbb{Q}$-Fano threefolds of genus one and with six $1/2(1,1,1)$-singularites via key varieties
Hiromichi Takagi
https://arxiv.org/abs/2507.13657

Constructing and characterizing prime $\mathbb{Q}$-Fano threefolds of genus one and with six $1/2(1,1,1)$-singularites via key varieties
We consider the classification problem of prime $\mathbb{Q}$-Fano 3-folds with at most $1/2(1,1,1)$-singularities, which was initiated in [Taka2]. We construct two distinct classes of such 3-folds with genus one and six $1/2(1,1,1)$-singularities, each equipped with a prescribed Sarkisov link. Our method involves constructing certain higher-dimensional $\mathbb{Q}$-Fano varieties $Σ$, referred to as key varieties, by extending the Sarkisov links to higher dimensions. We prove that each such 3-…

No-go theorems for logical gates on product quantum codes
Xiaozhen Fu, Han Zheng, Zimu Li, Zi-Wen Liu
https://arxiv.org/abs/2507.16797 https://

No-go theorems for logical gates on product quantum codes
Quantum error-correcting codes are essential to the implementation of fault-tolerant quantum computation. Homological products of classical codes offer a versatile framework for constructing quantum error-correcting codes with desirable properties, especially quantum low-density parity check (qLDPC) codes. Based on extensions of the Bravyi--König theorem that encompass codes without geometric locality, we establish a series of general no-go theorems for fault-tolerant logical gates supported b…

Approximation of risk-averse optimal feedback control
Philipp A. Guth, Karl Kunisch
https://arxiv.org/abs/2508.15618 https://arxiv.org/pdf/2508.15618

Approximation of risk-averse optimal feedback control
The challenge of constructing feedback control laws for risk-averse optimal control of partial differential equations (PDEs) with random coefficients is addressed. The control objective composes a tracking-type cost with the nonlinear entropic risk measure. A sequential quadratic programming scheme is derived that iteratively solves linear quadratic subproblems obtained through second-order Taylor expansions of the objective functional, with each subproblem re-centered at the previous iterate. …

Hypergraphs on high dimensional time series sets using signature transform
R\'emi Vaucher, Paul Minchella
https://arxiv.org/abs/2507.15802 https://

Hypergraphs on high dimensional time series sets using signature transform
In recent decades, hypergraphs and their analysis through Topological Data Analysis (TDA) have emerged as powerful tools for understanding complex data structures. Various methods have been developed to construct hypergraphs -- referred to as simplicial complexes in the TDA framework -- over datasets, enabling the formation of edges between more than two vertices. This paper addresses the challenge of constructing hypergraphs from collections of multivariate time series. While prior work has fo…

Ramsey-like theorems and immunities
Ahmed Mimouni, Ludovic Patey
https://arxiv.org/abs/2508.15597 https://arxiv.org/pdf/2508.15597

Ramsey-like theorems and immunities
A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are computably trivial, by constructing a computable 2-coloring of $[\mathbb{N}]^2$ such that every infinite set avoiding any pattern computes a diagonally non-computable function relative to $\emptyset'$. We also consider multiple notions of weaknesses based of variants …

Extending Quasi-alternating Links II
Kirandeep Kaur, Sandeep Sharama
https://arxiv.org/abs/2506.16999 https://arxiv.org/pdf/2506.1699…

Extending Quasi-alternating Links II
Champanerkar and Kofman [1] introduced an innovative method for constructing quasi-alternating links by substituting a quasi-alternating crossing c in a quasi-alternating link with a rational tangle of the same type. This construction was later extended by Chbili and Kaur [2] for any alternating tangle of same type. However, this approach does not generally apply to non-alternating tangles or alternating tangles of opposite types, although there are examples where it holds for alternating tan…

Exploring Scaling Laws of CTR Model for Online Performance Improvement
Weijiang Lai, Beihong Jin, Jiongyan Zhang, Yiyuan Zheng, Jian Dong, Jia Cheng, Jun Lei, Xingxing Wang
https://arxiv.org/abs/2508.15326

Exploring Scaling Laws of CTR Model for Online Performance Improvement
CTR models play a vital role in improving user experience and boosting business revenue in many online personalized services. However, current CTR models generally encounter bottlenecks in performance improvement. Inspired by the scaling law phenomenon of LLMs, we propose a new paradigm for improving CTR predictions: first, constructing a CTR model with accuracy scalable to the model grade and data size, and then distilling the knowledge implied in this model into its lightweight model that can…

Sequential Confirmatory Factor Analysis: A Novel Approach to Latent Variable Measurement
Zachary Esses Johnson
https://arxiv.org/abs/2508.15611 https://arx…

Sequential Confirmatory Factor Analysis: A Novel Approach to Latent Variable Measurement
Factor score estimation in small sample sizes often encounters parameter bias and convergence failures when constructing hierarchical national/sub-national indices. This paper proposes a novel method for hierarchical factor analysis called "sequential Confirmatory Factor Analysis". Instead of estimating multiple levels of factors at the same time, this approach calculates factor scores sequentially from the lowest to highest levels. This sequential estimation keeps the original sample size in e…

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
Mahmood K. M. Almansoori, Miklos Telek
https://arxiv.org/abs/2507.14261

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
We present Fast Approximate Minimum Spanning Tree (FAMST), a novel algorithm that addresses the computational challenges of constructing Minimum Spanning Trees (MSTs) for large-scale and high-dimensional datasets. FAMST utilizes a three-phase approach: Approximate Nearest Neighbor (ANN) graph construction, ANN inter-component connection, and iterative edge refinement. For a dataset of $n$ points in a $d$-dimensional space, FAMST achieves $\mathcal{O}(dn \log n)$ time complexity and $\mathcal{O}…

The infinitesimal structure of manifolds with non-continuous Riemannian metrics
Vanessa Ryborz
https://arxiv.org/abs/2507.14726 https://

The infinitesimal structure of manifolds with non-continuous Riemannian metrics
This paper investigates the failure of certain metric measure spaces to be infinitesimally Hilbertian or quasi-Riemannian manifolds, by constructing examples arising from a manifold $M$ endowed with a Riemannian metric $g$ that is possibly discontinuous, with $g, g^{-1} \in L^\infty_{\mathrm{loc}} $ and $ g \in W^{1,p}_{\mathrm{loc}}$ for $ p < \mathrm{dim} M - 1 $.

Dehnen-type dark matter wormholes in the $f(\mathcal{R},\mathcal{L}_m,\mathcal{T})$ action
A. Errehymy, O. Donmez, B. Turimov, K. Myrzakulov, N. Alessa, A. -H. Abdel-Aty
https://arxiv.org/abs/2507.16465

Dehnen-type dark matter wormholes in the $f(\mathcal{R},\mathcal{L}_m,\mathcal{T})$ action
We are exploring the possibility of traversable wormholes existing in a more realistic context. Specifically, we are looking at scenarios that don't rely on exotic factors, like having a mass shell at the throat or allowing particles and antiparticles to coexist without annihilation. To do this, we are constructing wormholes with double power-law density distributions, drawing inspiration from the Dehnen-type dark matter halo in the framework of generalized geometry-matter coupling gravity. Our…

Data-Driven Abstraction and Synthesis for Stochastic Systems with Unknown Dynamics
Mahdi Nazeri, Thom Badings, Anne-Kathrin Schmuck, Sadegh Soudjani, Alessandro Abate
https://arxiv.org/abs/2508.15543

Data-Driven Abstraction and Synthesis for Stochastic Systems with Unknown Dynamics
We study the automated abstraction-based synthesis of correct-by-construction control policies for stochastic dynamical systems with unknown dynamics. Our approach is to learn an abstraction from sampled data, which is represented in the form of a finite Markov decision process (MDP). In this paper, we present a data-driven technique for constructing finite-state interval MDP (IMDP) abstractions of stochastic systems with unknown nonlinear dynamics. As a distinguishing and novel feature, our te…

Adaptive Sketching Based Construction of H2 Matrices on GPUs
Wajih Halim Boukaram, Yang Liu, Pieter Ghysels, Xiaoye Sherry Li
https://arxiv.org/abs/2506.16759

Adaptive Sketching Based Construction of H2 Matrices on GPUs
We develop a novel linear-complexity bottom-up sketching-based algorithm for constructing a $H^2$ matrix, and present its high performance GPU implementation. The construction algorithm requires both a black-box sketching operator and an entry evaluation function. The novelty of our GPU approach centers around the design and implementation of the above two operations in batched mode on GPU with accommodation for variable-size data structures in a batch. The batch algorithms minimize the number …

Higher dimensional Sacks-Uhlenbeck-type functionals and applications
Gianmichele Di Matteo, Tobias Lamm
https://arxiv.org/abs/2506.17166 https://

Higher dimensional Sacks-Uhlenbeck-type functionals and applications
In this work, we generalize Sacks-Uhlenbeck's existence result for harmonic spheres, constructing for $n \ge 2$, regular, non-trivial, $n$-harmonic $n$-spheres into suitable target manifolds. We obtain an infinite family of new null-homotopic such maps. The proof follows a similar perturbative argument, which in high dimensions leads to a degenerate and double-phase-type Euler-Lagrange system, making the uniform regularity needed to formalize the bubbling harder to achieve. Then, we develop a r…

DatasetAgent: A Novel Multi-Agent System for Auto-Constructing Datasets from Real-World Images
Haoran Sun, Haoyu Bian, Shaoning Zeng, Yunbo Rao, Xu Xu, Lin Mei, Jianping Gou
https://arxiv.org/abs/2507.08648

DatasetAgent: A Novel Multi-Agent System for Auto-Constructing Datasets from Real-World Images
Common knowledge indicates that the process of constructing image datasets usually depends on the time-intensive and inefficient method of manual collection and annotation. Large models offer a solution via data generation. Nonetheless, real-world data are obviously more valuable comparing to artificially intelligence generated data, particularly in constructing image datasets. For this reason, we propose a novel method for auto-constructing datasets from real-world images by a multiagent colla…

Tightness of approximations to metrics on non-simple conformal loop ensemble gaskets
Valeria Ambrosio, Jason Miller, Yizheng Yuan
https://arxiv.org/abs/2507.15589

Tightness of approximations to metrics on non-simple conformal loop ensemble gaskets
We study a class of approximation schemes aimed at constructing conformally covariant metrics defined in the gasket of a conformal loop ensemble (CLE$_κ$) for $κ\in (4,8)$. This is the range of parameter values so that the loops of a CLE$_κ$ intersect themselves, each other, and the domain boundary. Its gasket is the closure of the union of the set of points not surrounded by a loop. The class of approximation schemes includes approximations to the geodesic metric and to the resistance metri…

Modeling and Design of Integrated Iontronic Circuits Based on Ionic Bipolar Junction Transistors
Soichiro Tottori, Rohit Karnik
https://arxiv.org/abs/2507.15440

Modeling and Design of Integrated Iontronic Circuits Based on Ionic Bipolar Junction Transistors
Biological systems rely on ions and molecules as information carriers rather than electrons, motivating the development of devices that interface with biochemical systems for sensing, information processing, and actuation via spatiotemporal control of ions and molecules. Iontronics aims to achieve this vision by constructing devices composed of ion-conducting materials such as polyelectrolyte hydrogels, but advancing beyond simple single-stage circuit configurations that operate under steady-st…

Knowledge Graph-Infused Fine-Tuning for Structured Reasoning in Large Language Models
Wuyang Zhang, Yexin Tian, Xiandong Meng, Mengjie Wang, Junliang Du
https://arxiv.org/abs/2508.14427

Knowledge Graph-Infused Fine-Tuning for Structured Reasoning in Large Language Models
This paper addresses the problems of missing reasoning chains and insufficient entity-level semantic understanding in large language models when dealing with tasks that require structured knowledge. It proposes a fine-tuning algorithm framework based on knowledge graph injection. The method builds on pretrained language models and introduces structured graph information for auxiliary learning. A graph neural network is used to encode entities and their relations, constructing a graph-based sema…

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Bremsstrahlung induced atomic processes
Singh, Kumar, Chatterjee, Swami, Kaur, Jha, Oswal, Singh, Nandi
https://arxiv.org/abs/2501.02967 https://mastoxiv.page/@arXiv_physicsatomph_bot/113786077273931578
- Probing Instantaneous Single-Molecule Chirality in the Planar Ground State of Formic Acid
D. Tsitsonis, et al.
https://arxiv.org/abs/2503.13318 https://mastoxiv.page/@arXiv_physicsatomph_bot/114182276400669831
- Electronic structure calculation for superheavy elements Livermorium (Lv, Z=116) and Tennessine (...
V. A. Dzuba, V. V. Flambaum, G. K. Vong
https://arxiv.org/abs/2505.22895 https://mastoxiv.page/@arXiv_physicsatomph_bot/114595619538348153
- Fast programmable entanglement of Barium ion qubits using Rydberg states and AC-Stark shifts
Adam R. Vernon, Mitch Peaks
https://arxiv.org/abs/2506.00611 https://mastoxiv.page/@arXiv_physicsatomph_bot/114618331124166707
- Mitigating higher-band heating in Floquet-Hubbard lattices via two-tone driving
Yuanning Chen, Zijie Zhu, Konrad Viebahn
https://arxiv.org/abs/2410.12308 https://mastoxiv.page/@arXiv_condmatquantgas_bot/113321883265330530
- Constructing Quantum Many-Body Scars from Hilbert Space Fragmentation
Fan Yang, Matteo Magoni, Hannes Pichler
https://arxiv.org/abs/2506.10806 https://mastoxiv.page/@arXiv_quantph_bot/114675529198570764
toXiv_bot_toot

Estimating the spatial economic and environmental impact of planned offshore wind energy in the USA using Environmentally Extended Multiregional Input-Output analysis
Apoorva Bademi, Miriam Stevens, Isha Sura, Shweta Singh
https://arxiv.org/abs/2508.15012

Estimating the spatial economic and environmental impact of planned offshore wind energy in the USA using Environmentally Extended Multiregional Input-Output analysis
There is a projected increase in offshore wind energy generation in the United States over the next three decades, driven by legislative commitments and government funding. Like other renewable technologies, the construction of offshore wind farms has environmental impacts and spillover effects that must be assessed. Developing offshore wind as a reliable domestic energy source requires a multiregional analysis of economic and environmental effects of constructing projects along lakefronts and …

Eigen Portfolios: From Single Component Models to Ensemble Approaches
ZhengXiang Zhou, Yuqi Luan
https://arxiv.org/abs/2508.15586 https://arxiv.org/pdf/250…

Eigen Portfolios: From Single Component Models to Ensemble Approaches
The increasing integration of data science techniques into quantitative finance has enabled more systematic and data-driven approaches to portfolio construction. This paper investigates the use of Principal Component Analysis (PCA) in constructing eigen-portfolios - portfolios derived from the principal components of the asset return correlation matrix. We begin by formalizing the mathematical underpinnings of eigen-portfolios and demonstrate how PCA can reveal latent orthogonal factors driving…

Permutations satisfying $(P_1)$ and $(P_2)$ properties and $\ell$-optimal bent functions
Sadmir Kudin, Enes Pasalic, Alexandr Polujan, Fengrong Zhang
https://arxiv.org/abs/2508.14277

Permutations satisfying $(P_1)$ and $(P_2)$ properties and $\ell$-optimal bent functions
An important classification of permutations over $\mathbb{F}_2^m$, suitable for constructing Maiorana-McFarland bent functions on $\mathbb{F}_2^m \times \mathbb{F}_2^m$ with the unique $M$-subspace of maximal dimension, was recently considered in Pasalic et al. (IEEE Trans. Inf. Theory 70(6): 4464-4477, 2024). More precisely, two properties called $(P_1)$ and $(P_2)$ were introduced and a generic method of constructing permutations having the property $(P_1)$ was presented, whereas no such resu…

A Morse Mayer-Vietoris Sequence for Cosheaf Homology on Simplicial Complexes
Ben H. Gould
https://arxiv.org/abs/2508.14103 https://arxiv.org/pdf/2508.14103…

A Morse Mayer-Vietoris Sequence for Cosheaf Homology on Simplicial Complexes
We investigate the homology of cosheaves over finite simplicial complexes. After constructing the Mayer-Vietoris short exact sequence for this homology theory, we apply discrete Morse theory to this setting, defining the associated Morse chain complex. The main result is the construction of a Morse Mayer-Vietoris short exact sequence of Morse chain complexes, for which we establish a quasi-isomorphism to the standard Mayer-Vietoris sequence. Discussions relating poset-based (co)sheaf definition…

An ultrasonic transducer for vibration mode conversion of wedge-shaped structure of acoustic black hole
Yi Wang, Cheng Chen, Shuyu Lin
https://arxiv.org/abs/2507.15218

An ultrasonic transducer for vibration mode conversion of wedge-shaped structure of acoustic black hole
Acoustic black hole (ABH) structure has been extensively employed in applications such as vibration mitigation, noise reduction, and energy harvesting, owing to its unique sound wave trapping and energy concentration effects. Furthermore, ABH structure shows significant promise in improving the performance of ultrasonic device and constructing multifunc-tional acoustic field. Therefore, this paper proposes an ultrasonic mode-conversion transducer consisting of a Langevin transducer and an ABH w…

Replaced article(s) found for q-bio.PE. https://arxiv.org/list/q-bio.PE/new
[1/1]:
- Constructing the Molecular Tree of Life using Assembly Theory and Mass Spectrometry
Kahana, MacLeod, Mehr, Sharma, Carrick, Jirasek, Walker, Cronin

Replaced article(s) found for q-bio.GN. https://arxiv.org/list/q-bio.GN/new
[1/1]:
- Constructing Semi-Directed Level-1 Phylogenetic Networks from Quarnets
Sophia Huebler, Rachel Morris, Joseph Rusinko

Study on Control Problem of a Impulsive Neutral Integro-Differential Equations with Fading Memory
Garima Gupta, Jaydev Dabas
https://arxiv.org/abs/2507.16560

Study on Control Problem of a Impulsive Neutral Integro-Differential Equations with Fading Memory
This article addresses control problems for semilinear impulsive neutral integro-differential equations with memory in a Banach space. It investigates the approximate controllability of linear and semilinear systems and proves the establishment of mild solutions in the semilinear setting. The approach involves constructing a resolvent family for the corresponding integro-differential equation of linear type without memory. The results for the linear system are established first, then extended t…

Basis Construction for Spline Spaces over Arbitrary Partitions from a Dimensional Stable Perspective
Bingru Huang, Falai Chen
https://arxiv.org/abs/2508.14649 https://

Basis Construction for Spline Spaces over Arbitrary Partitions from a Dimensional Stable Perspective
This paper introduces a novel framework for constructing $C^r$ basis functions for polynomial spline spaces of degree $d$ over arbitrary planar polygonal partitions, overturning the belief that basis functions cannot be constructed on dimensionally unstable meshes. We provide a comprehensive comparison of basis construction methods, classifying them as explicit, semi-explicit, and implicit. Our method, a semi-explicit construction using Extended Edge Elimination conditions, uniquely resolves al…

A large color $R$-matrix for $\mathfrak{sl}_3$
Angus Gruen, Lara San Mart\'in Su\'arez
https://arxiv.org/abs/2508.15171 https://arxiv.org/pdf/2508.…

A large color $R$-matrix for $\mathfrak{sl}_3$
We construct the invariant $F_K^{\mathfrak{sl}_3}\in\mathbb{Z}[q,q^{-1}][[x,y]]$ for any positive braid knot $K$, whose existence was conjectured by Park, building on earlier work of Gukov--Manolescu. The main step in our work extends a result by the first author on the invariant associated to symmetric representations of $\mathfrak{sl}_3$ to all irreducible representations. We conclude with a conjectural framework for constructing $F_K^{\mathfrak{sl}_N}$ for arbitrary $N$.

Analysis of Design Algorithms and Fabrication of a Graph-based Double-curvature Structure with Planar Hexagonal Panels
Mehdi Gorjian, Gregory A. Luhan, Stephen M. Caffey
https://arxiv.org/abs/2507.16171

Analysis of Design Algorithms and Fabrication of a Graph-based Double-curvature Structure with Planar Hexagonal Panels
This paper presents a novel algorithmic framework for the computational design, simulation, and fabrication of a hexagonal grid-based double-curvature structure with planar hexagonal panels. The journey begins with constructing a robust data structure through the meticulous subdivision of an equilateral triangle surface, forming a foundational triangular grid. This grid is the basis for a graph that encapsulates hexagons, laying the groundwork for simulating dynamic interactions and form-findin…

Attention-Based Explainability for Structure-Property Relationships
Boris N. Slautin, Utkarsh Pratiush, Yongtao Liu, Hiroshi Funakubo, Vladimir V. Shvartsman, Doru C. Lupascu, Sergei V. Kalinin
https://arxiv.org/abs/2508.15493

Attention-Based Explainability for Structure-Property Relationships
Machine learning methods are emerging as a universal paradigm for constructing correlative structure-property relationships in materials science based on multimodal characterization. However, this necessitates development of methods for physical interpretability of the resulting correlative models. Here, we demonstrate the potential of attention-based neural networks for revealing structure-property relationships and the underlying physical mechanisms, using the ferroelectric properties of PbTi…

Hazel Deriver: A Live Editor for Constructing Rule-Based Derivations
Zhiyao Zhong, Cyrus Omar
https://arxiv.org/abs/2506.10781 https://

Hazel Deriver: A Live Editor for Constructing Rule-Based Derivations
Students in programming languages and formal logic courses often struggle with constructing rule-based derivation trees due to the complexity of applying inference rules, the lack of immediate feedback, and the manual effort required for handwritten proofs. We present Hazel Deriver, a live, web-based editor designed to scaffold derivation construction through multiple layers of support. Built on the Hazel live programming environment, it provides a structured, interactive experience that encour…

A geometric approach to constructing quasi-isodynamic fields
G. G. Plunk, E. Rodr\'iguez
https://arxiv.org/abs/2508.12820 https://arxiv.org/pdf/2508.12…

A geometric approach to constructing quasi-isodynamic fields
The near-axis theory for quasi-isodynamic stellarator equilibria is reformulated in terms of geometric inputs, to allow greater control of the ``direct construction'' of quasi-isodynamic configurations, and to facilitate understanding of the space of such equilibria. This includes a method to construct suitable magnetic axis curves by solving Frenet-Serret equations, and an approach to controlling magnetic surface shaping at first order (plasma elongation), which previously has required careful…

Investigating $f(R)$-Inflation: background evolution and constraints
Elisa Fazzari, Chiara De Leo, Giovanni Montani, Matteo Martinelli, Alessandro Melchiorri, Guadalupe Ca\~nas-Herrera
https://arxiv.org/abs/2507.13890

Investigating $f(R)$-Inflation: background evolution and constraints
In this work, we investigate the possibility of generating an inflationary mechanism within the framework of a metric-$f(R)$ modified gravity theory, formulated in the Jordan frame. We explore whether the scalar field, non-minimally coupled to gravity and emerging in the Jordan frame, can play the role of the primordial inflaton. Particular attention is devoted to constructing a dynamical scenario in the Jordan frame that exhibits a slow-rolling phase for the scalar field and admits a quasi-de …

Construction of general $N$-body lattice operators with arbitrary momenta
Haobo Yan, Chuan Liu, Liuming Liu, Yu Meng
https://arxiv.org/abs/2507.16070 https…

Construction of general $N$-body lattice operators with arbitrary momenta
We present a systematic method for constructing lattice QCD operators for systems of an arbitrary number of particles with arbitrary momentum, spin, and internal quantum numbers. Explicit constructions are provided for one-, two-, three-, and four-hadron operators, covering all irreducible representations of the relevant lattice symmetry groups in both rest and moving frames. The construction procedure has been implemented in the open-source package \texttt{OpTion} (Operator construcTion), avai…

On the classification and irreducibility of $2$-local representations of the twin group $T_n$
Taher I. Mayassi, Mohamad N. Nasser
https://arxiv.org/abs/2508.14505 https://

On the classification and irreducibility of $2$-local representations of the twin group $T_n$
We investigate the homogeneous $2$-local representations of the twin group $T_n$ for all integers $n\geqslant 2$. A complete classification is obtained, yielding three distinct families of representations. We show that each of these families is reducible by explicitly constructing one-dimensional invariant subspaces, with particular emphasis on the first family, namely $ξ_1: T_n \rightarrow \text{GL}_n(\mathbb{C})$. Passing to the corresponding quotients, we construct a reduced representation …

Well-posedness for path-dependent multivalued McKean-Vlasov stochastic differential equations
Ying Ma, Huijie Qiao
https://arxiv.org/abs/2508.15301 https://

Well-posedness for path-dependent multivalued McKean-Vlasov stochastic differential equations
This work concerns a type of path-dependent multivalued McKean-Vlasov stochastic differential equations. First of all, we prove the well-posedness for path-dependent multivalued stochastic differential equations under the Lipschitz conditions. Then by constructing Lipschitz approximation sequences, we generalize the result to the case of the non-Lipschitz conditions. Finally, based on the obtained results, the well-posedness for path-dependent multivalued McKean-Vlasov stochastic differential e…

Role of Non-conserved Gravity Theory and Electric Charge in Constructing Complexity-free Stellar Models: A Novel Approach under Non-minimal Coupling
Tayyab Naseer
https://arxiv.org/abs/2508.13903

Role of Non-conserved Gravity Theory and Electric Charge in Constructing Complexity-free Stellar Models: A Novel Approach under Non-minimal Coupling
This study explores the application of complexity factor within the context of Rastall gravity, exploring its implications on a static spacetime admitting spherical symmetry associated with anisotropic fluids under an electromagnetic field. The field equations are derived for a static charged sphere that provides a foundational framework for analyzing gravitational effects in this non-conserved theory. The mass function is formulated by incorporating both fluid and geometric parameters, offerin…

Constructing the Past: The Nineteenth-Century Quest for History and the Rewriting of Medieval India https://call-for-papers.sas.upenn.edu/cfp/2025/08/10/constructing-the-past-the-nineteenth-century-quest-for-h…

Efficiently Constructing Sparse Navigable Graphs
Alex Conway, Laxman Dhulipala, Martin Farach-Colton, Rob Johnson, Ben Landrum, Christopher Musco, Yarin Shechter, Torsten Suel, Richard Wen
https://arxiv.org/abs/2507.13296

Efficiently Constructing Sparse Navigable Graphs
Graph-based nearest neighbor search methods have seen a surge of popularity in recent years, offering state-of-the-art performance across a wide variety of applications. Central to these methods is the task of constructing a sparse navigable search graph for a given dataset endowed with a distance function. Unfortunately, doing so is computationally expensive, so heuristics are universally used in practice. In this work, we initiate the study of fast algorithms with provable guarantees for se…

On spurious fixed points in iterative maximum likelihood reconstruction for quantum tomography
Florian Oberender
https://arxiv.org/abs/2508.14549 https://a…

On spurious fixed points in iterative maximum likelihood reconstruction for quantum tomography
Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density matrix in practice. Contradicting these practical observations, we will show that convergence to a true solution is not guaranteed in general by constructing examples for spurious fixed points. To deal with this newly found problem, we then provide a criterion…

What is this bullshit system that claims to evoke and champion freedom and liberty while at the same time constructing a surveillance and police state the likes of which the world has never seen before?
This is fucking mental and the pretence is over now. This is what neoliberalism has created.

Log-Euclidean Frameworks for Smooth Brain Connectivity Trajectories
Olivier Bisson (EPIONE, UniCA), Yanis Aeschlimann (CRONOS, UniCA), Samuel Deslauriers-Gauthier (CRONOS, UniCA), Xavier Pennec (EPIONE, UniCA)
https://arxiv.org/abs/2507.15374

Log-Euclidean Frameworks for Smooth Brain Connectivity Trajectories
The brain is often studied from a network perspective, where functional activity is assessed using functional Magnetic Resonance Imaging (fMRI) to estimate connectivity between predefined neuronal regions. Functional connectivity can be represented by correlation matrices computed over time, where each matrix captures the Pearson correlation between the mean fMRI signals of different regions within a sliding window. We introduce several Log-Euclidean Riemannian framework for constructing smooth…

Constructing and transforming standard resolutions of local modules
Xingbang Hao
https://arxiv.org/abs/2508.11306 https://arxiv.org/pdf/2508.11306

Constructing and transforming standard resolutions of local modules
We construct standard resolutions for analytic local modules on complex hypersurfaces using standard basis methods, with extensions to complete intersections. The algebraic version over arbitrary infinite fields is also suggested. Applications include derived category formula of local hypersurface blow-ups, revealing new connections between standard bases and categorical geometry.

TTSOps: A Closed-Loop Corpus Optimization Framework for Training Multi-Speaker TTS Models from Dark Data
Kentaro Seki, Shinnosuke Takamichi, Takaaki Saeki, Hiroshi Saruwatari
https://arxiv.org/abs/2506.15614

TTSOps: A Closed-Loop Corpus Optimization Framework for Training Multi-Speaker TTS Models from Dark Data
This paper presents TTSOps, a fully automated closed-loop framework for constructing multi-speaker text-to-speech (TTS) systems from noisy, uncurated web-scale speech data, often referred to as ``dark data,'' such as online videos. Conventional TTS training pipelines require well-curated corpora with high acoustic quality and accurate text-speech alignment, which severely limits scalability, speaker diversity, and real-world applicability. While recent studies have proposed acoustic-quality-bas…

Signal Temporal Logic Compliant Co-design of Planning and Control
Manas Sashank Juvvi, Tushar Dilip Kurne, Vaishnavi J, Shishir Kolathaya, Pushpak Jagtap
https://arxiv.org/abs/2507.13225

Signal Temporal Logic Compliant Co-design of Planning and Control
This work presents a novel co-design strategy that integrates trajectory planning and control to handle STL-based tasks in autonomous robots. The method consists of two phases: $(i)$ learning spatio-temporal motion primitives to encapsulate the inherent robot-specific constraints and $(ii)$ constructing an STL-compliant motion plan from these primitives. Initially, we employ reinforcement learning to construct a library of control policies that perform trajectories described by the motion primi…

Calamus 34 I dreamed in a dream
On the surface this short poem is a sort of City on a Hill vision. But I'm going to go with a more radical reading.
This poem reads to me as a fantasy of a gay society. A city of men, lovers, set apart from the rest of the world.
a city invincible to the attacks of the whole of the rest of the earth ...
the quality of robust love ...
the actions of the men of that city
And in all their looks and words.
I can't plausibly argue Whitman conceived of a city set apart in the way I imagine. Although all of Calamus is him constructing the idea of a society of lovers, comrades, brothers, robust love. That to me is very gay.
Intriguingly, in the unpublished Live Oak draft of this poem it is even more explicitly gay:
I saw them tenderly love each other ...
Nothing was greater there than manly love
It seems to me he dreamed a very gay city.

CLMIR: A Textual Dataset for Rumor Identification and Marking
Bin Ma, Yifei Zhang, Yongjin Xian, Qi Li, Linna Zhou, Gongxun Miao
https://arxiv.org/abs/2508.11138 https://…

CLMIR: A Textual Dataset for Rumor Identification and Marking
With the rise of social media, rumor detection has drawn increasing attention. Although numerous methods have been proposed with the development of rumor classification datasets, they focus on identifying whether a post is a rumor, lacking the ability to mark the specific rumor content. This limitation largely stems from the lack of fine-grained marks in existing datasets. Constructing a rumor dataset with rumor content information marking is of great importance for fine-grained rumor identific…

LISA -- A Modern Proof System
Simon Guilloud, Sankalp Gambhir, Viktor Kun\v{c}ak
https://arxiv.org/abs/2507.11167 https://arxiv.org/p…

LISA -- A Modern Proof System
We present LISA, a proof system and proof assistant for constructing proofs in schematic first-order logic and axiomatic set theory. The logical kernel of the system is a proof checker for first-order logic with equality and schematic predicate and function symbols. It implements polynomial-time proof checking and uses the axioms of ortholattices (which implies the irrelevance of the order of conjuncts and disjuncts and additional propositional laws). The kernel supports the notion of theorems …

A well-balanced gas-kinetic scheme with adaptive mesh refinement for shallow water equations
Gaocheng Liu, Fengxiang Zhao, Jianping Gan, Kun Xu
https://arxiv.org/abs/2508.14216 …

A well-balanced gas-kinetic scheme with adaptive mesh refinement for shallow water equations
This paper is about the construction of a well-balanced gas-kinetic scheme (GKS) with space-time adaptive mesh refinement (STAMR) for the shallow water equations (SWE). While the well-balanced GKS has been established on Cartesian and triangular meshes, the present STAMR framework employs arbitrary quadrilateral meshes with hanging nodes, posing additional challenges for constructing well-balanced schemes. Complementing spatial adaptivity, temporal adaptivity is achieved by selecting adaptive t…

Dyadically resolving trinomials for fast modular arithmetic
Robert Dougherty-Bliss, Mits Kobayashi, Natalya Ter-Saakov, Eugene Zima
https://arxiv.org/abs/2508.11043 https://

Dyadically resolving trinomials for fast modular arithmetic
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally proposed for their efficient arithmetic and bit-level properties. These trinomial moduli support fast modular operations and exhibit scalable modular inverses. We investigate the problem of constructing large sets of pairwise relatively prime trinomial moduli …

Procedures for Constraining Robotic Fiber Positioning for Highly Multiplexed Spectroscopic Surveys: The Case of FPS for SDSS-V
Ilija Medan, Tom Dwelly, Kevin R. Covey, Eleonora Zari, Michael R. Blanton, Joleen K. Carlberg, S. Drew Chojnowski, Alexander Ji, Yue Shen, John Donor, Jos\'e S\'anchez-Gallego, Sean Morrison, H\'ector J. Ibarra-Medel, Conor Sayres, Keivan G. Stassun

Procedures for Constraining Robotic Fiber Positioning for Highly Multiplexed Spectroscopic Surveys: The Case of FPS for SDSS-V
One crucial aspect of planning any large scale astronomical survey is constructing an observing strategy that maximizes reduced data quality. This is especially important for surveys that are rather heterogeneous and broad-ranging in their science goals. The Sloan Digital Sky Survey V (SDSS-V), which now utilizes the Focal Plane System (FPS) to robotically place fibers that feed the spectrographs, certainly meets these criteria. The addition of the FPS facilities an increase in survey efficienc…

Bases of Riemann-Roch spaces associated with arbitrary elliptic curve divisors and their application in constructing various elliptic Codes families
Artyom Kuninets, Ekaterina Malygina
https://arxiv.org/abs/2508.04340

Bases of Riemann-Roch spaces associated with arbitrary elliptic curve divisors and their application in constructing various elliptic Codes families
In this paper, we determine explicit bases for Riemann--Roch spaces associated with various families of elliptic codes. We establish the feasibility and provide exact algorithms for constructing bases of Riemann--Roch spaces corresponding to arbitrary divisors on elliptic curves. These results are subsequently applied to derive bases for quasi-cyclic elliptic codes and their subfield subcodes as well as for the class of Goppa-like elliptic codes. For algebraic geometry code applications, having…

MExplore: an entity-based visual analytics approach for medical expertise acquisition
Xiao Pang, Yan Huang, Chang Liu, JiYuan Liu, MingYou Liu
https://arxiv.org/abs/2507.12337

MExplore: an entity-based visual analytics approach for medical expertise acquisition
Acquiring medical expertise is a critical component of medical education and professional development. While existing studies focus primarily on constructing medical knowledge bases or developing learning tools based on the structured, private healthcare data, they often lack methods for extracting expertise from unstructured medical texts. These texts constitute a significant portion of medical literature and offer greater flexibility and detail compared to structured data formats. Furthermore…

Quantum Tomography in Neutral Meson and Antimeson Systems
Kun Cheng, Tao Han, Matthew Low, Tong Arthur Wu
https://arxiv.org/abs/2507.12513 https://

Quantum Tomography in Neutral Meson and Antimeson Systems
The flavor space of particles produced in collider environments contains informative quantum correlations. We present a systematic approach for constructing the complete flavor density matrix for a meson and antimeson system ($M \bar M$) in the Bloch vector space at a given time $t$, which can be at or after production. We point out that the $B_s^0$ and $K^0$ systems are superior to the $B^0_d$ and $D^0$ systems for quantum tomography because of their flavor oscillation and decay properties. Pe…

Constructing targeted minimum loss/maximum likelihood estimators: a simple illustration to build intuition
Rachael K. Ross, Lina M. Montoya, Dana E. Goin, Ivan Diaz, Audrey Renson
https://arxiv.org/abs/2507.11680

Constructing targeted minimum loss/maximum likelihood estimators: a simple illustration to build intuition
Use of machine learning to estimate nuisance functions (e.g. outcomes models, propensity score models) in estimators used in causal inference is increasingly common, as it can mitigate bias due to model misspecification. However, it can be challenging to achieve valid inference (e.g., estimate valid confidence intervals). The efficient influence function (EIF) provides a recipe to go from a statistical estimand relevant to our causal question, to an estimator that can validly incorporate machin…

Unraveling Self-Similar Energy Transfer Dynamics: a Case Study for 1D Burgers System
Pritpal Matharu, Bartosz Protas, Tsuyoshi Yoneda
https://arxiv.org/abs/2507.12764

Unraveling Self-Similar Energy Transfer Dynamics: a Case Study for 1D Burgers System
In this work we consider the problem of constructing flow evolutions leading to a self-similar energy cascade consistent with Kolmogorov's statistical theory of turbulence. As a first step in this direction, we focus on the one-dimensional viscous Burgers equation as a toy model. Its solutions exhibiting self-similar behavior, in a precisely-defined sense, are found by framing this problems in terms of PDE-constrained optimization. The main physical parameters are the time window over which sel…

Partial decidability protocol for the Wang tiling problem from statistical mechanics and chaotic mapping
Fabrizio Canfora, Marco Cedeno
https://arxiv.org/abs/2507.13268

Partial decidability protocol for the Wang tiling problem from statistical mechanics and chaotic mapping
We introduce a partial decidability protocol for the Wang tiling problem (which is the prototype of undecidable problems in combinatorics and statistical physics) by constructing a suitable mapping from tilings of finite squares of different sizes. Such mapping depends on the initial family of Wang tiles (the alphabet) with which one would like to tile the plane. This allows to define effective entropy and temperature associated to the alphabet (together with the corresponding partition functio…

Pushing the Limits of Extreme Weather: Constructing Extreme Heatwave Storylines with Differentiable Climate Models
Tim Whittaker, Alejandro Di Luca
https://arxiv.org/abs/2506.10660

Pushing the Limits of Extreme Weather: Constructing Extreme Heatwave Storylines with Differentiable Climate Models
Understanding the plausible upper bounds of extreme weather events is essential for risk assessment in a warming climate. Existing methods, based on large ensembles of physics-based models, are often computationally expensive or lack the fidelity needed to simulate rare, high-impact extremes. Here, we present a novel framework that leverages a differentiable hybrid climate model, NeuralGCM, to optimize initial conditions and generate physically consistent worst-case heatwave trajectories. Appli…

On constructing deformations of noncommutative algebras
Agata Smoktunowicz
https://arxiv.org/abs/2507.04436 https://arxiv.org/pdf/250…

On constructing deformations of noncommutative algebras
This paper presents a method for constructing flat deformations of associative algebras. We will refer to this method as method two because it is a generalisation of the method obtained in [1]. The deformations obtained using the first two methods are of polynomial type. We also present a third method, for the construction of deformations from N to A, for a semisimple algebra A. As an applied example, we answer a question posed by Michael Wemyss on deformations of Acons.

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
Sanjeev Khanna, Ashwin Padaki, Erik Waingarten
https://arxiv.org/abs/2507.14060

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
We initiate the study of approximation algorithms and computational barriers for constructing sparse $α$-navigable graphs [IX23, DGM+24], a core primitive underlying recent advances in graph-based nearest neighbor search. Given an $n$-point dataset $P$ with an associated metric $\mathsf{d}$ and a parameter $α\geq 1$, the goal is to efficiently build the sparsest graph $G=(P, E)$ that is $α$-navigable: for every distinct $s, t \in P$, there exists an edge $(s, u) \in E$ with $\mathsf{d}(u, t)…

Orbit method for Quantum Corner Symmetries
Giulio Neri, Ludovic Varrin
https://arxiv.org/abs/2507.10683 https://arxiv.org/pdf/2507.10…

Orbit method for Quantum Corner Symmetries
The classification of the unitary irreducible representations of symmetry groups is a cornerstone of modern quantum physics, as it provides the fundamental building blocks for constructing the Hilbert spaces of theories admitting these symmetries. In the context of gravitational theories, several arguments point towards the existence of a universal symmetry group associated with corners, whose structure is the same for every diffeomorphism-invariant theory in any dimension. Recently, the repr…

Attractor Stability of Boolean networks under noise
Byungjoon Min, Jeehye Choi, Reinhard Laubenbacher
https://arxiv.org/abs/2506.15581 https://

Attractor Stability of Boolean networks under noise
We study the impact of noise on attractor dynamics in Boolean networks, focusing on their stability and transition behaviors. By constructing attractor matrices based on single-node perturbations, we propose a framework to quantify attractor stability and identify dominant attractors. We find that attractors are more stable than predicted by basin sizes, showing the importance of dynamical structure in noisy environments. In addition, under global perturbations, basin sizes dictate long-term be…

MetaAgent: Automatically Constructing Multi-Agent Systems Based on Finite State Machines
Yaolun Zhang, Xiaogeng Liu, Chaowei Xiao
https://arxiv.org/abs/2507.22606 https://

MetaAgent: Automatically Constructing Multi-Agent Systems Based on Finite State Machines
Large Language Models (LLMs) have demonstrated the ability to solve a wide range of practical tasks within multi-agent systems. However, existing human-designed multi-agent frameworks are typically limited to a small set of pre-defined scenarios, while current automated design methods suffer from several limitations, such as the lack of tool integration, dependence on external training data, and rigid communication structures. In this paper, we propose MetaAgent, a finite state machine based fr…

G-Sim: Generative Simulations with Large Language Models and Gradient-Free Calibration
Samuel Holt, Max Ruiz Luyten, Antonin Berthon, Mihaela van der Schaar
https://arxiv.org/abs/2506.09272

G-Sim: Generative Simulations with Large Language Models and Gradient-Free Calibration
Constructing robust simulators is essential for asking "what if?" questions and guiding policy in critical domains like healthcare and logistics. However, existing methods often struggle, either failing to generalize beyond historical data or, when using Large Language Models (LLMs), suffering from inaccuracies and poor empirical alignment. We introduce G-Sim, a hybrid framework that automates simulator construction by synergizing LLM-driven structural design with rigorous empirical calibration…

Inference on Optimal Policy Values and Other Irregular Functionals via Smoothing
Justin Whitehouse, Morgane Austern, Vasilis Syrgkanis
https://arxiv.org/abs/2507.11780

Inference on Optimal Policy Values and Other Irregular Functionals via Smoothing
Constructing confidence intervals for the value of an optimal treatment policy is an important problem in causal inference. Insight into the optimal policy value can guide the development of reward-maximizing, individualized treatment regimes. However, because the functional that defines the optimal value is non-differentiable, standard semi-parametric approaches for performing inference fail to be directly applicable. Existing approaches for handling this non-differentiability fall roughly int…

A Method for Constructing Quasi-Random Peaked Quantum Circuits
O. G. Udalov
https://arxiv.org/abs/2508.07491 https://arxiv.org/pdf/2508.07491

A Method for Constructing Quasi-Random Peaked Quantum Circuits
An algorithm is proposed for constructing quasi-random "peaked" quantum circuits, i.e., circuits whose final qubit state exhibits a high probability concentration on a specific computational basis state. These circuits consist of random gates arranged in a brick-wall architecture. While the multiqubit state in the middle of the circuit can exhibit significant entanglement, the final state is, with high probability, a predetermined pure bitstring. A technique is introduced to obscure the final b…

Parallel Complexity of Depth-First-Search and Maximal path
Archit Chauhan, Samir Datta, M. Praveen
https://arxiv.org/abs/2506.14974 https://

Parallel Complexity of Depth-First-Search and Maximal path
Constructing a Depth First Search (DFS) tree is a fundamental graph problem, whose parallel complexity is still not settled. Reif showed parallel intractability of lex-first DFS. In contrast, randomized parallel algorithms (and more recently, deterministic quasipolynomial parallel algorithms) are known for constructing a DFS tree in general (di)graphs. However a deterministic parallel algorithm for DFS in general graphs remains an elusive goal. Working towards this, a series of works gave deter…

Feature Complementation Architecture for Visual Place Recognition
Weiwei Wang, Meijia Wang, Haoyi Wang, Wenqiang Guo, Jiapan Guo, Changming Sun, Lingkun Ma, Weichuan Zhang
https://arxiv.org/abs/2506.12401

Feature Complementation Architecture for Visual Place Recognition
Visual place recognition (VPR) plays a crucial role in robotic localization and navigation. The key challenge lies in constructing feature representations that are robust to environmental changes. Existing methods typically adopt convolutional neural networks (CNNs) or vision Transformers (ViTs) as feature extractors. However, these architectures excel in different aspects -- CNNs are effective at capturing local details. At the same time, ViTs are better suited for modeling global context, mak…

Constructing and Evaluating Declarative RAG Pipelines in PyTerrier
Craig Macdonald, Jinyuan Fang, Andrew Parry, Zaiqiao Meng
https://arxiv.org/abs/2506.10802

Constructing and Evaluating Declarative RAG Pipelines in PyTerrier
Search engines often follow a pipeline architecture, where complex but effective reranking components are used to refine the results of an initial retrieval. Retrieval augmented generation (RAG) is an exciting application of the pipeline architecture, where the final component generates a coherent answer for the users from the retrieved documents. In this demo paper, we describe how such RAG pipelines can be formulated in the declarative PyTerrier architecture, and the advantages of doing so. O…

The isotropy of cosmic expansion in the early and late Universe
Alan Junzhe Zhou, Scott Dodelson, Daniel Scolnic
https://arxiv.org/abs/2506.14878 https://

The isotropy of cosmic expansion in the early and late Universe
We test the isotropy of cosmic expansion by combining several probes for the first time, constructing full-sky maps of expansion rate variation using Type Ia supernovae, fundamental plane galaxies, and CMB temperature fluctuations. We find no hint of anisotropy or correlation between early- and late-Universe expansion across all systematic models. The 99% confidence upper limits on expansion rate anisotropy are 0.39% for low-redshift supernovae, 0.95% for high-redshift CMB, and 0.37% when combi…

Codimensions-Two Submanifolds Contained in the Light-like Hypercylinder $\mathcal{LC}^n\times\mathbb R$
Ali Gineli, Hazal Y\"ur\"uk, Nurettin Cenk Turgay
https://arxiv.org/abs/2508.11653

Codimensions-Two Submanifolds Contained in the Light-like Hypercylinder $\mathcal{LC}^n\times\mathbb R$
In this paper, we investigate space-like codimension-two submanifolds of the Lorentz-Minkowski space $\mathbb{E}_1^{n+2}$ constrained to lie on the light-like hypercylinder $\mathcal{LC}^n \times \mathbb{R}$ over the light cone $\mathcal{LC}^n$. By constructing a geometrically defined global frame field on the submanifold, we analyze the geometric interpretations of the associated extrinsic invariants by providing characterizations of (pseudo-)isotropic and pseudo-umbilical submanifolds, as wel…

Multi-dimensional evaluation on a rural integrated energy system including solar, wind, biomass and geothermal energy
Ruonan Lia, Chang Wena, Mingyu Yan, Congcong Wu, Ahmed Lotfy Elrefai, Xiaotong Zhang, Sahban Wael Saeed Alnaser
https://arxiv.org/abs/2506.15398

Multi-dimensional evaluation on a rural integrated energy system including solar, wind, biomass and geothermal energy
This study focuses on the novel municipal-scale rural integrated energy system (RIES), which encompasses energy supply and application. By constructing a seven-dimensional evaluation system including energy efficiency, energy supply, low-carbon sustainability, environmental impact, energy economy, social benefits, and integrated energy system development, this research combines the improved analytic hierarchy process (IAHP) and entropy weight method (EWM) by sum of squares of deviations to bala…

A new Lagrange multiplier approach for constructing structure preserving schemes, III. Bound preserving and energy dissipating
Qing Cheng, Tingfeng Wang, Xiaofei Zhao
https://arxiv.org/abs/2506.12402

A new Lagrange multiplier approach for constructing structure preserving schemes, III. Bound preserving and energy dissipating
In the third part of this series, we continue to explore the idea of the Lagrange multiplier introduced in the first part [2020, Comput. Methods Appl. Mech. Engr., 391, 114585] and refined in the second part [2022, SIAM J. Numer. Anal., 60, 970-998] to further develop efficient and accurate numerical schemes that preserve the maximum bound principle (MBP) and energy dissipation for solving gradient flows. The proposed framework allows us to begin with any conventional scheme as a predictor step…

Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
Pavlo Savchuk
https://arxiv.org/abs/2507.07951

Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
We present new methods and results for constructing optimal Kobon triangle arrangements. First, we introduce a compact table notation for describing arrangements of pseudolines, enabling the representation and analysis of complex cases, including symmetrical arrangements, arrangements with parallel lines, and arrangements with multiple-line intersection points. Building on this, we provide a simple heuristic method and tools for recovering straight-line arrangements from a given table, with the…

Characterization and constructions of binary self-orthogonal singly-even linear codes
Kangquan Li, Hao Chen, Wengang Jin, Longjiang Qu
https://arxiv.org/abs/2507.12240

Characterization and constructions of binary self-orthogonal singly-even linear codes
Recent research has focused extensively on constructing binary self-orthogonal (SO) linear codes due to their applications in quantum information theory, lattice design, and related areas. Despite significant activity, the fundamental characterization remains unchanged: binary SO codes are necessarily even (all codeword weights even), while doubly-even codes (weights divisible by $4$) are automatically SO. This paper advances the theory by addressing the understudied case of singly-even (even…

A Dissipativity Framework for Constructing Scaled Graphs
Timo de Groot, Maurice heemels, Sebastiaan van den Eijnden
https://arxiv.org/abs/2507.08411 https:…

A Dissipativity Framework for Constructing Scaled Graphs
Scaled relative graphs have been originally introduced in the context of convex optimization and have recently gained attention in the control systems community for the graphical analysis of nonlinear systems. Of particular interest in stability analysis of feedback systems is the scaled graph, a special case of the scaled relative graph. In many ways, scaled graphs can be seen as a generalization of the classical Nyquist plot for linear time-invariant systems, and facilitate a powerful graphic…

Non-uniqueness of weak solutions to the 3D Hall-MHD equations on the plane
Yi Peng, Huaqiao Wang, Chenlu Zhang
https://arxiv.org/abs/2508.11193 https://arx…

Non-uniqueness of weak solutions to the 3D Hall-MHD equations on the plane
We prove the non-uniqueness of weak solutions with non-trivial magnetic fields to the 3D Hall-MHD equations on the plane in the space $C^0_t L_x^2$ through the convex integration scheme and by constructing new errors and new intermittent flows. In particular, based on the construction of 3D intermittent flows, we obtain the $2\frac{1}{2}$D Mikado flows through a projection onto the plane. Moreover, we prove that the constructed weak solution do not conserve the magnetic helicity and find that w…

SYK model based $\beta$ regime dependent two-qubit dynamical wormhole-inspired teleportation protocol simulation
Sudhanva Joshi, Sunil Kumar Mishra
https://arxiv.org/abs/2506.15373

SYK model based $β$ regime dependent two-qubit dynamical wormhole-inspired teleportation protocol simulation
This study aims to provide insights into various aspects of quantum chaos and teleportation by implementing the recently developed Wormhole-Inspired Teleportation Protocol (WITP). We commence by constructing an analog of a traversable wormhole utilizing the Sachdev-Ye-Kitaev (SYK) model in conjunction with the Thermofield Double (TFD) state framework, implemented within a quantum circuit. Subsequently, we manipulate various parameters, including temperature ($β$) and the location of the messag…

Invariance Guarantees using Continuously Parametrized Control Barrier Functions
Inkyu Jang, H. Jin Kim
https://arxiv.org/abs/2507.12743 https://

Invariance Guarantees using Continuously Parametrized Control Barrier Functions
Constructing a control invariant set with an appropriate shape that fits within a given state constraint is a fundamental problem in safety-critical control but is known to be difficult, especially for large or complex spaces. This paper introduces a safe control framework of utilizing PCBF: continuously parametrized control barrier functions (CBFs). In PCBF, each choice of parameter corresponds to a control invariant set of relatively simple shape. Invariance-preserving control is done by dyna…

Constructing new probability distributions on the unit interval
Roberto Vila, Helton Saulo, Poliana Matos, Subhankar Dutta
https://arxiv.org/abs/2508.01154 https://

Constructing new probability distributions on the unit interval
In this paper, we introduce a novel method for constructing probability distributions on the unit interval by exploiting the non-injective transformation defined by the ratio of two positive random variables, $X$ and $Y$. For simplicity and tractability, we focus on independent random variables $X$ and $Y$ following gamma distributions. We derive some results including laws, density functions, quantile function and closed-form expressions for the moments, and discuss maximum likelihood estimati…

Constructing Quantum Many-Body Scars from Hilbert Space Fragmentation
Fan Yang, Matteo Magoni, Hannes Pichler
https://arxiv.org/abs/2506.10806 https://

Constructing Quantum Many-Body Scars from Hilbert Space Fragmentation
Quantum many-body scars (QMBS) are exotic many-body states that exhibit anomalous non-thermal behavior in an otherwise ergodic system. In this work, we demonstrate a simple, scalable and intuitive construction of QMBS in a kinetically constrained quantum model exhibiting weak Hilbert space fragmentation. We show that towers of exact QMBS can be constructed by injecting a quasiparticle excitation that partially activates the frozen regions in the lattice. Meanwhile, the inelastic collision betwe…

Basis construction for polynomial spline spaces over arbitrary T-meshe
Shicong Zhong, Falai Chen, Bingru Huang
https://arxiv.org/abs/2508.12950 https://arx…

Basis construction for polynomial spline spaces over arbitrary T-meshe
This paper presents the first method for constructing bases for polynomial spline spaces over an arbitrary T-meshes (PT-splines for short). We construct spline basis functions for an arbitrary T-mesh by first converting the T-mesh into a diagonalizable one via edge extension, ensuring a stable dimension of the spline space. Basis functions over the diagoalizable T-mesh are constructed according to the three components in the dimension formula corresponding to cross-cuts, rays, and T $l$-edges i…

Constructing strong starters of orders $3p$: triplication with SAT solver
Oleg Ogandzhanyants, Sergey Sadov, Margo Kondratieva
https://arxiv.org/abs/2506.06461

Constructing strong starters of orders $3p$: triplication with SAT solver
A novel approach to building strong starters in cyclic groups of orders $n$ divisible by 3 from starters of smaller orders is presented. A strong starter in $Z_n$ ($n$ odd) is a partition of the set $\{1,2,\dots,n-1\}$ into pairs $\{a_i,b_i\}$ such that all pair sums $a_i+b_i$ are distinct and nonzero modulo $n$ and all differences $\pm(a_i-b_i)$ are distinct and nonzero modulo $n$. A special interest to strong starters of odd orders divisible by 3 is motivated by Horton's conjecture which clai…

Addressing Side-Channel Threats in Quantum Key Distribution via Deep Anomaly Detection
Junxuan Liu, Bingcheng Huang, Jialei Su, Qingquan Peng, Anqi Huang
https://arxiv.org/abs/2508.12749

Addressing Side-Channel Threats in Quantum Key Distribution via Deep Anomaly Detection
Traditional countermeasures against security side channels in quantum key distribution (QKD) systems often suffer from poor compatibility with deployed infrastructure, the risk of introducing new vulnerabilities, and limited applicability to specific types of attacks. In this work, we propose an anomaly detection (AD) model based on one-class machine learning algorithms to address these limitations. By constructing a dataset from the QKD system's operational states, the AD model learns the char…

Enhancing Serendipity Recommendation System by Constructing Dynamic User Knowledge Graphs with Large Language Models
Qian Yong, Yanhui Li, Jialiang Shi, Yaguang Dou, Tian Qi
https://arxiv.org/abs/2508.04032

Enhancing Serendipity Recommendation System by Constructing Dynamic User Knowledge Graphs with Large Language Models
The feedback loop in industrial recommendation systems reinforces homogeneous content, creates filter bubble effects, and diminishes user satisfaction. Recently, large language models(LLMs) have demonstrated potential in serendipity recommendation, thanks to their extensive world knowledge and superior reasoning capabilities. However, these models still face challenges in ensuring the rationality of the reasoning process, the usefulness of the reasoning results, and meeting the latency requirem…

Per-antenna power constraints: constructing Pareto-optimal precoders with cubic complexity under non-negligible noise conditions
Sergey Petrov, Samson Lasaulce, Merouane Debbah
https://arxiv.org/abs/2508.09646

Per-antenna power constraints: constructing Pareto-optimal precoders with cubic complexity under non-negligible noise conditions
Precoding matrix construction is a key element of the wireless signal processing using the multiple-input and multiple-output model. It is established that the problem of global throughput optimization under per-antenna power constraints belongs, in general, to the class of monotonic optimization problems, and is unsolvable in real-time. The most widely used real-time baseline is the suboptimal solution of Zero-Forcing, which achieves a cubic complexity by discarding the background noise coeffi…

An Extended Variational Barzilai-Borwein Method
Xin Xu
https://arxiv.org/abs/2506.12731 https://arxiv.org/pdf/2506.12731

An Extended Variational Barzilai-Borwein Method
The Barzilai-Borwein (BB) method is an effective gradient descent algorithm for solving unconstrained optimization problems. Based on the observation of two classical BB step sizes, by constructing a variational least squares model, we propose a novel class of BB step sizes, each of which still retains the quasi-Newton property, with the original two BB step sizes being their two extreme cases.

A Relativity-Based Framework for Statistical Testing Guided by the Independence of Ancillary Statistics: Methodology and Nonparametric Illustrations
Albert Vexler, Douglas Landsittel
https://arxiv.org/abs/2507.11816

A Relativity-Based Framework for Statistical Testing Guided by the Independence of Ancillary Statistics: Methodology and Nonparametric Illustrations
This paper introduces a decision-theoretic framework for constructing and evaluating test statistics based on their relationship with ancillary statistics-quantities whose distributions remain fixed under the null and alternative hypotheses. Rather than focusing solely on maximizing discriminatory power, the proposed approach emphasizes reducing dependence between a test statistic and relevant ancillary structures. We show that minimizing such dependence can yield most powerful (MP) procedures.…

Instrument-based quantum resources: quantification, hierarchies and towards constructing resource theories
Jatin Ghai, Arindam Mitra
https://arxiv.org/abs/2508.09134 https://

Instrument-based quantum resources: quantification, hierarchies and towards constructing resource theories
Quantum resources are certain features of the quantum world that provide advantages in certain information-theoretic, thermodynamic, or any other useful operational tasks that are outside the realm of what classical theories can achieve. Quantum resource theories provide us with an elegant framework for studying these resources quantitatively and rigorously. While numerous state-based quantum resource theories have already been investigated, and to some extent, measurement-based resource theori…

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
Chao Yang, Zhujun Zhang
https://arxiv.org/abs/2506.12726 https://

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on translational tiling problems where the tilings are subject to the geometric shapes of the tiles only. However, all these results are proved by constructing tiles with extremely concave shapes. It is natural to ask: can we obtain undecidability results of tr…

Fast automated adjoints for spectral PDE solvers
Calum S. Skene, Keaton J. Burns
https://arxiv.org/abs/2506.14792 https://arxiv.org/p…

Fast automated adjoints for spectral PDE solvers
We present a general and automated approach for computing model gradients for PDE solvers built on sparse spectral methods, and implement this capability in the widely used open-source Dedalus framework. We apply reverse-mode automatic differentiation to symbolic graph representations of PDEs, efficiently constructing adjoint solvers that retain the speed and memory efficiency of this important class of modern numerical methods. This approach enables users to compute gradients and perform optim…

Leveraging Quantum Layers in Classical Neural Networks
Silvie Ill\'esov\'a
https://arxiv.org/abs/2507.12505 https://arxiv.org…

Leveraging Quantum Layers in Classical Neural Networks
Hybrid quantum-classical neural networks represent a promising frontier in the search for improved machine learning models. This thesis explores the integration of quantum layers within classical convolutional neural network architectures, aiming to leverage quantum entanglement and feature mapping to enhance learning capabilities. A detailed methodology for constructing and training such hybrid models is presented, using PyTorch and Qiskit Machine Learning frameworks. Experiments investigate t…

Topological Contextuality and Quantum Representations
Tzu-Miao Chou
https://arxiv.org/abs/2506.14537 https://arxiv.org/pdf/2506.14537…

Topological Contextuality and Quantum Representations
Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid group representations induced by modular categories, particularly those associated with SU(2) at level k and Fibonacci anyon models, exhibit state-dependent contextuality characterized by violations of noncontextuality inequalities. By explicitly constructing …

A Hybrid Neural Network -- Polynomial Series Scheme for Learning Invariant Manifolds of Discrete Dynamical Systems
Dimitrios G. Patsatzis, Nikolaos Kazantzis, Ioannis G. Kevrekidis, Constantinos Siettos
https://arxiv.org/abs/2506.13950

A Hybrid Neural Network -- Polynomial Series Scheme for Learning Invariant Manifolds of Discrete Dynamical Systems
We propose a hybrid machine learning scheme to learn -- in physics-informed and numerical analysis-informed fashion -- invariant manifolds (IM) of discrete maps for constructing reduced-order models (ROMs) for dynamical systems. The proposed scheme combines polynomial series with shallow neural networks, exploiting the complementary strengths of both approaches. Polynomials enable an efficient and accurate modeling of ROMs with guaranteed local exponential convergence rate around the fixed poin…

Optomagnonic continuous-variable quantum teleportation enhanced by non-Gaussian distillation
Zi-Xu Lu, Xuan Zuo, Zhi-Yuan Fan, Jie Li
https://arxiv.org/abs/2507.12065

Optomagnonic continuous-variable quantum teleportation enhanced by non-Gaussian distillation
The capability of magnons to coherently couple with various quantum systems makes them an ideal candidate to build hybrid quantum systems. The optomagnonic coupling is essential for constructing a hybrid magnonic quantum network, as the transmission of quantum information among remote quantum nodes must be accomplished using light rather than microwave field. Here we provide an optomagnonic continuous-variable quantum teleportation protocol, which enables the transfer of an input optical state …

Coherent states of finite-level systems
A. I. Breev, D. M. Gitman
https://arxiv.org/abs/2506.10668 https://arxiv.org/pdf/2506.10668…

Coherent states of finite-level systems
A method for constructing coherent states (CS) of finite-level systems with a given angular momentum is proposed. To this end we generalize the known spin equation (SE) to an infinite-dimensional Fock space. The equation describes a special quadratic system in the latter space. Its projections on $d$-dimensional subspaces, represent analogs of SE for $d$-dimensional systems in an external electromagnetic field which describe $d$-dimensional systems with a given angular moment. Using a modificat…