Tootfinder

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

LPrL: An Asynchronous Linear Time Hyper Logic
We present a novel asynchronous hyper linear time temporal logic named LPrL (Linear Time Predicate Logic) and establish its basic theory. LPrL is a natural first order extension of LTL (Linear time temporal logic), in which the predicates specify the properties of and the relationships between traces (infinite sequences of actions) using Boolean combinations of LTL formulas. To augment the expressive power of the logic, we introduce a simple language of terms and add the equality predicate t = …

<wolfgang> the problem with the 'go find a real girl' admonition is
that so few of them actually have naked transformation
sequences
<reality> Dude, my girlfriend changes like four times a day

Regularized Extragradient Methods for Solving Equilibrium Problems on Hadamard Manifolds
Shikher Sharmaa, Pankaj Gautam, Simeon Reich
https://arxiv.org/abs/2506.22391

Regularized Extragradient Methods for Solving Equilibrium Problems on Hadamard Manifolds
Employing two distinct types of regularization terms, we propose two regularized extragradient methods for solving equilibrium problems on Hadamard manifolds. The sequences generated by these extragradient algorithms converge to a solution of the equilibrium problem without requiring the Lipschitz continuity of the bifunction or imposing additional conditions on the parameters. We establish convergence results for both algorithms and derive global error bounds along with $R$-linear convergence …

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

Fast uncovering of protein sequence diversity from structure
We present InvMSAFold, an inverse folding method for generating protein sequences that is optimized for diversity and speed. For a given structure, InvMSAFold generates the parameters of a probability distribution over the space of sequences with pairwise interactions, capturing the amino acid covariances observed in Multiple Sequence Alignments (MSA) of homologous proteins. This allows for the efficient generation of highly diverse protein sequences while preserving structural and functional i…

Single-Trajectory Bayesian Modeling Reveals Multi-State Diffusion of the MSH Sliding Clamp
Seongyu Park, Inho Yang, Jinseob Lee, Sinwoo Kim, Juana Mart\'in-L\'opez, Richard Fishel, Jong-Bong Lee, Jae-Hyung Jeon
https://arxiv.org/abs/2506.21943

Single-Trajectory Bayesian Modeling Reveals Multi-State Diffusion of the MSH Sliding Clamp
DNA mismatch repair (MMR) is the essential mechanism for preserving genomic integrity in various living organisms. In this process, MutS homologs (MSH) play crucial roles in identifying mismatched basepairs and recruiting downstream MMR proteins. The MSH protein exhibits distinct functions and diffusion dynamics before and after the recognition of mismatches while traversing along DNA. An ADP-bound MSH, known as the MSH searching clamp, scans DNA sequences via rotational diffusion along the DNA…

A wonderful description of how the technology works.

"ChatGPT generates realistic responses by making guesses about which fragments of text should follow other sequences, based on a statistical model that has ingested billions of examples of text pulled from all over the internet. In Mr. Mata’s case, the program appears to have discerned the labyrinthine framework of a written legal argument, but has populated it with names and facts from a bouillabaisse of existing cases."

Some notes on Lamperti's recurrence of stochastic sequences
Vyacheslav M. Abramov
https://arxiv.org/abs/2506.21829 https://arxiv.…

Some notes on Lamperti's recurrence of stochastic sequences
The present study provides another look on Lamperti's theorem on recurrence or transience of stochastic sequences. We establish connection between Lamperti's theorem and the recent result by the author [V. M. Abramov, A new criterion for recurrence of Markov chains with infinitely countable set of states. \emph{Theor. Probab. Math. Stat.} \textbf{112} (2025), 1--15].

This https://arxiv.org/abs/2402.01942 has been replaced.
link: https://scholar.google.com/scholar?q=a

Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Genome rearrangement is a common model for molecular evolution. In this paper, we consider the Pairwise Rearrangement problem, which takes as input two genomes and asks for the number of minimum-length sequences of permissible operations transforming the first genome into the second. In the Single Cut-and-Join model (Bergeron, Medvedev, & Stoye, J. Comput. Biol. 2010), Pairwise Rearrangement is $\#\textsf{P}$-complete (Bailey, et. al., COCOON 2023), which implies that exact sampling is intracta…

A Family of Sequences Generalizing the Thue Morse and Rudin Shapiro Sequences
Russell Jay Hendel
https://arxiv.org/abs/2505.20547 https://

A Family of Sequences Generalizing the Thue Morse and Rudin Shapiro Sequences
For $m \ge 1,$ let $P_m =1^m,$ the binary string of $m$ ones. Further define the infinite sequence $s_m$ by $s_{m,n} = 1$ iff the number of (possibly overlapping) occurrences of $P_m$ in the binary representation of $n$ is odd, $n \ge 0.$ For $m=1,2$ respectively $s_m$ is the Thue-Morse and Rudin-Shapiro sequences. This paper shows: (i) $s_m$ is automatic; (ii) the minimal, DFA (deterministic finite automata) accepting $s_m$ has $2m$ states; (iii) it suffices to use prefixes of length $2^{m-1}$…

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

Multiple Cylinder of Relations for Finite Spaces and Nerve Theorem for Strong-Good Cover
In this paper, we develop the concept of multiple cylinder of relations which is a generalization of the relation cylinder, extending the multiple non-Hausdorff mapping cylinder to sequences of finite T0-spaces linked by a series of relations. This construction is important in capturing complex homotopical structures across chains of finite spaces and, when the relations are induced by maps, it serves as a third space that collapses to two distinct finite spaces. Additionally, we introduce the …

On Base, Normal and Near-normal Sequences
Xu Wang, Jiayi Zhu
https://arxiv.org/abs/2506.20296 https://arxiv.org/pdf/2506.20296…

On Base, Normal and Near-normal Sequences
The base sequences BS(n+1,n) are four sequences of $\pm1$ and lengths n+1,n+1,n,n with zero auto correlation. The base sequence conjecture states that BS(n+1,n) exists for all integers $n>0$ and has been verified for $n\le40$. We present our algorithm and gives construction of BS(n+1,n) for $n=41,42,43$. The Normal sequences NS (n) and the Near-normal sequences NNS (n) are subclasses of BS(n+1,n). Yang conjecture asserts that there is a NNS(n) for each even integer n and has been verified for…

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

Gauss-Ramanujan Functions: Constructions, Properties, and Applications in Communications and Signal Processing
In this article, I construct a new set of functions based on Ramanujan sequences (RSEs), Gaussian pulse (GP), and its delayed Gaussian pulse (DGP). The motivation for this construction is based on the special properties of RSEs, GP, and DGP. First, I present a procedure for constructing Gauss-Ramanujan (GauRam) functions using selected RSEs. I develop an insightful analysis for deterministic and stochastic overlap between GP and DGP. Specifically, I present exact and closed form approximation e…

Negated String Containment is Decidable (Technical Report)
Vojt\v{e}ch Havlena, Michal He\v{c}ko, Luk\'a\v{s} Hol\'ik, Ond\v{r}ej Leng\'al
https://arxiv.org/abs/2506.22061

Negated String Containment is Decidable (Technical Report)
We provide a positive answer to a long-standing open question of the decidability of the not-contains string predicate. Not-contains is practically relevant, for instance in symbolic execution of string manipulating programs. Particularly, we show that the predicate notContains(x1 ... xn, y1 ... ym), where x1 ... xn and y1 ... ym are sequences of string variables constrained by regular languages, is decidable. Decidability of a not-contains predicate combined with chain-free word equations and …

Coprimality of elements in regular sequences with polynomial growth
Jean-Marc Deshouillers, Sunil Naik
https://arxiv.org/abs/2506.20956 https://

