Tootfinder

sp_high_school_new: High school dynamic contacts (2011-2012)
These datasets contain the temporal network of contacts between students in a high school in Marseilles, France. The first dataset gives the contacts of the students of three classes during 4 days in Dec. 2011, and the second corresponds to the contacts of the students of 5 classes during 7 days (from a Monday to the Tuesday of the following week) in Nov. 2012.
This network has 126 nodes and 28561 edges.
Tags: Soc…

Separable integer partition classes with restrictions on consecutive parts
Y. Q. Chen, Thomas Y. He, X. M. Huang, T. T. Zou
https://arxiv.org/abs/2508.11766 https://

Separable integer partition classes with restrictions on consecutive parts
Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are separable integer partition classes and then give the generating functions for such partitions.

Four classes of LCD codes from (*)-(L,P)-twisted generalized Reed-Solomon codes
Zhonghao Liang, Qunying Liao
https://arxiv.org/abs/2509.14878 https://arxiv…

Four classes of LCD codes from (*)-(L,P)-twisted generalized Reed-Solomon codes
It's well-known that maximum distance separable codes (in short, MDS) and linear complementary dual (in short, LCD) codes are very important in coding theory and practice. In 2023, Yue et al. [25] constructed three classes of LCD MDS codes via (*)-TGRS codes. Recently, Wu et al. [27] generalized the results given by Yue et al. and constructed several classes of LCD MDS codes. In this paper, we unify their constructions by defining the (*)-(L,P)-twisted generalized Reed-Solomon (in short, (*)-(L…

Empirical Evidences for the Effects of Feature Diversity in Open Set Recognition and Continual Learning
Jiawen Xu, Odej Kao
https://arxiv.org/abs/2508.13005 https://

Empirical Evidences for the Effects of Feature Diversity in Open Set Recognition and Continual Learning
Open set recognition (OSR) and continual learning are two critical challenges in machine learning, focusing respectively on detecting novel classes at inference time and updating models to incorporate the new classes. While many recent approaches have addressed these problems, particularly OSR, by heuristically promoting feature diversity, few studies have directly examined the role that feature diversity plays in tackling them. In this work, we provide empirical evidence that enhancing feature…

Arithmetics within the Linear Time Hierarchy
Chris Pollett
https://arxiv.org/abs/2508.13195 https://arxiv.org/pdf/2508.13195…

Arithmetics within the Linear Time Hierarchy
We identify fragments of the arithmetic $S_1$ that enjoy nice closure properties and have exact characterization of their definable multifunctions. To do this, in the language of $S_1$, $L_1$, starting from the formula classes, $Σ^{\mathsf b}_{i}$, which ignore sharply bounded quantifiers when determining quantifier alternations, we define new syntactic classes by counting bounded existential sharply bounded universal quantifiers blocks. Using these, we define arithmetics: $\breve{S}^{i}_{1}$,…

Conformal Prediction Meets Long-tail Classification
Shuqi Liu, Jianguo Huang, Luke Ong
https://arxiv.org/abs/2508.11345 https://arxiv.org/pdf/2508.11345

Conformal Prediction Meets Long-tail Classification
Conformal Prediction (CP) is a popular method for uncertainty quantification that converts a pretrained model's point prediction into a prediction set, with the set size reflecting the model's confidence. Although existing CP methods are guaranteed to achieve marginal coverage, they often exhibit imbalanced coverage across classes under long-tail label distributions, tending to over cover the head classes at the expense of under covering the remaining tail classes. This under coverage is partic…

@… I really appreciated how Java would make me jump through a few hoops to set a private variable in an object controlled by a dependency, but it would absolutely do it. It’s something I definitely miss when writing Rust.
In JavaScript, you can make objects via classes/prototypes, or by closing over local variables. The latter hides them because there’s no way to re…

Functorial equivalence classes of $2$-blocks of tame representation type
Robert Boltje, Serge Bouc, Deniz Y{\i}lmaz
https://arxiv.org/abs/2509.14682 https://

Functorial equivalence classes of $2$-blocks of tame representation type
For any block of a finite group over an algebraically closed field of characteristic $2$ which has dihedral, semidihedral, or generalized quaternion defect groups, we determine explicitly the decomposition of the associated diagonal $p$-permutation functor over an algebraically closed field $\mathbb{F}$ of characteristic $0$ into a direct sum of simple functors. As a consequence we see that two blocks with dihedral, semidihedral, or generalized quaternion defect groups are functorially equivale…

Subsolution theorem in weighted energy classes of $m$-subharmonic functions with given boundary value
Nguyen Van Phu
https://arxiv.org/abs/2508.11821 https://

Subsolution theorem in weighted energy classes of $m$-subharmonic functions with given boundary value
In this paper, we concern with the existence of solutions of the weighted complex $m$-Hessian equation $-χ(u)H_{m}(u)=μ$ in the class $\mathcal{E}_{m,χ}(f,Ω)$ if there exists subsolution in this class, where the given boundary value $f\in\mathcal{E}_m(Ω)\cap MSH_m(\Om).$ This is a generalization of the result in the paper \cite{PDtaiwan} where we proved that the subsolution theorem is true in the class $\mathcal{E}_{m,χ}(f,Ω)$ in the case when the given boundary value $f\in\mathcal{N}_m(…

A look at Neon Coat, an app that offers models and influencers free restaurant meals, fitness classes, and other experiences in exchange for social media posts (Lane Florsheim/Wall Street Journal)
https://www.wsj.com/style/neon-coat-app-in

General complete intersection homomorphisms
Samuel Alvite, Javier Majadas
https://arxiv.org/abs/2508.12967 https://arxiv.org/pdf/2508.12967

General complete intersection homomorphisms
We study three classes of local homomorphisms and their behavior with respect to the ascent and descent of the \emph{complete intersection} property. Crucially, they fall in between the already studied classes of complete intersection and quasi-complete intersection homomorphisms, while also repairing some of the issues these presented.

When you start to see that capitalism is nothing but systemic exploitation and domination, and that Marxism-Leninism only reproduces the same state capitalism under another name through authoritarian state socialism, you then realize that leftist parties don’t actually bring about any fundamental change, because they to keep power rigidly centralized, to preserve existing hierarchies, and to maintain the dominance of the ruling classes.
If you want a genuine alternative, one built on w…

It's 2025 and I still can't forward declare nested classes.

Classes start next week, and as usual, I am teaching Linux Systems Administration. Any pearls of wisdom or particular topics you think the next gen of admins needs to know? #linux #unix #sysadmin…

Diagonalization of the Toda flow on conjugacy classes of matrices with simple spectrum
David Mart\'inez Torres, Carlos Tomei
https://arxiv.org/abs/2509.13452 https://…

Diagonalization of the Toda flow on conjugacy classes of matrices with simple spectrum
We construct coordinates on conjugacy classes of traceless complex matrices with simple spectrum that diagonalize the non-periodic Toda vector field. By this we mean that the coordinates, defined on an open and dense neighborhood of any diagonal matrix in the conjugacy class, decouple the Toda vector field into a sum of multiples of the Euler and rotational vector field in $\mathbb{C}$. Using Lie theoretic methods, we extend this construction from $\mathfrak{sl}_\mathbb{C}$ to arbitrary complex…

Hierarchical knowledge guided fault intensity diagnosis of complex industrial systems
Yu Sha, Shuiping Gou, Bo Liu, Johannes Faber, Ningtao Liu, Stefan Schramm, Horst Stoecker, Thomas Steckenreiter, Domagoj Vnucec, Nadine Wetzstein, Andreas Widl, Kai Zhou
https://arxiv.org/abs/2508.12375

Hierarchical knowledge guided fault intensity diagnosis of complex industrial systems
Fault intensity diagnosis (FID) plays a pivotal role in monitoring and maintaining mechanical devices within complex industrial systems. As current FID methods are based on chain of thought without considering dependencies among target classes. To capture and explore dependencies, we propose a hierarchical knowledge guided fault intensity diagnosis framework (HKG) inspired by the tree of thought, which is amenable to any representation learning methods. The HKG uses graph convolutional networks…

On the dimension distortion under fractionally smooth mappings
Ryan Alvarado, Efstathios Konstantinos Chrontsios Garitsis
https://arxiv.org/abs/2509.15149 https://

On the dimension distortion under fractionally smooth mappings
We determine the extent to which continuous mappings in various Sobolev classes distort various dimensions, including the Hausdorff, the upper Minkowski (box-counting), and the upper intermediate dimensions. The intermediate and Minkowski dimension distortion results we obtain are novel already for various classes of fractionally smooth mappings between Euclidean spaces, extending the results of Hencl-Honzík (2015) and Huynh (2022) to these dimensions. In addition, our work also generalizes th…

On matrix weighted Bourgain-Morrey Triebel-Lizorkin spaces
Tengfei Bai, Pengfei Guo, Jingshi Xu
https://arxiv.org/abs/2508.11981 https://arxiv.org/pdf/2508…

On matrix weighted Bourgain-Morrey Triebel-Lizorkin spaces
We introduce the homogeneous (inhomogeneous) matrix weighted Bourgain-Morrey Triebel-Lizorkin spaces and obtain equivalent norms of these spaces. We also obtain their characterizations by Peetre type maximal functions, Lusin-area function, Littlewood-Paley $g_λ^{*}$-function, approximation, wavelet and atom. As an application, we obtain boundedness of pseudo-differential operators with symbols in the Hörmander classes and Hölder-Zygmund classes on inhomogeneous matrix weighted Bourgain-Morre…

Circuit-based chatacterization of finite-temperature quantum phases and self-correcting quantum memory
Ruochen Ma, Vedika Khemani, Shengqi Sang
https://arxiv.org/abs/2509.15204 …

Circuit-based chatacterization of finite-temperature quantum phases and self-correcting quantum memory
Quantum phases at zero temperature can be characterized as equivalence classes under local unitary transformations: two ground states within a gapped phase can be transformed into each other via a local unitary circuit. We generalize this circuit-based characterization of phases to systems at finite-temperature thermal equilibrium described by Gibbs states. We construct a channel circuit that approximately transforms one Gibbs state into another provided the two are connected by a path in param…

jung: JUNG and javax class dependencies (2012)
A network of software class dependency within the JUNG 2.0.1 and javax 1.6.0.7 library namespaces edu.uci.ics.jung and java/javax. Nodes represent classes and a directed edge indicates a dependency of one class on another.
This network has 6120 nodes and 138706 edges.
Tags: Technological, Software, Unweighted

On Naturally and Weakly Mal'tsev Categories
Nelson Martins-Ferreira
https://arxiv.org/abs/2508.13315 https://arxiv.org/pdf/2508.13315

On Naturally and Weakly Mal'tsev Categories
We explore a hierarchy of notions in categorical algebra: Mal'tsev categories (where every reflexive relation is symmetric); naturally Mal'tsev categories (where every reflexive graph underlies a unique internal groupoid structure, also known as the Lawvere Condition); and weakly Mal'tsev categories (defined via the joint epimorphicity of local product injections). While varying in generality and historical prominence, these notions can be uniformly described using suitable classes of spans and…

Minmax Exclusivity Classes for Power-Type Loss Functions
Stanis{\l}aw M. S. Halkiewicz
https://arxiv.org/abs/2507.12447 https://arxiv…

Minmax Exclusivity Classes for Power-Type Loss Functions
In statistical decision theory, the choice of loss function fundamentally shapes which estimators qualify as optimal. This paper introduces and develops the general concept of exclusivity classes of loss functions: subsets of loss functions such that no estimator can be optimal (according to a specified notion) for losses lying in different classes. We focus on the case of minmax optimality and define minmax exclusivity classes, demonstrating that the classical family of power-type loss functio…

On a long exact sequence of groups of equivalence classes of 2d $\mathcal{N}{=}(0,1)$ SQFTs
Yuji Tachikawa
https://arxiv.org/abs/2509.12481 https://arxiv.o…

On a long exact sequence of groups of equivalence classes of 2d $\mathcal{N}{=}(0,1)$ SQFTs
Strongly motivated by a mathematical result by Lin and Yamashita (arXiv:2412.02298), we describe a long exact sequence formed by groups of equivalence classes of two-dimensional $\mathcal{N}{=}(0,1)$ supersymmetric quantum field theories (SQFTs) with and without $SU(2)$ symmetry. As an application, we study chiral fermions in heterotic compactifications with $SU(2)$ symmetry of level one to four dimensions, and show that each even-dimensional irreducible representation of $SU(2)$ appears even t…

Motivic classes of stacks in finite characteristic and applications to stacks of Higgs bundles
Ruoxi Li
https://arxiv.org/abs/2509.09861 https://arxiv.org/…

Motivic classes of stacks in finite characteristic and applications to stacks of Higgs bundles
We define a ring of motivic classes of stacks suitable for symmetric powers in finite characteristic. Let $X$ be a smooth projective curve over a field of arbitrary characteristic. We calculate the motivic classes of the moduli stacks of semistable Higgs bundles on $X$. This recovers results of Fedorov, A. Soibelman and Y. Soibelman in characteristic zero, as well as those of Mozgovoy and Schiffmann for finite fields. We also obtain a simpler formula for the motivic classes of Higgs bundles in …

Filling in the semantics for intuitionistic conditional logic
Brendan Dufty, Jim de Groot
https://arxiv.org/abs/2508.11972 https://arxiv.org/pdf/2508.11972…

Filling in the semantics for intuitionistic conditional logic
We prove completeness results for a wide variety of intuitionistic conditional logics. We do so by first using a duality to transfer algebraic completeness to completeness with respect to conditional Esakia spaces, a topologised version of a conditional Kripke frame. We then use so-called fill-ins to obtain completeness results with respect to classes conditional of Kripke frames. The fill-ins close the gap between conditional Esakia spaces, which do not have a canonical underlying frame, and c…

$D_N$-Orthogonal Freedom in the Canonical Seesaw: Flavor Invariants and Physical Non-Equivalence of F-Classes
Jianlong Lu
https://arxiv.org/abs/2509.13363 https://

$D_N$-Orthogonal Freedom in the Canonical Seesaw: Flavor Invariants and Physical Non-Equivalence of F-Classes
This work is a companion to our previous papers showing that the data-favored $μ$-$τ$ modulus relation $|U_{μi}|=|U_{τi}|$ does not imply the ''minimal'' condition $R=PR^*$ and exhibiting six right-multiplications $F$ of the heavy-light block $R$ with $(RF)D_N(RF)^{T}=R D_N R^{T}$, leaving $m_ν$ unchanged. Here we give a complete classification and basis-invariant diagnostics that distinguish inequivalent completions with the same $m_ν$. We prove all $m_ν$-preserving …

Extropy-Based Generalized Divergence and Similarity Ratios: Theory and Applications
Saranya P., Sunoj S. M
https://arxiv.org/abs/2508.13696 https://arxiv.o…

Extropy-Based Generalized Divergence and Similarity Ratios: Theory and Applications
In this article, we propose two classes of relative information measures based on extropy, viz., the generalized extropy similarity ratio (GESR) and generalized extropy divergence ratio (GEDR), that measure the similarity and discrepancy between two probability distributions, respectively. Definitions of GESR and GEDR are proposed along with their fundamental axioms, properties, and some measures satisfying those axioms are also introduced. The relationship of GESR with the popular cosine simil…

New theoretical predictions on Type II Cepheids: towards a self consistent Pop. II distance scale
Marcella Marconi, Roberto Molinaro, Vincenzo Ripepi, Giulia De Somma, Teresa Sicignano, Mami Deka, Marcella Di Criscienzo, Emanuela Luongo, Ilaria Musella, Erasmo Trentin
https://arxiv.org/abs/2509.13552…

New theoretical predictions on Type II Cepheids: towards a self consistent Pop. II distance scale
Type II Cepheids are pulsating stars that can be used as standard candles for old stellar populations due to their characteristic Period-Luminosity and Period-Luminosity-Colour relations. They are traditionally divided in 3 sub-classes, namely BL Her, W Vir and RV Tauri. In this paper we focus on the first two sub-classes, to provide a new theoretical scenario and develop tools and relations to be adopted in distance scale and old stellar populations studies. We have built new nonlinear convect…

On Finite- and Fixed-Time Stabilization of Abstract Nonlinear Systems with Well-Posedness Guarantees
Kamal Fenza, Moussa Labbadi, Mohamed Ouzahra
https://arxiv.org/abs/2509.14376

On Finite- and Fixed-Time Stabilization of Abstract Nonlinear Systems with Well-Posedness Guarantees
This paper addresses the problem of stabilization for infinite-dimensional systems. In particular, we design nonlinear stabilizers for both linear and nonlinear abstract systems. We focus on two classes of systems: the first class comprises linear abstract systems subject to matched perturbations, while the second class encompasses fully nonlinear abstract systems. Our main objective is to synthesize state-feedback controllers that guarantee finite- or fixed-time stability of the closed-loop sy…

Compact stars in Einstein-scalar-Gauss-Bonnet gravity: regular and divergent scalar field configurations
Roberto D. Alba Q., Javier Chagoya, Armando A. Roque
https://arxiv.org/abs/2508.13273

Compact stars in Einstein-scalar-Gauss-Bonnet gravity: regular and divergent scalar field configurations
We investigate static, spherically symmetric solutions in Einstein-scalar-Gauss-Bonnet gravity non-minimally coupled to a massless real scalar field, both in vacuum and in the presence of fermionic matter. Focusing on a specific quadratic scalar-Gauss-Bonnet coupling, we identify two distinct classes of compact objects: one with a regular scalar field at the origin -- connected to general relativity in an appropriate limit -- and another {one} with a divergent scalar field at the origin but a r…

Replaced article(s) found for cs.CG. https://arxiv.org/list/cs.CG/new
[1/1]:
- Minimum Selective Subset on Some Graph Classes
Bubai Manna
https://

The ${\rm SL}(2,\mathbb{C})$-character variety of $8_{18}$
Haimiao Chen
https://arxiv.org/abs/2508.12203 https://arxiv.org/pdf/2508.12203

The ${\rm SL}(2,\mathbb{C})$-character variety of $8_{18}$
The knot $8_{18}$ is the first non-arborescent hyperbolic knot. In 2020, Paoluzzi and Porti found its ${\rm SL}(2,\mathbb{C})$-character variety with the aid of a computer, but many details were omitted. In this paper, we determine the character variety by a software-free procedure, which is easy to follow and enlightening. Along the way, we develop an efficient method for working with simultaneous conjugacy classes of four elements of ${\rm SL}(2,\mathbb{C})$.

I'm not sure what Exodus is as it's a Book, a Desktop D&D variant and all marketing a video game with a Founder's deadline of the end of this month,
I've read the novel which was interesting and entertaining but I don't think the characters have that much to do with the video game, though the classes of characters do.
Anyhow I can't recommend the game as it doesn't seem to be released yet but here's a link which gets you the Founder's site.…

The Varieties of Schelling Model Experience
Marlyn Boke, Timothy Sorochkin, Jesse Anttila-Hughes, Alan O. Jamison
https://arxiv.org/abs/2509.14462 https://…

The Varieties of Schelling Model Experience
The Schelling model is a prototype for agent-based modeling in social systems. A comprehensive analysis of Schelling model rule variants is achieved by classification of the space of macroscopic outcomes via phase diagrams. Among 54 rule variants, only 3 phase diagram classes are found, characterized by the number of phase transitions. This classification scheme is found to be robust to the use of sociological and percolation-inspired measures of segregation. The statistical and dynamic drivers…

sp_high_school_new: High school dynamic contacts (2011-2012)
These datasets contain the temporal network of contacts between students in a high school in Marseilles, France. The first dataset gives the contacts of the students of three classes during 4 days in Dec. 2011, and the second corresponds to the contacts of the students of 5 classes during 7 days (from a Monday to the Tuesday of the following week) in Nov. 2012.
This network has 180 nodes and 45047 edges.
Tags: Soc…

Analyzing Finnish Inflectional Classes through Discriminative Lexicon and Deep Learning Models
Alexandre Nikolaev, Yu-Ying Chuang, R. Harald Baayen
https://arxiv.org/abs/2509.04813

Analyzing Finnish Inflectional Classes through Discriminative Lexicon and Deep Learning Models
Descriptions of complex nominal or verbal systems make use of inflectional classes. Inflectional classes bring together nouns which have similar stem changes and use similar exponents in their paradigms. Although inflectional classes can be very useful for language teaching as well as for setting up finite state morphological systems, it is unclear whether inflectional classes are cognitively real, in the sense that native speakers would need to discover these classes in order to learn how to p…

On the central limit question for strictly stationary, reversible Markov chains
Richard C. Bradley
https://arxiv.org/abs/2508.12951 https://arxiv.org/pdf/2…

On the central limit question for strictly stationary, reversible Markov chains
This paper will provide several classes of strictly stationary, countable-state, irreducible, aperiodic Markov chains that are reversible and have finite second moments, such that the central limit theorem fails to hold. The main purpose is to examine the extent to which, for the development of central limit theory for strictly stationary Markov chains (and functions of them) under the strong mixing and absolute regularity conditions, the property of reversibility (if it holds) can provide extr…

Three Classes of Twisted Gabidulin Codes with Different Twists
Ran Li, Fang-Wei Fu, Weijun Fang
https://arxiv.org/abs/2509.12693 https://arxiv.org/pdf/2509…

Three Classes of Twisted Gabidulin Codes with Different Twists
Twisted Gabidulin codes are an extension of Gabidulin codes and have recently attracted great attention. In this paper, we study three classes of twisted Gabidulin codes with different twists. Moreover, we establish necessary and sufficient conditions for them to be maximum rank distance (MRD) codes, determine the conditions under which they are not MRD codes, and construct several classes of MRD codes via twisted Gabidulin codes. In addition, considering these codes in the Hamming metric, we p…

Crosslisted article(s) found for math.CV. https://arxiv.org/list/math.CV/new
[1/1]:
- Subsolution theorem in weighted energy classes of $m$-subharmonic functions with given boundary v...
Nguyen Van Phu

RICO: Two Realistic Benchmarks and an In-Depth Analysis for Incremental Learning in Object Detection
Matthias Neuwirth-Trapp, Maarten Bieshaar, Danda Pani Paudel, Luc Van Gool
https://arxiv.org/abs/2508.13878

RICO: Two Realistic Benchmarks and an In-Depth Analysis for Incremental Learning in Object Detection
Incremental Learning (IL) trains models sequentially on new data without full retraining, offering privacy, efficiency, and scalability. IL must balance adaptability to new data with retention of old knowledge. However, evaluations often rely on synthetic, simplified benchmarks, obscuring real-world IL performance. To address this, we introduce two Realistic Incremental Object Detection Benchmarks (RICO): Domain RICO (D-RICO) features domain shifts with a fixed class set, and Expanding-Classes …

Universal Thermodynamics of Dunkl-Deformed Bose Gases: From Power-Law Traps to Physical Bounds
M. Medani, M. Benarous, A. Hocine, F. Merabtine
https://arxiv.org/abs/2508.12124 h…

Universal Thermodynamics of Dunkl-Deformed Bose Gases: From Power-Law Traps to Physical Bounds
We study an ideal Bose gas confined by a $D$-dimensional power-law potential within the framework of the Dunkl formalism. By analyzing the combined effects of spatial dimensionality and trap geometry, we derive universal expressions for the thermodynamic quantities, which depend solely on a single parameter. This reduction reveals the existence of universality classes that apply to any power-law potential, regardless of its specific form.

Are Prompts All You Need? Evaluating Prompt-Based Large Language Models (LLM)s for Software Requirements Classification
Manal Binkhonain, Reem Alfayaz
https://arxiv.org/abs/2509.13868

Are Prompts All You Need? Evaluating Prompt-Based Large Language Models (LLM)s for Software Requirements Classification
Requirements classification assigns natural language requirements to predefined classes, such as functional and non functional. Accurate classification reduces risk and improves software quality. Most existing models rely on supervised learning, which needs large labeled data that are costly, slow to create, and domain dependent; they also generalize poorly and often require retraining for each task. This study tests whether prompt based large language models can reduce data needs. We benchmark…

The cohomological Kudla conjecture for unitary Shimura varieties
Fran\c{c}ois Greer, Salim Tayou
https://arxiv.org/abs/2507.13299 https://

The cohomological Kudla conjecture for unitary Shimura varieties
We construct natural extensions of the Kudla--Millson generating series of cohomology classes of special cycles in compactified unitary Shimura varieties of signature $(n+1,1)$ and prove that they are holomorphic Hermitian modular forms. This proves the cohomological version of a conjecture of Kudla and Bruinier--Rosu--Zemel, in all codimensions up to the middle. We also develop the theory of Hermitian quasi-modular forms, with a particular focus on polynomial weighted theta functions, and prov…

Report on $\mathbb{E}_\infty$-descendability
Benjamin Antieau, Germ\'an Stefanich
https://arxiv.org/abs/2508.13089 https://arxiv.org/pdf/2508.13089

Report on $\mathbb{E}_\infty$-descendability
We introduce the notion of $\mathbb{E}_\infty$-descendability as well as a derived variant. We prove that several classes of descendable maps of commutative rings are $\mathbb{E}_\infty$-descendable. As an application, we prove a variant of Tannaka duality.

Structured Information Loss in Network Embeddings
Gabriel Chuang, Augustin Chaintreau
https://arxiv.org/abs/2509.12396 https://arxiv.org/pdf/2509.12396

Structured Information Loss in Network Embeddings
We analyze a simple algorithm for network embedding, explicitly characterizing conditions under which the learned representation encodes the graph's generative model fully, partially, or not at all. In cases where the embedding loses some information (i.e., is not invertible), we describe the equivalence classes of graphons that map to the same embedding, finding that these classes preserve community structure but lose substantial density information. Finally, we show implications for community…

AI as a teaching tool and learning partner
Steven Watterson, Sarah Atkinson, Elaine Murray, Andrew McDowell
https://arxiv.org/abs/2509.13899 https://arxiv.…

AI as a teaching tool and learning partner
The arrival of AI tools and in particular Large Language Models (LLMs) has had a transformative impact on teaching and learning and institutes are still trying to determine how to integrate LLMs into education in constructive ways. Here, we explore the adoption of LLM-based tools into two teaching programmes, one undergraduate and one postgraduate. We provided to our classes (1) a LLM-powered chatbot that had access to course materials by RAG and (2) AI-generated audio-only podcasts for each we…

Holographic Timelike Entanglement Across Dimensions
Carlos Nunez, Dibakar Roychowdhury
https://arxiv.org/abs/2508.13266 https://arxiv.org/pdf/2508.13266

Holographic Timelike Entanglement Across Dimensions
We develop a holographic framework for computing timelike entanglement entropy (tEE) in quantum field theories, extending the Ryu-Takayanagi prescription into Lorentzian settings. Using three broad classes of supergravity backgrounds, we derive both exact and approximate tEE expressions for slab, spherical, and hyperbolic regions, and relate them to the central charges of the dual conformal field theories. The method is applied to infinite families of supersymmetric linear quivers in dimensions…

Orders of commutators and Products of conjugacy classes in finite groups
Hung P. Tong-Viet
https://arxiv.org/abs/2507.10882 https://a…

Orders of commutators and Products of conjugacy classes in finite groups
Let $G$ be a finite group, let $x\in G$ and let $p$ be a prime. We prove that the commutator $[x,g]$ is a $p$-element for every $g\in G$ if and only if $x$ is central modulo $O_p(G),$ where $O_p(G)$ denotes the largest normal $p$-subgroup of $G$. This result simultaneously generalizes some variants of both the Baer-Suzuki theorem and Glauberman's $Z_p^*$-theorem. Furthermore, we show that if $x\in G$ is a $p$-element and there exists an integer $m\ge 1$ such that for all $g\in G$, either $[x,g]…

Ideally Connected Cographs and Chordal Graphs
Richter Jordaan
https://arxiv.org/abs/2509.14393 https://arxiv.org/pdf/2509.14393

Ideally Connected Cographs and Chordal Graphs
For distinct vertices $u,v$ in a graph $G$, let $κ_G(u,v)$ denote the maximum number of internally disjoint $u$-$v$ paths in $G$. Then, $κ_G(u,v) \leq \min\{ \mbox{deg}_G(u), \mbox{deg}_G(v) \}$. If equality is attained for every pair of vertices in $G$, then $G$ is called ideally connected. In this paper, we characterize the ideally connected graphs in two well-known graph classes: the cographs and the chordal graphs. We show that the ideally connected cographs are precisely the $2K_2$-free …

@… I think it’s partially a question of motivation for me. Everyone around me speaks English, so learning German is… low on the list.
I hope to take more classes, and learn more, and eventually become proficient. But I think fluency, or thinking in German, is probably never going to happen for me.
I’m OK with that, most days. 🙃

Low sets for counting functions
Yaroslav Ivanashev
https://arxiv.org/abs/2507.04110 https://arxiv.org/pdf/2507.04110

Low sets for counting functions
In this paper, we characterize the classes of languages and functions that are low for counting function classes. The classes #P and GapP have their low classes exactly characterized: Low(#P) = UP $\cap$ coUP and Low(GapP) = SPP. We prove that Low(TotP) = P, Low(SpanP) = NP $\cap$ coNP, and give characterizations of low function classes for #P, GapP, TotP, and SpanP. We establish the relations between NPSVt, UPSVt, and the counting function classes. For each of the inclusions between these clas…

Statistical Inference for Subgraph Frequencies of Exchangeable Hyperedge Models
Ayoushman Bhattacharya, Nilanjan Chakraborty, Robert Lunde
https://arxiv.org/abs/2508.13258 https…

Statistical Inference for Subgraph Frequencies of Exchangeable Hyperedge Models
In statistical network analysis, models for binary adjacency matrices satisfying vertex exchangeability are commonly used. However, such models may fail to capture key features of the data-generating process when interactions, rather than nodes, are fundamental units. We study statistical inference for subgraph counts under an exchangeable hyperedge model. We introduce several classes of subgraph statistics for hypergraphs and develop inferential tools for subgraph frequencies that account for …

Sampling tree-weighted partitions without sampling trees
Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz
https://arxiv.org/abs/2508.11130 https://arxiv.org…

Sampling tree-weighted partitions without sampling trees
This paper gives a new algorithm for sampling tree-weighted partitions of a large class of planar graphs. Formally, the tree-weighted distribution on $k$-partitions of a graph weights $k$-partitions proportional to the product of the number of spanning trees of each partition class. Recent work on problems in computational redistricting analysis has driven special interest in the conditional distribution where all partition classes have the same size (balanced partitions). One class of Markov c…

Torsion in the Braid Monodromy of Elliptic Fibrations
Faye Jackson
https://arxiv.org/abs/2509.14454 https://arxiv.org/pdf/2509.14454

Torsion in the Braid Monodromy of Elliptic Fibrations
Given an elliptic fibration $π: M \to S^2$ with singular locus $Δ\subseteq S^2$, let $\operatorname{Br}(π) < \operatorname{Mod}(S^2,Δ)$ be the subgroup of the spherical braid group consisting of those braids that lift to a fiber-preserving diffeomorphism of $M$. We classify the order $n = |Δ|$ elements of $\operatorname{Br}(π)$ up to conjugacy in $\operatorname{Br}(π)$. To do so, we relate these conjugacy classes to special points on the $\operatorname{SL}_2$-character variety …

A comparison of the regularity of certain classes of monomial ideals and their integral closures
Omkar Javadekar
https://arxiv.org/abs/2507.12178 https://

A comparison of the regularity of certain classes of monomial ideals and their integral closures
Let $S = \mathsf{k}[x_1, \ldots, x_n]$, $I$ be an ideal of $S$, and $\bar{I}$ denote its integral closure. A conjecture of Küronya and Pintye states that for any homogeneous ideal $I$ of $S$, the inequality $\operatorname{reg}(\bar{I}) \leq \operatorname{reg}(I)$ holds, where $\operatorname{reg}(\_)$ denotes the Castelnuovo-Mumford regularity. In this article, we prove the conjecture for certain classes of monomial ideals.

Replaced article(s) found for cs.DM. https://arxiv.org/list/cs.DM/new
[1/1]:
- On Approximate MMS Allocations on Restricted Graph Classes
V\'aclav Bla\v{z}ej, Micha{\l} D\k{e}bski, Zbigniew Lonc, Marta Piecyk, Pawe{\l} Rz\k{a}\.zewski

Starting my AI and higher education seminar https://bryanalexander.org/classes-and-teaching/starting-my-ai-and-higher-education-seminar/
I might follow along with some of the readings and open lectures in this course by

Estimates for pseudo-differential operators on the torus revisited. III
Duv\'an Cardona, Manuel Mart\'inez
https://arxiv.org/abs/2508.13338 https://

Estimates for pseudo-differential operators on the torus revisited. III
This paper finishes the goal of the authors started in two previous manuscripts dedicated to revisiting the continuity properties of toroidal pseudo-differential operators with symbols in the Hörmander classes. Here we prove pointwise estimates in terms of the Fefferman-Stein sharp maximal function and of the Hardy-Littlewood maximal function. Combining these estimates with the properties of Muckenhoupt's weight class $A_p$ we obtain boundedness theorems for pseudo-differential operators betwe…

The Deligne-Simpson Problem
William Crawley-Boevey
https://arxiv.org/abs/2509.11998 https://arxiv.org/pdf/2509.11998

The Deligne-Simpson Problem
Given k similarity classes of invertible matrices, the Deligne-Simpson problem asks to determine whether or not one can find matrices in these classes whose product is the identity and with no common invariant subspace. The author conjectured an answer in terms of an associated root system, and proved one implication in joint work with Shaw. In this paper we prove the other implication, thus confirming the conjecture.

Cactus flower spaces and monodromy of Bethe vectors
Joel Kamnitzer, Leonid Rybnikov
https://arxiv.org/abs/2507.12829 https://arxiv.or…

Cactus flower spaces and monodromy of Bethe vectors
We continue the study of cactus flower moduli spaces $\overline{F}_n$ and Gaudin models started in arXiv:2308.06880, arXiv:2407.06424. We show that isomorphism classes of operadic coverings of the real form $\overline{F}_n(\mathbb{R})$ are naturally one-to-one with equivalence classes of concrete coboundary monoidal categories (i.e. coboundary monoidal categories that admit a faithful monoidal functor to sets) with certain semisimplicity and finiteness conditions. Following the strategy of arXi…

I get immensely distressed when I see students building a little nest for themselves in just one proverbial corner of campus. Perhaps my most common advising conversation is “You do not need to take 3 classes at once in this department. What about <<category you’ve never studied>>?”
(Macalester is a liberal arts college, so our curriculum is carefully calibrated such that there is •room• for students to touch many disciplines. That’s the point. Yes, there are other kinds of schools where do you have to take almost all your classes in one dept. I am leery of that.)

Solvability Issues of Two Classes of Quasilinear and Nonlinear Integral Equations with a Sum-Difference Kernel on the Half-Line
A. Kh. Khachatryan, Kh. A. Khachatryan, H. S. Petrosyan
https://arxiv.org/abs/2507.12231

Solvability Issues of Two Classes of Quasilinear and Nonlinear Integral Equations with a Sum-Difference Kernel on the Half-Line
This paper investigates two classes of quasilinear and essentially nonlinear integral equations with a sum-difference kernel on the half-line. Such equations arise in various areas of physics, including the theory of radiative transfer in spectral lines, the dynamic theory of p-adic strings, and the kinetic theory of gases within the framework of the modified Bhatnagar-Gross-Krook (BGK) model. Under specific conditions on the kernel and the nonlinear terms, we establish constructive existence t…

Persistent Fluctuating Superconductivity and Planckian Dissipation in Fe(Te,Se)
Jonathan Stensberg, Pok Man Tam, Xiaoyu Yuan, Xiong Yao, Heshan Yu, Chih-Yu Lee, An-Hsi Chen, Philip J. D. Crowley, Matthew Brahlek, Ichiro Takeuchi, Seongshik Oh, Joseph Orenstein, Charles Kane, Liang Wu
https://arxiv.org/abs/2509.13969

Persistent Fluctuating Superconductivity and Planckian Dissipation in Fe(Te,Se)
Increasingly intricate phase diagrams in new classes of superconductors host fascinating interactions between superconductivity, diverse quantum phases, and quantum critical dynamics. The native superfluids, however, often exhibit much lower density and much greater inhomogeneity than conventional superfluids. This may render the superconductivity susceptible to fluctuations that are ordinarily assumed to be frozen out far below the superconducting transition temperature $T_c$, calling into que…

An analogue of Koebe's theorem in metric spaces
Evgeny Sevost'yanov, Valery Targonskii, Denys Romash, Nataliya Ilkevych
https://arxiv.org/abs/2509.15093 https://

An analogue of Koebe's theorem in metric spaces
This paper is devoted to the study of mappings in metric spaces. We investigate mappings satisfying inverse moduli inequalities. We show that under certain conditions on these mappings, their definition domains and the spaces in which they act, the image of a ball under the mappings contains a ball of fixed radius, which corresponds to the statement of the Koebe theorem on one quarter. As consequences, we obtain corresponding results in the Sobolev and Orlicz-Sobolev classes defined in a certai…

Characterizing NC1 with Typed Monoids
Anuj Dawar, Aidan T. Evans
https://arxiv.org/abs/2508.11019 https://arxiv.org/pdf/2508.11019

Characterizing NC1 with Typed Monoids
Krebs et al. (2007) gave a characterization of the complexity class TC0 as the class of languages recognized by a certain class of typed monoids. The notion of typed monoid was introduced to extend methods of algebraic automata theory to infinite monoids and hence characterize classes beyond the regular languages. We advance this line of work beyond TC0 by giving a characterization of NC1. This is obtained by first showing that NC1 can be defined as the languages expressible in an extension of …

Geometry of quantum states and chaos-integrability transition
Ankit Gill, Keun-Young Kim, Kunal Pal, Kuntal Pal
https://arxiv.org/abs/2507.13067 https://…

Geometry of quantum states and chaos-integrability transition
We consider the geometry of quantum states associated with classes of random matrix Hamiltonians, in particular ensembles that show integrability to chaotic transition in terms of the nearest neighbour energy level spacing distribution. In the case that the total Hamiltonian contains a single parameter, the distance between two states is captured by the fidelity susceptibility, whereas, when the total Hamiltonian contains multiple parameters, this distance is given by the quantum metric tensor.…

jdk: Java SE Dev Kit dependencies (1.6.0.7)
A network of class dependencies within the JDK (Java SE Development Kit) 1.6.0.7 framework. Nodes represent classes and a directed edge indicates a dependency of one class on another.
This network has 6434 nodes and 150985 edges.
Tags: Technological, Software, Unweighted, Multigraph
https://

Op-Fed: Opinion, Stance, and Monetary Policy Annotations on FOMC Transcripts Using Active Learning
Alisa Kanganis, Katherine A. Keith
https://arxiv.org/abs/2509.13539 https://…

Op-Fed: Opinion, Stance, and Monetary Policy Annotations on FOMC Transcripts Using Active Learning
The U.S. Federal Open Market Committee (FOMC) regularly discusses and sets monetary policy, affecting the borrowing and spending decisions of millions of people. In this work, we release Op-Fed, a dataset of 1044 human-annotated sentences and their contexts from FOMC transcripts. We faced two major technical challenges in dataset creation: imbalanced classes -- we estimate fewer than 8% of sentences express a non-neutral stance towards monetary policy -- and inter-sentence dependence -- 65% of …

Number Fields With Large P\'olya Groups
Amir Akbary, Abbas Maarefparvar
https://arxiv.org/abs/2508.11125 https://arxiv.org/pdf/2508.11125

Number Fields With Large Pólya Groups
The Pólya group ${\rm Po}(K)$ of a number field $K$ is the subgroup of the ideal class group ${\rm Cl}(K)$ of $K$ generated by the classes of all the products of the prime ideals of $K$ with the same norm. Motivated by the classical "one class in each genus problem", we prove general finiteness theorems for the number fields $K$ with a fixed Pólya index $\left[{\rm Cl}(K):{\rm Po}(K)\right]$ in the families of Galois number fields, solvable CM-fields, and real quadratic fields of extended R-D…

Finite groups with few conjugate classes of minimal non-abelian subgroups
Haipeng Qu, Junqiang Zhang
https://arxiv.org/abs/2508.09706 https://arxiv.org/pdf…

Finite groups with few conjugate classes of minimal non-abelian subgroups
Let $G$ be a finite non-abelian group and $κ_1(G)$ the number of conjugate classes of minimal non-abelian subgroups of $G$. The structure of $G$ with $κ_1(G)=1$ is determined. In the case of $G$ being the $p$-groups, the structure of $G$ with $κ_1(G)\leqslant p$ is also determined.

PROL : Rehearsal Free Continual Learning in Streaming Data via Prompt Online Learning
M. Anwar Ma'sum, Mahardhika Pratama, Savitha Ramasamy, Lin Liu, Habibullah Habibullah, Ryszard Kowalczyk
https://arxiv.org/abs/2507.12305

PROL : Rehearsal Free Continual Learning in Streaming Data via Prompt Online Learning
The data privacy constraint in online continual learning (OCL), where the data can be seen only once, complicates the catastrophic forgetting problem in streaming data. A common approach applied by the current SOTAs in OCL is with the use of memory saving exemplars or features from previous classes to be replayed in the current task. On the other hand, the prompt-based approach performs excellently in continual learning but with the cost of a growing number of trainable parameters. The first ap…

Several new classes of optimal p-ary cyclic codes
Mengen Fang, Lanqiang Li, Fuyin Tian, Li Liu
https://arxiv.org/abs/2509.09951 https://arxiv.org/pdf/2509.…

Several new classes of optimal p-ary cyclic codes
Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an odd prime with $p\geq5$, and let $m$ be a positive integer. The primary objective of this paper is to construct three novel classes of optimal $p$-ary cyclic codes, denoted as ${\mathcal{C}_p}(0,s,t)$, which possess the parameters $[{p^m} - 1,{p^m} - 2m - 2,4…

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
Massimo Benerecetti (Universit\`a degli Studi di Napoli "Federico II"), Dario Della Monica (Universit\`a degli Studi di Udine), Angelo Matteo (Universit\`a degli Studi di Udine), Fabio Mogavero (Universit\`a degli Studi di Napoli "Federico II"), Gabriele Puppis (Universit\`a degli Studi di Udine)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
In this paper, we study First Order Logic (FO) over (unordered) infinite trees and its connection with branching-time temporal logics. More specifically, we provide an automata-theoretic characterisation of FO interpreted over infinite trees. To this end, two different classes of hesitant tree automata are introduced and proved to capture precisely the expressive power of two branching time temporal logics, denoted polcCTLp and cCTL*[f], which are, respectively, a restricted version of counti…

Scalable Thread-Safety Analysis of Java Classes with CodeQL
Bj{\o}rnar Haugstad J{\aa}tten, Simon Boye J{\o}rgensen, Rasmus Petersen, Ra\'ul Pardo
https://arxiv.org/abs/2509.02022

Scalable Thread-Safety Analysis of Java Classes with CodeQL
In object-oriented languages software developers rely on thread-safe classes to implement concurrent applications. However, determining whether a class is thread-safe is a challenging task. This paper presents a highly scalable method to analyze thread-safety in Java classes. We provide a definition of thread-safety for Java classes founded on the correctness principle of the Java memory model, data race freedom. We devise a set of properties for Java classes that are proven to ensure thread-sa…

Atiyah Classes in the Context of Generalized Complex Geometry
Dadi Ni
https://arxiv.org/abs/2508.10723 https://arxiv.org/pdf/2508.10723

Atiyah Classes in the Context of Generalized Complex Geometry
In analogy to the classical holomorphic setting, Lang, Jia and Liu introduced the notion of the Atiyah class for a generalized holomorphic vector bundle using three different approaches: leveraging $\rm{\check{C}}$ech cohomology, employing the first jet short exact sequence, and adopting the perspective of Lie algebroid pairs. The purpose of this note is to establish the equivalence among these diverse definitions of the Atiyah class.

Overcoming Low-Resource Barriers in Tulu: Neural Models and Corpus Creation for OffensiveLanguage Identification
Anusha M D, Deepthi Vikram, Bharathi Raja Chakravarthi, Parameshwar R Hegde
https://arxiv.org/abs/2508.11166

Overcoming Low-Resource Barriers in Tulu: Neural Models and Corpus Creation for OffensiveLanguage Identification
Tulu, a low-resource Dravidian language predominantly spoken in southern India, has limited computational resources despite its growing digital presence. This study presents the first benchmark dataset for Offensive Language Identification (OLI) in code-mixed Tulu social media content, collected from YouTube comments across various domains. The dataset, annotated with high inter-annotator agreement (Krippendorff's alpha = 0.984), includes 3,845 comments categorized into four classes: Not Offens…

Mobile-Friendly Deep Learning for Plant Disease Detection: A Lightweight CNN Benchmark Across 101 Classes of 33 Crops
Anand Kumar, Harminder Pal Monga, Tapasi Brahma, Satyam Kalra, Navas Sherif
https://arxiv.org/abs/2508.10817

Mobile-Friendly Deep Learning for Plant Disease Detection: A Lightweight CNN Benchmark Across 101 Classes of 33 Crops
Plant diseases are a major threat to food security globally. It is important to develop early detection systems which can accurately detect. The advancement in computer vision techniques has the potential to solve this challenge. We have developed a mobile-friendly solution which can accurately classify 101 plant diseases across 33 crops. We built a comprehensive dataset by combining different datasets, Plant Doc, PlantVillage, and PlantWild, all of which are for the same purpose. We evaluated …

Uniformity within Parameterized Circuit Classes
Steef Hegeman, Jan Martens, Alfons Laarman
https://arxiv.org/abs/2509.09657 https://arxiv.org/pdf/2509.0965…

Uniformity within Parameterized Circuit Classes
We study uniformity conditions for parameterized Boolean circuit families. Uniformity conditions require that the infinitely many circuits in a circuit family are in some sense easy to construct from one shared description. For shallow circuit families, logtime-uniformity is often desired but quite technical to prove. Despite that, proving it is often left as an exercise for the reader -- even for recently introduced classes in parameterized circuit complexity, where uniformity conditions have …

A Modular PyTheus Quantum Network Interpreter: Automated Analysis and Visualization of Optimized Quantum Architectures
S. K. Rithvik
https://arxiv.org/abs/2507.12997

A Modular PyTheus Quantum Network Interpreter: Automated Analysis and Visualization of Optimized Quantum Architectures
We present a modular interpreter for PyTheus-optimized quantum networks that automatically analyzes and visualizes complex quantum architectures discovered through automated optimization. The interpreter addresses the critical challenge of understanding machine-designed quantum networks by providing robust algorithms for functional role identification, graph-theoretical analysis, and physically meaningful visualization across the major classes of PyTheus-generated networks. Our interpreter acce…

Lattice polytopes and semigroup algebras: Generic Lefschetz properties and Parseval-Rayleigh identities
Karim Alexander Adiprasito, Stavros Argyrios Papadakis, Vasiliki Petrotou
https://arxiv.org/abs/2509.14152

Lattice polytopes and semigroup algebras: Generic Lefschetz properties and Parseval-Rayleigh identities
We study semigroup algebras associated to lattice polytopes. We begin by generalizing and refining work of Hochster, and describe the volume maps of these algebras, that is, their fundamental classes, in terms of Parseval-Rayleigh identities and differential equations, which we prove to be equivalent. We use these descriptions to establish strong Lefschetz properties. A consequence is the resolution of several conjectures concerning unimodality properties of the h*-polynomial of lattice p…

Hurwitz space components; and the Coleman-Oort Conjecture
Michael D. Fried
https://arxiv.org/abs/2509.08904 https://arxiv.org/pdf/2509.08904

Hurwitz space components; and the Coleman-Oort Conjecture
Hurwitz spaces are moduli of isotopy classes of covers. A specific space is formed from a finite group G and C, r of its conjugacy classes and an equivalence relation \dagger. Components, interpret as a braid orbits on Nielsen classes. Fried-Völklein 1991 related absolute (corresponding to a permutation representation, T, of G) and inner equivalence classes. It noted two situations producing multiple components: #1. The action of a normalizer subgroup from $T$ on components; and #2. dist…

Testing for Renamability to Classes of Clause Sets
Albert Brandl, Christian G. Ferm\"uller, Gernot Salzer
https://arxiv.org/abs/2507.05044 https://

Testing for Renamability to Classes of Clause Sets
This paper investigates the problem of testing clause sets for membership in classes known from literature. In particular, we are interested in classes defined via renaming: Is it possible to rename the predicates in a way such that positive and negative literals satisfy certain conditions? We show that for classes like Horn or OCC1N, the existence of such renamings can be decided in polynomial time, whereas the same problem is NP-complete for class PVD. The decision procedures are based on hyp…

sp_high_school_new: High school dynamic contacts (2011-2012)
These datasets contain the temporal network of contacts between students in a high school in Marseilles, France. The first dataset gives the contacts of the students of three classes during 4 days in Dec. 2011, and the second corresponds to the contacts of the students of 5 classes during 7 days (from a Monday to the Tuesday of the following week) in Nov. 2012.
This network has 180 nodes and 45047 edges.
Tags: Soc…

I do not like how Haskell’s antagonism towards cyclic imports leads me to put all my `data` declarations in one file, and then distribute the functionality everywhere.
You don’t have to have classes to benefit from information hiding a la object-oriented programming.

On the Learnability of Distribution Classes with Adaptive Adversaries
Tosca Lechner, Alex Bie, Gautam Kamath
https://arxiv.org/abs/2509.05137 https://arxiv…

On the Learnability of Distribution Classes with Adaptive Adversaries
We consider the question of learnability of distribution classes in the presence of adaptive adversaries -- that is, adversaries capable of intercepting the samples requested by a learner and applying manipulations with full knowledge of the samples before passing it on to the learner. This stands in contrast to oblivious adversaries, who can only modify the underlying distribution the samples come from but not their i.i.d.\ nature. We formulate a general notion of learnability with respect to …

Counting Martingales for Measure and Dimension in Complexity Classes
John M. Hitchcock, Adewale Sekoni, Hadi Shafei
https://arxiv.org/abs/2508.07619 https://

Counting Martingales for Measure and Dimension in Complexity Classes
This paper makes two primary contributions. First, we introduce the concept of counting martingales and use it to define counting measures, counting dimensions, and counting strong dimensions. Second, we apply these new tools to strengthen previous circuit lower bounds. Resource-bounded measure and dimension have traditionally focused on deterministic time and space bounds. We use counting complexity classes to develop resource-bounded counting measures and dimensions. Counting martingales ar…

Counting isomorphism classes of elliptic curves over $\mathbb{F}_q(t)$
Jun-Yong Park
https://arxiv.org/abs/2507.06754 https://arxiv.o…

Counting isomorphism classes of elliptic curves over $\mathbb{F}_q(t)$
We determine the precise number of isomorphism classes of elliptic curves over $\mathbb{F}_q(t)$ with $\text{char}(\mathbb{F}_q) = 3,2$. The key idea is to obtain the exact unweighted number of rational points on the classifying stacks $\mathcal{B} Q_{12}$, $\mathcal{B} Q_{24}$ and $\mathcal{B} Z$, where $Q_{12}$ and $Q_{24}$ denote the dicyclic groups of orders 12 and 24, respectively, and $Z$ denotes the non-reduced group scheme of order 2. This computation, inspired by the classical work of …

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
Janne Fuchser, Nikolas M\"ahlmann, Sebastian Siebertz
https://arxiv.org/abs/2509.10062 h…

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
The radius-$r$ splitter game is played on a graph $G$ between two players: Splitter and Connector. In each round, Connector selects a vertex $v$, and the current game arena is restricted to the radius-$r$ neighborhood of $v$. Then Splitter removes a vertex from this restricted subgraph. The game ends, and Splitter wins, when the arena becomes empty. Splitter aims to end the game as quickly as possible, while Connector tries to prolong it for as long as possible. The splitter game was introduced…

Brauer classes not split by genus one curves
Zinovy Reichstein, Federico Scavia
https://arxiv.org/abs/2508.07447 https://arxiv.org/pdf/2508.07447

Brauer classes not split by genus one curves
We show that there exist Brauer classes over a field $F$ which are not split by any genus one curve over $F$. This answers a question of Clark and Saltman.

jdk: Java SE Dev Kit dependencies (1.6.0.7)
A network of class dependencies within the JDK (Java SE Development Kit) 1.6.0.7 framework. Nodes represent classes and a directed edge indicates a dependency of one class on another.
This network has 6434 nodes and 150985 edges.
Tags: Technological, Software, Unweighted, Multigraph
https://

Using nonassociative algebras to classify skew polycyclic codes up to isometry and equivalence
Susanne Pumpluen
https://arxiv.org/abs/2508.10139 https://ar…

Using nonassociative algebras to classify skew polycyclic codes up to isometry and equivalence
We propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This helps to reduce the number of previously known isometry and equivalence classes, and state precisely when these different notions coincide. In the process, we classify classes of skew $(f,σ,δ)$-polycyclic codes with the same performance parameters, to avoid duplicating already existing codes. We exploit that the generator of a skew polycyclic co…

Entanglement-efficiency trade-offs in the fusion-based generation of photonic GHZ-like states
A. A. Melkozerov, M. Yu. Saygin, S. S. Straupe
https://arxiv.org/abs/2507.12389

Entanglement-efficiency trade-offs in the fusion-based generation of photonic GHZ-like states
Probabilistic entangling measurements are key operations in linear-optical quantum technologies, enabling the generation and manipulation of high-dimensional quantum states. While prior research has focused predominantly on specific entangled states, notably graph states and Greenberger-Horne-Zeilinger (GHZ) states, broader classes of states with variable entanglement remain underexplored. In this work, we present a linear-optical approach for generating and fusing GHZ-like states, which genera…

Modal definability in Euclidean modal logics
Philippe Balbiani, Tinko Tinchev
https://arxiv.org/abs/2508.10813 https://arxiv.org/pdf/2508.10813

Modal definability in Euclidean modal logics
This paper is about the computability of the modal definability problem in classes of frames determined by Euclidean modal logics. We characterize those Euclidean modal logics such that the classes of frames they determine give rise to an undecidable modal definability problem.

FS-SAM2: Adapting Segment Anything Model 2 for Few-Shot Semantic Segmentation via Low-Rank Adaptation
Bernardo Forni, Gabriele Lombardi, Federico Pozzi, Mirco Planamente
https://arxiv.org/abs/2509.12105

FS-SAM2: Adapting Segment Anything Model 2 for Few-Shot Semantic Segmentation via Low-Rank Adaptation
Few-shot semantic segmentation has recently attracted great attention. The goal is to develop a model capable of segmenting unseen classes using only a few annotated samples. Most existing approaches adapt a pre-trained model by training from scratch an additional module. Achieving optimal performance with these approaches requires extensive training on large-scale datasets. The Segment Anything Model 2 (SAM2) is a foundational model for zero-shot image and video segmentation with a modular des…

Conjugacy classes of linear actions in the plane Cremona group
Ivan Cheltsov, Yuri Tschinkel, Zhijia Zhang
https://arxiv.org/abs/2508.09929 https://arxiv.o…

Conjugacy classes of linear actions in the plane Cremona group
We classify regular generically free actions of finite groups on the projective plane, up to conjugation in the Cremona group.

sp_high_school_new: High school dynamic contacts (2011-2012)
These datasets contain the temporal network of contacts between students in a high school in Marseilles, France. The first dataset gives the contacts of the students of three classes during 4 days in Dec. 2011, and the second corresponds to the contacts of the students of 5 classes during 7 days (from a Monday to the Tuesday of the following week) in Nov. 2012.
This network has 180 nodes and 45047 edges.
Tags: Soc…

jung: JUNG and javax class dependencies (2012)
A network of software class dependency within the JUNG 2.0.1 and javax 1.6.0.7 library namespaces edu.uci.ics.jung and java/javax. Nodes represent classes and a directed edge indicates a dependency of one class on another.
This network has 6120 nodes and 138706 edges.
Tags: Technological, Software, Unweighted

Realization of Cohomology Classes in Grassmannians
Izzet Coskun, Julius Ross
https://arxiv.org/abs/2509.03747 https://arxiv.org/pdf/2509.03747

Realization of Cohomology Classes in Grassmannians
The study of irreducible subvarieties has recently seen a surge of interest due to connections with convex geometry. In this paper, we study cohomology classes of Grassmannians that are realizable by irreducible subvarieties. We completely classify the cohomology classes that can be realized by irreducible subvarieties in dimensions 2 and 3 and codimensions 2 and 3. We also classify all the classes that can be realizable by an irreducible subvariety for the Grassmannians $G(2,n)$ for $n \leq 6$…

jung: JUNG and javax class dependencies (2012)
A network of software class dependency within the JUNG 2.0.1 and javax 1.6.0.7 library namespaces edu.uci.ics.jung and java/javax. Nodes represent classes and a directed edge indicates a dependency of one class on another.
This network has 6120 nodes and 138706 edges.
Tags: Technological, Software, Unweighted

jdk: Java SE Dev Kit dependencies (1.6.0.7)
A network of class dependencies within the JDK (Java SE Development Kit) 1.6.0.7 framework. Nodes represent classes and a directed edge indicates a dependency of one class on another.
This network has 6434 nodes and 150985 edges.
Tags: Technological, Software, Unweighted, Multigraph
https://