Coprimality of elements in regular sequences with polynomial growth
The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the existence of long blocks of $k$-wise coprime elements in certain regular sequences. More precisely, we prove that for any positive integers $H \geq k \geq 2$ and for a real-valued $k$-times continuously differentiable function $f \in \mathcal{C}^k\left( [1, \i…

Simulation-based digital twinning of activation and repolarisation sequences from the ECG across healthy and diseased hearts
James A Coleman, Julia Camps, Abdallah I Hasaballa, Alfonso Bueno-Orovio
https://arxiv.org/abs/2506.22243

Simulation-based digital twinning of activation and repolarisation sequences from the ECG across healthy and diseased hearts
Abnormal patterns of ventricular repolarisation contribute to lethal arrhythmias in various cardiac conditions, including inherited and acquired channelopathies, cardiomyopathies, and ischaemic heart disease. However, methods to detect these repolarisation abnormalities are limited. In this study, we introduce and assess a novel simulation-based method to infer ventricular activation and repolarisation times from the 12-lead electrocardiogram (ECG) and magnetic resonance-derived ventricular a…

On Characterizations of Convex and Approximately Subadditive Sequences
Angshuman Robin Goswami
https://arxiv.org/abs/2505.22668 https://

On Characterizations of Convex and Approximately Subadditive Sequences
A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and demonstrate that such sequences can be locally interpolated by quadratic polynomials. Furthermore, the converse assertion of this statement is also established. On the other hand, a sequence $\Big(u_n\Big)_{n=1}^{\infty}$ is called approximately subadditive …

Cellular Automata as Generators of Interleaving Sequences
Sara D. Cardell
https://arxiv.org/abs/2506.18848 https://arxiv.org/pdf/2506…

Cellular Automata as Generators of Interleaving Sequences
An interleaving sequence is obtained by combining or intertwining elements from two or more sequences. On the other hand, cellular automata are known to be generators for keystream sequences. In this paper we present two families of one-dimensional cellular automata as generators of interleaving sequences. This study aims to close a notable gap within the current body of literature by exploring the capacity of cellular automata to generate interleaving sequences. While previous works have separ…

Robust and Efficient Autoregressive Speech Synthesis with Dynamic Chunk-wise Prediction Policy
Bohan Li, Zhihan Li, Haoran Wang, Hanglei Zhang, Yiwei Guo, Hankun Wang, Xie Chen, Kai Yu
https://arxiv.org/abs/2506.22023

Robust and Efficient Autoregressive Speech Synthesis with Dynamic Chunk-wise Prediction Policy
Recently, autoregressive (AR) language models have emerged as a dominant approach in speech synthesis, offering expressive generation and scalable training. However, conventional AR speech synthesis models relying on the next-token prediction paradigm often encounter significant challenges when handling long speech sequences. These models often struggle to construct stable frame-to-frame attention, leading to increased latency and degraded synthesis quality, thereby limiting their feasibility f…

Resolving the joint ergodicity problem for Hardy sequences
Sebasti\'an Donoso, Andreas Koutsogiannis, Borys Kuca, Wenbo Sun, Konstantinos Tsinas
https://arxiv.org/abs/2506.20459

Resolving the joint ergodicity problem for Hardy sequences
The joint ergodicity classification problem aims to characterize those sequences which are jointly ergodic along an arbitrary dynamical system if and only if they satisfy two natural, simpler-to-verify conditions on this system. These two conditions, dubbed the difference and product ergodicity conditions, naturally arise from Berend and Bergelson's pioneering work on joint ergodicity. Elaborating on our earlier work, we investigate this problem for Hardy sequences of polynomial growth, this ti…

SZ Sequences: Binary-Based $(0, 2^q)$-Sequences
Abdalla G. M. Ahmed, Matt Pharr, Victor Ostromoukhov, Hui Huang
https://arxiv.org/abs/2505.20434 https://…

SZ Sequences: Binary-Based $(0, 2^q)$-Sequences
Low-discrepancy sequences have seen widespread adoption in computer graphics thanks to their superior convergence rates. Since rendering integrals often comprise products of lower-dimensional integrals, recent work has focused on developing sequences that are also well-distributed in lower-dimensional projections. To this end, we introduce a novel construction of binary-based (0, 4)-sequences; that is, progressive fully multi-stratified sequences of 4D points, and extend the idea to higher powe…

Conformance Checking for Less: Efficient Conformance Checking for Long Event Sequences
Eli Bogdanov, Izack Cohen, Avigdor Gal
https://arxiv.org/abs/2505.21506

Conformance Checking for Less: Efficient Conformance Checking for Long Event Sequences
Long event sequences (termed traces) and large data logs that originate from sensors and prediction models are becoming increasingly common in our data-rich world. In such scenarios, conformance checking-validating a data log against an expected system behavior (the process model) can become computationally infeasible due to the exponential complexity of finding an optimal alignment. To alleviate scalability challenges for this task, we propose ConLES, a sliding-window conformance checking appr…

Cyclicity of interaction frame transformations
Michael C D Tayler, Mohamed Sabba
https://arxiv.org/abs/2506.20594 https://arxiv.org/p…

Cyclicity of interaction frame transformations
We identify a cyclic property of rotation sequences involving piecewise displacements $β$ about arbitrary axes in three dimensions. Specifically, when transformation to the toggling frame is applied successively $m$ times, for $β=2π/m$ the original sequence returns. This main result unites several families of rotation sequences used for error-tuned control across quantum technologies, from NMR and MRI to atomic clocks and atom-scale computing. For the widest class of cycle, $m=2$, we highlig…

Stallings' Group is Simply Connected at Infinity
Michael Mihalik
https://arxiv.org/abs/2506.19195 https://arxiv.org/pdf/2506.1919…

Stallings' Group is Simply Connected at Infinity
Let $F_2$ be the free group on two generators and let $B_n$ ($n \geq 2$) denote the kernel of the homomorphism $$F_2 \times \cdots (n) \cdots \times F_2 \rightarrow {\mathbb Z}$$ sending all generators to the generator $1$ of $\mathbb Z$. The groups $B_k$ are called the {\it Bieri-Stallings} groups and $B_k$ is type $\mathcal F_{k-1}$ but not $\mathcal F_k$. For $n\geq 3$ there are short exact sequences of the form $$1 \rightarrow B_{n-1} \rightarrow B_n \rightarrow F_2 \rightarrow 1.$$ Thi…

Transitivity of mutation of $\tau$-exceptional sequences in the $\tau$-tilting finite case
Aslak B. Buan, Eric J. Hanson, Bethany R. Marsh
https://arxiv.org/abs/2506.21372

Transitivity of mutation of $τ$-exceptional sequences in the $τ$-tilting finite case
We prove that mutation of complete $τ$-exceptional sequences is transitive for $τ$-tilting finite algebras.

Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
Roland Andrews, Justin Carpentier, Adrien Taylor
https://arxiv.org/abs/2506.22428

Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
This work investigates the convergence behavior of augmented Lagrangian methods (ALMs) when applied to convex optimization problems that may be infeasible. ALMs are a popular class of algorithms for solving constrained optimization problems. We establish progressively stronger convergence results, ranging from basic sequence convergence to precise convergence rates, under a hierarchy of assumptions. In particular, we demonstrate that, under mild assumptions, the sequences of iterates generated …

Homology and cohomology of crossed products by inverse monoid actions and Steinberg algebras
Mikhailo Dokuchaev, Mykola Khrypchenko, Juan Jacobo Sim\'on
https://arxiv.org/abs/2506.20321

Homology and cohomology of crossed products by inverse monoid actions and Steinberg algebras
Given a unital action $θ$ of an inverse monoid $S$ on an algebra $A$ over a filed $K$ we produce (co)homology spectral sequences which converge to the Hochschild (co)homology of the crossed product $A\rtimes_θS$ with values in a bimodule over $A\rtimes_θS$. The spectral sequences involve a new kind of (co)homology of the inverse monoid $S,$ which is based on $KS$-modules. The spectral sequences take especially nice form, when $(A\rtimes_θS)^e $ is flat as a left (homology case) or right (co…

Inequalities related to the coefficients of the $j$-function
Zhongjie Li
https://arxiv.org/abs/2506.19292 https://arxiv.org/pdf/2506.…

Inequalities related to the coefficients of the $j$-function
In recent years, the log-concavity or log-convexity of combinatorial sequences and their root sequences, higher order Tur{á}n inequalities, and Laguerre inequalities of order two have been widely studied. However, the research of the Fourier coefficient $c(n)$ of the $j$-function is limited to its asymptotic form. In this paper, we give the appropriate upper and lower bounds of $c(n)$ to establish the inequalities associated with it.

On maldistributed sequences and meager ideals
Paolo Leonetti
https://arxiv.org/abs/2505.20490 https://arxiv.org/pdf/2505.20490…

On maldistributed sequences and meager ideals
We show that an ideal $\mathcal{I}$ on $ω$ is meager if and only if the set of sequences $(x_n)$ taking values in a Polish space $X$ for which all elements of $X$ are $\mathcal{I}$-cluster points of $(x_n)$ is comeager. The latter condition is also known as $ν$-maldistribution, where $ν: \mathcal{P}(ω)\to \mathbb{R}$ is the $\{0,1\}$-valued submeasure defined by $ν(A)=1$ if and only if $A\notin \mathcal{I}$. It turns out that the meagerness of $\mathcal{I}$ is also equivalent to a technica…

Arithmetic properties and zeros of the Bergman kernel on a class of quotient domains
Luke D. Edholm, Vikram T. Mathew
https://arxiv.org/abs/2505.20489 http…

Arithmetic properties and zeros of the Bergman kernel on a class of quotient domains
An effective formula for the Bergman kernel on $\mathbb{H}_γ = \{|z_1|^γ< |z_2| < 1 \}$ is obtained for rational $γ= \frac{m}{n} >1$. The formula depends on arithmetic properties of $γ$, which uncovers new symmetries and clarifies previous results. The formulas are then used to study the Lu Qi-Keng problem. We produce sequences of rationals $γ_j \searrow 1$, where each $\mathbb{H}_{γ_j}$ has a Bergman kernel with zeros (while $\mathbb{H}_1$ is known to have a zero-free…

On generalized limits and ultrafilters
Paolo Leonetti, Cihan Orhan
https://arxiv.org/abs/2505.23263 https://arxiv.org/pdf/2505.23263

On generalized limits and ultrafilters
Given an ideal $\mathcal{I}$ on $ω$, we denote by $\mathrm{SL}(\mathcal{I})$ the family of positive normalized linear functionals on $\ell_\infty$ which assign value $0$ to all characteristic sequences of sets in $\mathcal{I}$. We show that every element of $\mathrm{SL}(\mathcal{I})$ is a Choquet average of certain ultrafilter limit functionals. Also, we prove that the diameter of $\mathrm{SL}(\mathcal{I})$ is $2$ if and only if $\mathcal{I}$ is not maximal, and that the latter claim can be co…

Predicting protein folding dynamics using sequence information
Ezequiel A. Galpern, Federico Caama\~no, Diego U. Ferreiro
https://arxiv.org/abs/2505.17237 …

Predicting protein folding dynamics using sequence information
Natural protein sequences somehow encode the structural forms that these molecules adopt. Recent developments in structure-prediction are agnostic to the mechanisms by which proteins fold and represent them as static objects. However, the amino acid sequences also encode information about how the folding process can happen, and how variations in the sequences impact on the populations of the distinct structural forms that proteins acquire. Here we present a method to infer protein folding dynam…

On coprimality of consecutive elements in certain sequences
Jean-Marc Deshouillers, Sunil Naik
https://arxiv.org/abs/2506.20948 https://

On coprimality of consecutive elements in certain sequences
The study of finding blocks of primes in certain arithmetic sequences is one of the classical problems in number theory. It is also very interesting to study blocks of consecutive elements in such sequences that are pairwise coprime. In this context, we show that if $f$ is a twice continuously differentiable real-valued function on $[1, \infty)$ such that $f''(x) \to 0$ as $x \to \infty$ and $\limsup_{x \to \infty} f'(x) = \infty$, then there exist arbitrarily long blocks of pairwise coprime co…

On quasi-periodic decameter radio emission from Jupiter related to Ganymede
V. E. Shaposhnikov, V. V. Zaitsev
https://arxiv.org/abs/2506.18581 https://

On quasi-periodic decameter radio emission from Jupiter related to Ganymede
The paper discusses the possibility of implementing a plasma generation mechanism in a source of decameter radio emission associated with Ganymede and an explanation based on this mechanism of forming quasi-periodic sequences of bursts of this radiation. According to the discussed model, the registered quasi-periodic sequences of radiation pulses are a consequence of implementing in the source a pulsating mode of plasma wave conversion into extraordinary electromagnetic waves with a small refra…

Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
Pablo Torres
https://arxiv.org/abs/2506.21235 ht…

Grundy double domination number: bounds, graph operations, and efficient computation for $P_4$-tidy graphs
Inspired by graph domination games, various domination-type vertex sequences have been introduced, including the Grundy double dominating sequence (GDDS) of a graph and its associated parameter, the Grundy double domination number (GDDN). The decision version of the problem of computing the GDDN is known to be NP-complete, even when restricted to split graphs and bipartite graphs. In this paper, we establish general tight bounds for the GDDN. We also describe GDDSs for vertex-removed graphs and…

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

Task-Optimized Convolutional Recurrent Networks Align with Tactile Processing in the Rodent Brain
Tactile sensing remains far less understood in neuroscience and less effective in artificial systems compared to more mature modalities such as vision and language. We bridge these gaps by introducing a novel Encoder-Attender-Decoder (EAD) framework to systematically explore the space of task-optimized temporal neural networks trained on realistic tactile input sequences from a customized rodent whisker-array simulator. We identify convolutional recurrent neural networks (ConvRNNs) as superior …

Role of bubble positioning in force induced melting of DNA
Bidisha Mukherjee, Amit Raj Singh, Garima Mishra
https://arxiv.org/abs/2506.18821 https://

Role of bubble positioning in force induced melting of DNA
We investigate the role of bubble positioning in the force-induced melting of double-stranded DNA using two distinct approaches: Brownian Dynamics simulations and the Gaussian Network Model. We isolate the effect of bubble positioning by using DNA molecules with 50% AT - 50% GC base-pair composition which ensures constant enthalpy. Our results reveal that it is not just the sequence itself, but its specific arrangement that influences DNA stability. We examine two types of DNA sequences contain…

Moderately Heavy Extremes under Long Range Dependence
Zao-Li Chen
https://arxiv.org/abs/2505.23103 https://arxiv.org/pdf/2505.23103…

Moderately Heavy Extremes under Long Range Dependence
We consider stationary sequences whose marginal tail is subexponential and lies in the Gumbel Maximum domain of attraction. Due to the extremely strong dependence, their extreme values are caused by multiple big values and are clustered in the large scale with fractal features. We establish functional extremal limit theorems with non-Gumbel limit objects to characterize these delicate phenomena.

Complex Model Transformations by Reinforcement Learning with Uncertain Human Guidance
Kyanna Dagenais, Istvan David
https://arxiv.org/abs/2506.20883 https:…

Complex Model Transformations by Reinforcement Learning with Uncertain Human Guidance
Model-driven engineering problems often require complex model transformations (MTs), i.e., MTs that are chained in extensive sequences. Pertinent examples of such problems include model synchronization, automated model repair, and design space exploration. Manually developing complex MTs is an error-prone and often infeasible process. Reinforcement learning (RL) is an apt way to alleviate these issues. In RL, an autonomous agent explores the state space through trial and error to identify benef…

Capacity Matters: a Proof-of-Concept for Transformer Memorization on Real-World Data
Anton Changalidis, Aki H\"arm\"a
https://arxiv.org/abs/2506.14704

Capacity Matters: a Proof-of-Concept for Transformer Memorization on Real-World Data
This paper studies how the model architecture and data configurations influence the empirical memorization capacity of generative transformers. The models are trained using synthetic text datasets derived from the Systematized Nomenclature of Medicine (SNOMED) knowledge graph: triplets, representing static connections, and sequences, simulating complex relation patterns. The results show that embedding size is the primary determinant of learning speed and capacity, while additional layers provi…

A note on the perturbations of subshifts
Haritha Cheriyath
https://arxiv.org/abs/2506.20750 https://arxiv.org/pdf/2506.20750

A note on the perturbations of subshifts
In this paper, we consider different classes of subshifts and study their perturbations obtained by forbidding sequences that contain a given word as a subword. We show that the perturbations of sofic shifts are sofic. Though not true for general coded systems, we provide sufficient conditions under which perturbations of synchronized systems remain synchronized. We investigate which systems remain conjugate under perturbation by a word from a coded system. We also explicitly calculate the drop…

The Milky Way in context: The formation of galactic discs and chemical sequences from a cosmological perspective
Matthew D. A. Orkney, Chervin F. P. Laporte, Robert J. J. Grand, Volker Springel
https://arxiv.org/abs/2506.07038

The Milky Way in context: The formation of galactic discs and chemical sequences from a cosmological perspective
We study the formation of chemical sequences in the stellar disc of Milky Way (MW)-mass galaxies in a full cosmological context with the Auriga simulations. We focus on the conditions giving rise to bi-modal $α$-chemistry in the MW disc and the potential influence of mergers (e.g. Gaia-Enceladus, GSE). We find a wide diversity of chemical sequences, without correlation between the emergence of dichotomous $α$-chemistry and GSE-like mergers. The transition between multiple $α$-sequences is se…

Examination of Eye-Tracking, Head-Gaze, and Controller-Based Ray-casting in TMT-VR: Performance and Usability Across Adulthood
Panagiotis Kourtesis, Evgenia Giatzoglou, Panagiotis Vorias, Katerina Alkisti Gounari, Eleni Orfanidou, Chrysanthi Nega
https://arxiv.org/abs/2506.19519

Examination of Eye-Tracking, Head-Gaze, and Controller-Based Ray-casting in TMT-VR: Performance and Usability Across Adulthood
Virtual reality (VR) can enrich neuropsychological testing, yet the ergonomic trade-offs of its input modes remain under-examined. Seventy-seven healthy volunteers-young (19-29 y) and middle-aged (27-56 y)-completed a VR Trail-Making Test with three pointing methods: eye-tracking, head-gaze, and a six-degree-of-freedom hand controller. Completion time, spatial accuracy, and error counts for the simple (Trail A) and alternating (Trail B) sequences were analysed in 3 x 2 x 2 mixed-model ANOVAs; p…

Hunting for UVdim stars in Galactic Open clusters. Clues from ultraviolet photometry
G. Cordoni, A. P. Milone, L. Casagrande, L. Venuti, E. P. Lagioia, F. Muratore, A. F. Marino, G. S. Da Costa, F. Dell'Agli, F. D'Antona
https://arxiv.org/abs/2506.21519

Hunting for UVdim stars in Galactic Open clusters. Clues from ultraviolet photometry
Split main-sequences (MSs) and extended main-sequence turn-offs (eMSTOs) have been observed in nearly all Magellanic Clouds clusters younger than 2 Gyr. More recently, Hubble Space Telescope (HST) ultraviolet photometry uncovered a puzzling new population of UV-absorbed stars, dubbed UVdim, in five Magellanic Clouds clusters aged between 40 and 200 Myr, as well as in one 1.5 Gyr-old cluster. These UVdim stars predominantly lie on the blue MS, which is composed of slow rotators, and their distin…

The Casimir eigenvalues on $ad^{\otimes k}$ of SU(N) are linear on N
R. L. Mkrtchyan
https://arxiv.org/abs/2506.13062 https://arxiv.o…

The Casimir eigenvalues on $ad^{\otimes k}$ of SU(N) are linear on N
We consider eigenvalues of the Casimir operator on the naturally defined \textit{stable sequences} of representations of $su(N)$ algebra and prove that eigenvalues are linear over $N$ iff $λ_1+2λ_2+...+kλ_k=λ_{N-1}+2λ_{N-2}+...+kλ_{N-k}$, where $λ_i$ are Dynkin labels, and $λ_i=0$ for $k

On the Maximization of Real Sequences
Assal\'e Adj\'e
https://arxiv.org/abs/2506.18409 https://arxiv.org/pdf/2506.18409

On the Maximization of Real Sequences
In this paper, we study a maximization problem on real sequences. More precisely, for a given sequence, we are interesting in computing the supremum of the sequence and an index for which the associated term is maximal. We propose a general methodology to solve this maximization problem. The method is based on upper approximations constructed from pairs of eventually decreasing sequences of strictly increasing continuous functions on $[0,1]$ and of scalars in $(0,1)$. Then, we can associate int…

The Ultimate Signs of Second-Order Holonomic Sequences
Fugen Hagihara, Akitoshi Kawamura
https://arxiv.org/abs/2506.14751 https://arx…

The Ultimate Signs of Second-Order Holonomic Sequences
A real-valued sequence $f = \{ f(n) \}_{n \in \mathbb{N}}$ is said to be second-order holonomic if it satisfies a linear recurrence $f (n + 2) = P (n) f (n + 1) + Q (n) f (n)$ for all sufficiently large $n$, where $P, Q \in \mathbb{R}(x)$ are rational functions. We study the ultimate sign of such a sequence, i.e., the repeated pattern that the signs of $f (n)$ follow for sufficiently large $n$. For each $P$, $Q$ we determine all the ultimate signs that $f$ can have, and show how they partition …

Stability of the Morse Index for the $p$-harmonic Approximation of Harmonic Maps into Homogeneous Spaces
Dominik Schlagenhauf
https://arxiv.org/abs/2506.10761

Stability of the Morse Index for the $p$-harmonic Approximation of Harmonic Maps into Homogeneous Spaces
In the joint work of the author with Da Lio and Rivière (Morse Index Stability for Sequences of Sacks-Uhlenbeck Maps into a Sphere) we studied the stability of the Morse index for Sacks-Uhlenbeck sequences into spheres as $p\searrow2$. These are critical points of the energy $E_p(u) := \int_Σ\left( 1+|\nabla u|^2\right)^{p/2} \ dvol_Σ,$ where $u:Σ\rightarrow S^n$ is a map from a closed Riemannian surface $Σ$ into a sphere $ S^n$. In this paper we extend the results found in our p…

On the almost everywhere convergence of two-parameter ergodic averages along directional rectangles
Bastien Lecluse
https://arxiv.org/abs/2506.14283 https:…

On the almost everywhere convergence of two-parameter ergodic averages along directional rectangles
In this paper, we study the almost everywhere convergence of sequences of two-parameter ergodic averages over rectangles in the plane. On the one hand, we show that if the rectangles we consider have their sides with slopes in a finitely lacunary set, then the averages converge almost everywhere in all $L^p$ spaces, $1 < p \leq \infty$. On the other hand, given some non-lacunary sets of directions, we construct sequences of rectangles oriented along these directions for which the associated erg…

Introduction to the theory of generalized locally Toeplitz sequences and its applications
Carlo Garoni
https://arxiv.org/abs/2506.02151 https://

Introduction to the theory of generalized locally Toeplitz sequences and its applications
The theory of generalized locally Toeplitz (GLT) sequences was conceived as an apparatus for computing the spectral distribution of matrices arising from the numerical discretization of differential equations (DEs). The purpose of this review is to introduce the reader to the theory of GLT sequences and to present some of its applications to the computation of the spectral distribution of DE discretization matrices. We mainly focus on the applications, whereas the theory is presented in a self-…

Learning Obfuscations Of LLM Embedding Sequences: Stained Glass Transform
Jay Roberts, Kyle Mylonakis, Sidhartha Roy, Kaan Kale
https://arxiv.org/abs/2506.09452

Learning Obfuscations Of LLM Embedding Sequences: Stained Glass Transform
The high cost of ownership of AI compute infrastructure and challenges of robust serving of large language models (LLMs) has led to a surge in managed Model-as-a-service deployments. Even when enterprises choose on-premises deployments, the compute infrastructure is typically shared across many teams in order to maximize the return on investment. In both scenarios the deployed models operate only on plaintext data, and so enterprise data owners must allow their data to appear in plaintext on a …

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

Conditional Entropies of k-Deletion/Insertion Channels
The channel output entropy of a transmitted sequence is the entropy of the possible channel outputs and similarly the channel input entropy of a received sequence is the entropy of all possible transmitted sequences. The goal of this work is to study these entropy values for the k-deletion, k-insertion channels, where exactly k symbols are deleted, inserted in the transmitted sequence, respectively. If all possible sequences are transmitted with the same probability then studying the input and …

Gravitational Scattering of Two Neutron Stars
Joan Fontbut\'e, Sebastiano Bernuzzi, Piero Rettegno, Simone Albanesi, Wolfgang Tichy
https://arxiv.org/abs/2506.11204

Gravitational Scattering of Two Neutron Stars
We present the first numerical relativity simulations of the gravitational scattering of two neutron stars. Constraint-satisfying initial data for two equal-mass non-spinning sequences are constructed at fixed energy and various initial angular momenta (impact parameter) and evolved with Einstein equations through the scattering process. The strong-field scattering dynamics are explored up to scattering angles of $225^\circ$ and the threshold of dynamical captures. The transition to bound orbit…

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

Protein-DNA Co-condensation is Prewetting to a Collapsed Polymer
The three-dimensional organization of chromatin is thought to play an important role in controlling gene expression. Specificity in expression is achieved through the interaction of transcription factors and other nuclear proteins with particular sequences of DNA. At unphysiological concentrations many of these nuclear proteins can phase-separate in the absence of DNA, and it has been hypothesized that, in vivo, the thermodynamic forces driving these phases help determine chromosomal organizati…

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

An Algorithm for the Leading Monomials of a Minimal Groebner Basis of Generic Sequences
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties conjectured to hold for generic sequences-specifically, that their leading monomial ideals are weakly reverse lexicographic and that their Hilbert series follow a known closed-form expression. The algorithm incrementally constructs the set of leading monomials deg…

Eccentricity, extendable choice and descending distributive forcing
Calliope Ryan-Smith
https://arxiv.org/abs/2506.11607 https://arxi…

Eccentricity, extendable choice and descending distributive forcing
We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $κ$-descending distributive if for all decreasing sequences $(D_α)_{α<κ}$ of open dense sets, $\bigcap_αD_α$ is open dense. This generalises the informal idea that $\mathbb{P}$ doesn't affect much on the scale of $κ$, such as if $\mathbb{P}$ is $κ$-distributive or if $κ> \lvert \mathbb{P} \rvert$. For example, a $κ$-descending distributive forcing will not change the cofinality of $κ$ or introdu…

Hearing Hands: Generating Sounds from Physical Interactions in 3D Scenes
Yiming Dou, Wonseok Oh, Yuqing Luo, Antonio Loquercio, Andrew Owens
https://arxiv.org/abs/2506.09989

Hearing Hands: Generating Sounds from Physical Interactions in 3D Scenes
We study the problem of making 3D scene reconstructions interactive by asking the following question: can we predict the sounds of human hands physically interacting with a scene? First, we record a video of a human manipulating objects within a 3D scene using their hands. We then use these action-sound pairs to train a rectified flow model to map 3D hand trajectories to their corresponding audio. At test time, a user can query the model for other actions, parameterized as sequences of hand pos…

Practical colinear chaining on sequences revisited
Nicola Rizzo, Manuel C\'aceres, Veli M\"akinen
https://arxiv.org/abs/2506.11750 https://…

Practical colinear chaining on sequences revisited
Colinear chaining is a classical heuristic for sequence alignment and is widely used in modern practical aligners. Jain et al. (J. Comput. Biol. 2022) proposed an $O(n \log^3 n)$ time algorithm to chain a set of $n$ anchors so that the chaining cost matches the edit distance of the input sequences, when anchors are maximal exact matches. Moreover, assuming a uniform and sparse distribution of anchors, they provided a practical solution ($\mathtt{ChainX}$) working in $O(n \cdot \mathsf{SOL} + n …

INTERPOS: Interaction Rhythm Guided Positional Morphing for Mobile App Recommender Systems
M. H. Maqbool, Moghis Fereidouni, Umar Farooq, A. B. Siddique, Hassan Foroosh
https://arxiv.org/abs/2506.12661

INTERPOS: Interaction Rhythm Guided Positional Morphing for Mobile App Recommender Systems
The mobile app market has expanded exponentially, offering millions of apps with diverse functionalities, yet research in mobile app recommendation remains limited. Traditional sequential recommender systems utilize the order of items in users' historical interactions to predict the next item for the users. Position embeddings, well-established in transformer-based architectures for natural language processing tasks, effectively distinguish token positions in sequences. In sequential recommenda…

A study of a family of self-referential sequences
Benoit Cloitre
https://arxiv.org/abs/2506.18103 https://arxiv.org/pdf/2506.18103

A study of a family of self-referential sequences
We introduce and analyze a three-parameter family of self-referential integer sequences $S(x,y,z)$: starting from $a(1)=x$, each term advances by $y$ when the index $k$ has already appeared as a value and by $z$ otherwise. This simple rule generates a surprising zoo of behaviors, many of which are catalogued -- albeit in a rather unstructured fashion -- in the OEIS. Whenever $y>z>0$, we prove that the density $a(k)/k$ converges to the positive root of $r^2 - z r - (y - z) = 0$. Two subfamilies,…

Monotonicity properties of hyperbolic projections in holomorphic iteration
Argyrios Christodoulou, Konstantinos Zarvalis
https://arxiv.org/abs/2506.19562 h…

Monotonicity properties of hyperbolic projections in holomorphic iteration
We consider hyperbolic projections of orbits of holomorphic self-maps of the unit disc, onto curves landing on the unit circle with a given angle. We show that under certain, necessary, assumptions, the projections exhibit monotonicity properties akin to those present in continuous dynamics. Our techniques are purely hyperbolic-geometric in nature and provide the general framework for analysing projections of arbitrary sequences onto curves.

Dirichlet kernel density estimation for strongly mixing sequences on the simplex
Hanen Daayeb, Salah Khardani, Fr\'ed\'eric Ouimet
https://arxiv.org/abs/2506.08816

Dirichlet kernel density estimation for strongly mixing sequences on the simplex
This paper investigates the theoretical properties of Dirichlet kernel density estimators for compositional data supported on simplices, for the first time addressing scenarios involving time-dependent observations characterized by strong mixing conditions. We establish rigorous results for the asymptotic normality and mean squared error of these estimators, extending previous findings from the independent and identically distributed (iid) context to the more general setting of strongly mixing …

inMOTIFin: a lightweight end-to-end simulation software for regulatory sequences
Katalin Ferenc, Lorenzo Martini, Ieva Rauluseviciute, Geir Kjetil Sandve, Anthony Mathelier
https://arxiv.org/abs/2506.20769

inMOTIFin: a lightweight end-to-end simulation software for regulatory sequences
The accurate development, assessment, interpretation, and benchmarking of bioinformatics frameworks for analyzing transcriptional regulatory grammars rely on controlled simulations to validate the underlying methods. However, existing simulators often lack end-to-end flexibility or ease of integration, which limits their practical use. We present inMOTIFin, a lightweight, modular, and user-friendly Python-based software that addresses these gaps by providing versatile and efficient simulation a…

The set of minimal distances of the monoid of plus-minus weighted zero-sum sequences and applications to the characterization problem
Kamil Merito (LAGA), Oscar Ordaz (UCV), Wolfgang Schmid (LAGA)
https://arxiv.org/abs/2506.14279

The set of minimal distances of the monoid of plus-minus weighted zero-sum sequences and applications to the characterization problem
Recently a systematic investigation of monoids of sequences of plus-minus weighted zero-sum sequences had been started, which is among others motivated by applications to monoids of norms of algebraic integers. In the current paper these investigations are continued. The focus is on the set of minimal distances of these monoids, which is an important arithmetical invariant. Applications to the characterization problem are discussed as well.

Tangent Cones of Concatenated Numerical Semigroups
Ranjana Mehta, Joydip Saha, Indranath Sengupta
https://arxiv.org/abs/2506.09400 https://

Tangent Cones of Concatenated Numerical Semigroups
We study the tangent cone at the origin and the Hilbert series for a family of numerical semigroups generated by concatenation of arithmetic sequences. We prove that all the concatenation classes have Cohen-Macaulay tangent cones except the symmetric class, however, the symmetric class does satisfy Rossi's conjecture.

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

An elementary proof of a criterion for subfunctors of Ext to be closed
Let $\mathcal{A}$ be an abelian category and let $F$ be a subbifunctor of the additive bifunctor $\text{Ext}_{\mathcal{A}}^{1}(-,-)\colon \mathcal{A}^{\text{op}}\times \mathcal{A}\to \mathsf{Ab}$. Buan proved in [4] that $F$ is closed if, and only if, $F$ has the $3\times 3$-lemma property, a certain diagrammatic property satisfied by the class of $F$-exact sequences. The proof of this result relies on the theory of exact categories and on the Freyd--Mitchell embedding theorem, a very well-know…

Ergodic averages and the large intersection property along IP sets
Bryna Kra, Or Shalom
https://arxiv.org/abs/2506.17771 https://arxi…

Ergodic averages and the large intersection property along IP sets
We study multiple ergodic averages along IP sets, meaning we restrict iterates in the averages to all finite sums of some infinite sequence of natural numbers. We give criteria for convergence and divergence in mean of these multiple averages and derive sufficient conditions for convergence to the projection onto the space of invariant functions. For a class of sequences that, roughly speaking, only have rational obstructions to such a limit, we show that the behavior is controlled by nilsystem…

Multi-domain anomaly detection in a 5G network
Thomas Hoger (LAAS-SARA), Philippe Owezarski (LAAS-SARA)
https://arxiv.org/abs/2506.12070 https://

Multi-domain anomaly detection in a 5G network
With the advent of 5G, mobile networks are becoming more dynamic and will therefore present a wider attack surface. To secure these new systems, we propose a multi-domain anomaly detection method that is distinguished by the study of traffic correlation on three dimensions: temporal by analyzing message sequences, semantic by abstracting the parameters these messages contain, and topological by linking them in the form of a graph. Unlike traditional approaches, which are limited to considering …

Pseudo-random sequences for low-cost operando impedance measurements of Li-ion batteries
Jussi Sihvo, No\"el Hallemans, Ai Hui Tan, David A. Howey, Stephen. R. Duncan, Tomi Roinila
https://arxiv.org/abs/2506.07519

Pseudo-random sequences for low-cost operando impedance measurements of Li-ion batteries
Operando impedance measurements are promising for monitoring batteries in the field. In this work, we present pseudo-random sequences for low-cost operando battery impedance measurements. The quadratic-residue ternary sequence and direct-synthesis ternary sequence exhibit specific properties related to eigenvectors of the discrete Fourier transform matrix that allow computationally efficient compensation for drifts and transients in operando impedance measurements. We describe the application o…

Atiyah constructions for Lie algebroid connections on fiber bundles
Chen He, Dadi Ni, Zhuo Chen
https://arxiv.org/abs/2506.18360 https://

Atiyah constructions for Lie algebroid connections on fiber bundles
To address the need for a unified framework that incorporates Lie algebroid connections on both vector and principal bundles, this paper investigates a generalized Atiyah algebroid structure and its short exact sequence. Building on this generalization, we describe Atiyah-type extensions and sequences that represent Atiyah classes through three explicit constructions designed to encode Lie algebroid connections compatible with specified sub-structures. As illustrative examples, we work out an e…

On the Residue Sequence in Logarithmic Topological Cyclic Homology
Tommy Lundemo
https://arxiv.org/abs/2506.14545 https://arxiv.org/p…

On the Residue Sequence in Logarithmic Topological Cyclic Homology
As a localizing invariant, THH participates in localization sequences of cyclotomic spectra. We resolve a conjecture of Rognes by relating these to residue sequences in logarithmic THH. Consequently, logarithmic THH, TR, and TC serve as strict generalizations of the constructions of Hesselholt--Madsen and Blumberg--Mandell, which moreover enjoy localization sequences without the regularity hypotheses usually required for dévissage. Combined with work of Ramzi--Sosnilo--Winges, our results impl…

EHCube4P: Learning Epistatic Patterns Through Hypercube Graph Convolution Neural Network for Protein Fitness Function Estimation
Muhammad Daud, Philippe Charton, Cedric Damour, Jingbo Wang, Frederic Cadet
https://arxiv.org/abs/2506.16921

EHCube4P: Learning Epistatic Patterns Through Hypercube Graph Convolution Neural Network for Protein Fitness Function Estimation
Understanding the relationship between protein sequences and their functions is fundamental to protein engineering, but this task is hindered by the combinatorially vast sequence space and the experimental noise inherent in fitness measurements. In this study, we present a novel framework that models the sequence landscape as a hypercube $H(k,2)$ and integrates wavelet-based signal denoising with a graph convolutional neural network (GCN) to predict protein fitness across rugged fitness landsca…

A noncommutative construction of families of biunitary matrices and application to subfactors
Keshab Chandra Bakshi, Satyajit Guin, Guruprasad
https://arxiv.org/abs/2506.14351

A noncommutative construction of families of biunitary matrices and application to subfactors
We introduce a construction that, given a pair (u,v) of complex Hadamard matrices of the same order, generates infinitely many biunitary matrices of varying (and distinct) orders. As a key application, this framework yields nested sequences of vertex model subfactors that are not a tower of downward basic construction. Notably, the construction is noncommutative: interchanging the matrices (i.e., considering (v,u) instead of (u,v)) can lead to non-isomorphic subfactors. Focusing on the Hadamard…

On the finite generation of the cohomology of bosonizations
Nicol\'as Andruskiewitsch, David Jaklitsch, Van C. Nguyen, Amrei Oswald, Julia Plavnik, Anne V. Shepler, Xingting Wang
https://arxiv.org/abs/2506.05267

On the finite generation of the cohomology of bosonizations
We use deformation sequences of (Hopf) algebras, extending the results of Negron and Pevtsova, to show that bosonizations of some suitable braided Hopf algebras by some suitable finite-dimensional Hopf algebras have finitely generated cohomology. In fact, our results are shown in more generality for smash products. As applications, we prove the bosonizations of some Nichols algebras (such as Nichols algebras of diagonal type, the restricted Jordan plane, Nichols algebras of direct sums of Jorda…

Anti-recurrence sequences
Robbert Fokkink, Gandhar Joshi
https://arxiv.org/abs/2506.13337 https://arxiv.org/pdf/2506.13337

Anti-recurrence sequences
We extend previous work on anti-recurrence sequences of Kimberling and Moses, Zaslavsky, and Bosma et al. Kimberling and Moses have formulated several questions on these sequences, which can be combined into the meta-conjecture that anti-recurrence sequences are sums of linear progressions and automatic sequences. We solve this conjecture under a restriction on the linear form that generates the anti-recurrence.

Memory cost of quantum contextuality with Pauli observables
Stefan Trandafir, Colm Kelleher, Ad\'an Cabello
https://arxiv.org/abs/2506.06869 https://…

Memory cost of quantum contextuality with Pauli observables
Classically simulating the quantum contextual correlations produced by sequences of ideal measurements of compatible observables requires the measured system to have an internal memory. Computing the minimum amount of memory needed is, in general, challenging. Here, building upon the work of Kleinmann et al. [New J. Phys. 13, 113011 (2011)], we prove that the memory cost for simulating the contextuality produced by the $10$ three-qubit observables of Mermin's pentagram is only $\log_2(5) \appro…

Fretting-Transformer: Encoder-Decoder Model for MIDI to Tablature Transcription
Anna Hamberger, Sebastian Murgul, Jochen Schmidt, Michael Heizmann
https://arxiv.org/abs/2506.14223

Fretting-Transformer: Encoder-Decoder Model for MIDI to Tablature Transcription
Music transcription plays a pivotal role in Music Information Retrieval (MIR), particularly for stringed instruments like the guitar, where symbolic music notations such as MIDI lack crucial playability information. This contribution introduces the Fretting-Transformer, an encoderdecoder model that utilizes a T5 transformer architecture to automate the transcription of MIDI sequences into guitar tablature. By framing the task as a symbolic translation problem, the model addresses key challenges…

On the Law of the Iterated Logarithm for m-dependent stationary random variables under sub-linear expectations
Wang-Yun Gu, Li-Xin Zhang
https://arxiv.org/abs/2506.10522

On the Law of the Iterated Logarithm for m-dependent stationary random variables under sub-linear expectations
This paper explores the Law of the Iterated Logarithm (LIL) for $m$-dependent sequences under the framework of sub-linear expectations. We first extend existing LIL results to sequences of independent, non-identically distributed random variables under sub-linear expectations. This extension serves as a crucial intermediary step, facilitating the subsequent establishment of the LIL for $m$-dependent stationary sequences. On the other hand, we also establish necessary conditions for $m$-dependen…

EnerBridge-DPO: Energy-Guided Protein Inverse Folding with Markov Bridges and Direct Preference Optimization
Dingyi Rong, Haotian Lu, Wenzhuo Zheng, Fan Zhang, Shuangjia Zheng, Ning Liu
https://arxiv.org/abs/2506.09496

EnerBridge-DPO: Energy-Guided Protein Inverse Folding with Markov Bridges and Direct Preference Optimization
Designing protein sequences with optimal energetic stability is a key challenge in protein inverse folding, as current deep learning methods are primarily trained by maximizing sequence recovery rates, often neglecting the energy of the generated sequences. This work aims to overcome this limitation by developing a model that directly generates low-energy, stable protein sequences. We propose EnerBridge-DPO, a novel inverse folding framework focused on generating low-energy, high-stability prot…

Characterizing infinite torsion subgroups of the circle through arithmetic-type sequences
Ayan Ghosh, Pratulananda Das
https://arxiv.org/abs/2506.15257 htt…

Characterizing infinite torsion subgroups of the circle through arithmetic-type sequences
In a recent work [Das et al., Bull. Sci. Math. 199 (2025), 103580], the structure of characterized subgroups corresponding to arithmetic-type sequences was investigated. Building upon this work, we further show that a characterized subgroup associated with an arithmetic-type sequence is countable if and only if it is torsion. Further we prove that any infinite torsion subgroup of the circle can be characterized by an arithmetic-type sequence with bounded ratio. Moreover, our findings demonstrat…

New Constructions of Full Flag Codes Based on Partial Spreads
Xiang Han, Xinran Li, Gang Wang
https://arxiv.org/abs/2506.15127 https://

New Constructions of Full Flag Codes Based on Partial Spreads
Flag codes are a class of multishot network codes comprising sequences of nested subspaces (flags) within the vector space $\mathbb{F}_q^n$, where $q$ is a prime power. In this paper, we propose a family of constructions for full flag codes based on partial spreads. The distances of this family include maximum distance (optimum distance flag codes), second-maximum distance (quasi-optimum distance flag codes), as well as other feasible values. The structure of these flag codes resembles that of …

Effective Versions of Strong Measure Zero
Matthew Rayman
#toXiv_bot_toot

Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
Bishwajit Prasad Gond, Rajneekant, Pushkar Kishore, Durga Prasad Mohapatra
https://arxiv.org/abs/2506.16224

Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
This paper investigates the application of natural language processing (NLP)-based n-gram analysis and machine learning techniques to enhance malware classification. We explore how NLP can be used to extract and analyze textual features from malware samples through n-grams, contiguous string or API call sequences. This approach effectively captures distinctive linguistic patterns among malware and benign families, enabling finer-grained classification. We delve into n-gram size selection, featu…

On the Use of Bj\"orck Sequences in LEO-based PNT Systems
Harish K. Dureppagari, Chiranjib Saha, R. Michael Buehrer, Harpreet S. Dhillon
https://arxiv.org/abs/2506.00706

On the Use of Björck Sequences in LEO-based PNT Systems
In this paper, we investigate the use of Björck sequences, a class of constant amplitude zero autocorrelation (CAZAC) sequences, as a potential candidate for the design of positioning reference signals (PRS) in Low Earth Orbit (LEO)-based positioning, navigation, and timing (PNT) systems. Unlike legacy systems such as Global Navigation Satellite Systems (GNSS) or terrestrial networks (TNs), LEO-based systems experience large Doppler shifts and delay spreads, where traditional orthogonalization…

On exact diagrams and strict morphisms
Dinam\'erico P. Pombo Jr
https://arxiv.org/abs/2506.16585 https://arxiv.org/pdf/2506.16585…

On exact diagrams and strict morphisms
Necessary and sufficient conditions for the exactness (in the algebraic sense) of certain sequences of continuous group homomorphisms are established.

Localization sequences for logarithmic topological cyclic homology
John Rognes, Steffen Sagave, Christian Schlichtkrull
https://arxiv.org/abs/2506.08492 ht…

Localization sequences for logarithmic topological cyclic homology
We introduce the notion of an E_k-ring with prelogarithmic structure, define logarithmic topological Hochschild homology and logarithmic topological cyclic homology in this context, and establish localization sequences for these theories. Our approach is based on Thom R-algebras. It extends and strengthens our earlier work on the subject in several regards. Our examples include the fraction field of topological K-theory, the existence of which was suggested by calculations by Ausoni and the fir…

Replaced article(s) found for math.AC. https://arxiv.org/list/math.AC/new
[1/1]:
- The initial ideal of generic sequences and Fr\"{o}berg's Conjecture
Van Duc Trung

Effective criteria for entanglement witnesses in small dimensions
{\L}ukasz Grzelka, {\L}ukasz Skowronek, Karol \.Zyczkowski
https://arxiv.org/abs/2506.09298

Effective criteria for entanglement witnesses in small dimensions
We present an effective set of necessary and sufficient criteria for block-positivity of matrices of order $4$ over $\mathbb{C}$. The approach is based on Sturm sequences and quartic polynomial positivity conditions presented in recent literature. The procedure allows us to test whether a given $4\times 4$ complex matrix corresponds to an entanglement witness, and it is exact when the matrix coefficients belong to the rationals, extended by $\mathrm{i}$. The method can be generalized to $\mathc…

Towards an Analysis of Proofs in Arithmetic
Alexander Leitsch, Anela Loli\'c, Stella Mahler
https://arxiv.org/abs/2506.05837 https://

Towards an Analysis of Proofs in Arithmetic
Inductive proofs can be represented as proof schemata, i.e. as parameterized sequences of proofs defined in a primitive recursive way. Applications of proof schemata can be found in the area of automated proof analysis where the schemata admit (schematic) cut-elimination and the construction of Herbrand systems. This work focuses on the expressivity of proof schemata. We show that proof schemata can simulate primitive recursive arithmetic. The translation of proofs in arithmetic to proof schema…

Seq2Bind Webserver for Decoding Binding Hotspots directly from Sequences using Fine-Tuned Protein Language Models
Xiang Ma, Supantha Dey, Vaishnavey SR, Casey Zelinski, Qi Li, Ratul Chowdhury
https://arxiv.org/abs/2506.13830

Seq2Bind Webserver for Decoding Binding Hotspots directly from Sequences using Fine-Tuned Protein Language Models
Decoding protein-protein interactions (PPIs) at the residue level is crucial for understanding cellular mechanisms and developing targeted therapeutics. We present Seq2Bind Webserver, a computational framework that leverages fine-tuned protein language models (PLMs) to determine binding affinity between proteins and identify critical binding residues directly from sequences, eliminating the structural requirements that limit most affinity prediction tools. We fine-tuned four architectures inclu…

Methods for pitch analysis in contemporary popular music: multiple pitches from harmonic tones in Vitalic's music
Emmanuel Deruty, David Meredith, Maarten Grachten, Pascal Arbez-Nicolas, Andreas Hasselholt J{\o}rgensen, Oliver S{\o}nderm{\o}lle Hansen, Magnus Stensli, Christian N{\o}rk{\ae}r Petersen
https://arxiv.org/abs/25…

Methods for pitch analysis in contemporary popular music: multiple pitches from harmonic tones in Vitalic's music
Aims. This study suggests that the use of multiple perceived pitches arising from a single harmonic complex tone is an active and intentional feature of contemporary popular music. The phenomenon is illustrated through examples drawn from the work of electronic artist Vitalic and others. Methods. Two listening tests were conducted: (1) evaluation of the number of simultaneous pitches perceived from single harmonic tones, and (2) manual pitch transcription of sequences of harmonic tones. Relat…

The magic of tensor products of ultrafilters
Mauro Di Nasso
https://arxiv.org/abs/2506.14344 https://arxiv.org/pdf/2506.14344

The magic of tensor products of ultrafilters
Tensor products of ultrafilters have special combinatorial features closely related to Ramsey's Theorem, making them useful tools in applications. Here we first review their fundamental properties and isolate some new ones, including a characterisation of the limit superior and inferior of sequences as limits along tensor products, and an application to the Banach asymptotic density. We then prove a general result on the combinatorial structure of sets belonging to tensor products and, as a res…

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius
Yuanxiao Xi, Yubo Sun, Gennian Ge
https://arxiv.org/abs/2506.07817 https://

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius
Consider a length-$n$ sequence $\bm{x}$ over a $q$-ary alphabet. The \emph{fixed-length Levenshtein ball} $\mathcal{L}_t(\bm{x})$ of radius $t$ encompasses all length-$n$ $q$-ary sequences that can be derived from $\bm{x}$ by performing $t$ deletions followed by $t$ insertions. Analyzing the size and structure of these balls presents significant challenges in combinatorial coding theory. Recent studies have successfully characterized fixed-length Levenshtein balls in the context of a single del…

A Theoretical Study of (Hyper) Self-Attention through the Lens of Interactions: Representation, Training, Generalization
Muhammed Ustaomeroglu, Guannan Qu
https://arxiv.org/abs/2506.06179

A Theoretical Study of (Hyper) Self-Attention through the Lens of Interactions: Representation, Training, Generalization
Self-attention has emerged as a core component of modern neural architectures, yet its theoretical underpinnings remain elusive. In this paper, we study self-attention through the lens of interacting entities, ranging from agents in multi-agent reinforcement learning to alleles in genetic sequences, and show that a single layer linear self-attention can efficiently represent, learn, and generalize functions capturing pairwise interactions, including out-of-distribution scenarios. Our analysis r…

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

A synthetic approach to detecting $v_1$-periodic families
We provide a simple proof that the unit map from the sphere spectrum to the connective image-of-$J$ spectrum $\mathrm{j}$ is surjective on homotopy groups. This is achieved using a novel $t$-structure on the category of $E$-synthetic spectra and a specific construction of $\mathbf{F}_p$- and BP-synthetic lifts of $\mathrm{j}$. These synthetic lifts then easily produce modified Adams and Adams--Novikov spectral sequences for $\mathrm{j}$ which we use the prove the above detection statement, all …

Accelerating quantum adiabatic evolution with $\pi$-pulse sequences
Tonghao Xing, Jiang Zhang, Guilu Long
https://arxiv.org/abs/2506.09320 https://

Accelerating quantum adiabatic evolution with $π$-pulse sequences
In quantum information processing, the development of fast and robust control schemes remains a central challenge. Although quantum adiabatic evolution is inherently robust against control errors, it typically demands long evolution times. In this work, we propose to achieve rapid adiabatic evolution, in which nonadiabatic transitions induced by fast changes in the system Hamiltonian are mitigated by flipping the nonadiabatic transition matrix using $π$ pulses. This enables a faster realizatio…

Constructions of Optimal Frequency-Hopping Sequences with Controlled Minimum Gaps
Chen Li, Chunlei Li, Xiangyong Zeng, Dian Li
https://arxiv.org/abs/2506.00945

Constructions of Optimal Frequency-Hopping Sequences with Controlled Minimum Gaps
Frequency-hopping sequences (FHSs) with low Hamming correlation and wide gaps significantly contribute to the anti-interference performance in FH communication systems. This paper investigates FHSs with optimal Hamming correlation and controlled minimum gaps. We start with the discussion of the upper bounds on the minimum gaps of uniform FHSs and then propose a general construction of optimal uniform wide-gap FHSs with length 2l and 3l, which includes the work by Li et al. in IEEE Trans. Inf. T…

The bad and rough rotation is Poissonian
Manuel Hauke
https://arxiv.org/abs/2506.01736 https://arxiv.org/pdf/2506.01736

The bad and rough rotation is Poissonian
Motivated by the Berry-Tabor Conjecture and the seminal work of Rudnick-Sarnak, the fine-scale properties of sequences $(a_nα)_{n \in \mathbb{N}} \mod 1$ with $(a_n)_{n \in \mathbb{N}} \subseteq \mathbb{N} $ and $α$ irrational have been extensively studied in the last decades. In this article, we prove that for $(a_n)_{n \in \mathbb{N}}$ arising from the set of rough numbers with explicit roughness parameters and any badly approximable $α$, $(a_nα)_{n \in \mathbb{N}} \mod 1$ has Poissonian …

Preorders on maximal chains: hyperplane arrangements, Cambrian lattices, and maximal green sequences
Mikhail Gorsky, Nicholas J. Williams
https://arxiv.org/abs/2506.08858

Preorders on maximal chains: hyperplane arrangements, Cambrian lattices, and maximal green sequences
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the quotient, and that there is an induced order-preserving surjective map on the preordered sets of equivalence classes of maximal chains. Under a natural condition ensuring that the domain is a poset, the map is a contraction of preordered sets. We apply this …

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

The equivariant model structure on cartesian cubical sets
We develop a constructive model of homotopy type theory in a Quillen model category that classically presents the usual homotopy theory of spaces. Our model is based on presheaves over the cartesian cube category, a well-behaved Eilenberg-Zilber category. The key innovation is an additional equivariance condition in the specification of the cubical Kan fibrations, which can be described as the pullback of an interval-based class of uniform fibrations in the category of symmetric sequences of cu…

On 102-avoiding inversion sequences
JiSun Huh, Sangwook Kim, Seunghyun Seo, Heesung Shin
https://arxiv.org/abs/2506.02985 https://arx…

On 102-avoiding inversion sequences
In this article, we provide a bijection between the set of inversion sequences avoiding the pattern 102 and the set of 2-Schröder paths having neither peaks nor valleys and ending with a diagonal step. To achieve this, we introduce two intermediate objects, called UVD paths and labeled $F$-paths, and establish bijections among all four families. For each of these combinatorial objects, we define a natural statistic and enumerate the corresponding structures with respect to this statistic. In a…