Tootfinder

aCAdeMiC FrEedOM. 🤡
https://www.nytimes.com/2025/12/23/us/mel-curth-oklahoma-instructor-firing.html

If you disagree, I respect that, but I am personally a victim of this kind of dictionary manipulation and distortion. It is deeply frustrating to see definitions twisted and weaponized against me, and the true meaning of syndicalism, as if bending language could erase its real principles and goals. This kind of intellectual dishonesty is not only misleading but also personally disempowering for those of us who stand for genuine social change.
I advocate for the collectivization of land…

Ground Stratification for a Logic of Definitions with Induction
Nathan Guermond (University of Minnesota), Gopalan Nadathur (University of Minnesota)
https://arxiv.org/abs/2510.12297

Ground Stratification for a Logic of Definitions with Induction
The logic underlying the Abella proof assistant includes mechanisms for interpreting atomic predicates through fixed point definitions that can additionally be treated inductively or co-inductively. However, the original formulation of the logic includes a strict stratification condition on definitions that is too restrictive for some applications such as those that use a logical relations based approach to semantic equivalence. Tiu has shown how this restriction can be eased by utilizing a wea…

My "grow plants everywhere" mod for #Luanti is progressing!
I just built a routine to do blobby weight regions as the intersection of a bunch of parabolas, where weight increases logarithmically from the edge of the parabola with an adjustable edge region, and we use the geometric average of these weight values within the intersection region. Then I spent a few hours hunched over a biomes vornoi diagram approximating different broad regions like "arid_grasses" and "temperate_trees" so you can just name some combination of these regions (with custom per-region multipliers) and have your plant definition apply within those regions. I was using rectangular min/max heat/humidity values before, but they were pretty awkward to work with.
If anyone on here who plays Luanti wants to check it out let me know and I can prioritize publishing what I've got. I've got growth definitions for most but not all VoxeLibre plants and it wouldn't be hard to put them together for another game. No trees yet, but that's pretty much the next thing to work on.

🟢 Was ist eigentlich #Greenwashing? Eine neue Übersichtsstudie hat 646 Definitionen ausgewertet.
Greenwashing bedeutet, dass Unternehmen sich „grüner“ darstellen, als sie wirklich sind – oft durch vage, irrelevante oder selektive Infos.
Das „Need for Balance“-Modell beschreibt auch das Gegenteil –

What is greenwashing- a scoping review of greenwashing definitions and development of the need-for- balance model - Journal of Sustainable Business
As organizations are under increasing pressure to demonstrate environmental responsibility, concerns about greenwashing have grown considerably. Despite its significance, there is no consensus on its definition, which complicates both research and mitigation efforts. To address this gap, we conducted a scoping review of 332 articles published across 174 journals, analyzing 646 definitions of greenwashing. While terminology varies, common themes emerge, and two main types of definitions can be d…

"Kṣaṇa = the time taken for a needle to pierce through hundred lotus petals stacked one on top of the other." https://www.wisdomlib.org/definition/kshana

🥳 JavaScript Database (JSDB) version 6.1.4 released:
• Adds TypeScript type definitions
Been meaning to do this for a while and finally got round to it :)
https://codeberg.org/small-tech/jsdb#javascript-database-jsdb

jsdb
A zero-dependency, transparent, in-memory, streaming write-on-update JavaScript database for the Small Web that persists to a JavaScript transaction log.

Actually, I do want to come back to masculinity under patriarchy and whiteness under white supremacy because I think it's worth talking more about. The "man" under patriarchy (at least "Western" patriarchy) is represented as power and independence. The man needs nothing and thus owes nothing to anyone. The man controls and is not controlled, which is intimately related to independence as dependence can make someone vulnerable to control. The image of "man" projects power and invulnerability. At the same time "man" is a bumbling fool who can't be held accountable for his inability to control his sexual urges. He must be fed and cared for, as though another child. His worst behaviors must be dismissed with phrases such as "boys will be boys" and "locker room talk." The absurdity of the concept of human "independence" is impossible to understate.
Even if you go all Ted Kaczynski, you have still been raised and taught. This is, perhaps, why it is so much more useful to think in terms of obligations than rights. Rights can be claimed and protected with violence alone, but obligations reveal the true interdependence that sustains us. A "man" may assert his rights. Yet, on some level, we all know that the "man" of patriarchy acts as a child who is not mature enough to recognize his obligations.
White violence and white fragility reflect the same dichotomy. "The master race" somehow always needs brown folks to make all their shit and do all the reproductive labor for them. For those who fully embrace whiteness, the "safe space" is a joke. DEI shows weakness. Yet, when presented with an honest history adults become children who are incapable of differentiating between criticism and simple facts. *They* become the ones who must be kept safe. The expectation to be responsible for one's own words and actions, one of the very core definitions of being an adult, is far too much to expect. Their guilt needs room, needs tending, needs caring. White people cannot simply "grow the fuck up" or, as they may say of slavery, "fucking get over it."
And again, interestingly, it is *rights* that they reference: "Mah Freeze PEACH!" I find it hard to distinguish between such and my own child's assertion that anything she doesn't like is "not fair!" No, these assertions fail to recognize the fundamental fabric of adult society: the obligations we hold to each other.
At the intersection of all privilege is the sovereign, the ultimate god-man-baby. Again, referencing the essay (https://hexmhell.writeas.com/observations-on-domination-and-trump)
> This is where it becomes important to consider the ideology behind the sovereign ritual. Participation within the sovereign ritual denotes to the participants elements of the sovereign. That is, all agents of the sovereign are, essentially, micro dictators. By carrying out the will of the sovereign, these micro dictators can, by extension, act outside of the law.
While law enforcement is the ultimate representative of sovereign violence, privileges allow a gradated approximation of the sovereign. Those who are "closer" in privilege to the sovereign may, for example, be permitted to carry out violence against those who are father away. The gradation of privilege turns the whole society, except for the least privileged, into a cult that protects the privilege system on behalf of the most privileged. (And immediately Malcolm X pops to mind as having already talked about part of this relationship in 1963 https://www.youtube.com/watch?v=jf7rsCAfQCo.)

On defining Kemeny's constant for non-backtracking random walks
Jane Breen, Mark Kempton, Adam Knudson, Matthew Shumway
https://arxiv.org/abs/2510.06650 https://

On defining Kemeny's constant for non-backtracking random walks
We propose two possible definitions for a version of Kemeny's constant of a graph based on non-backtracking random walks (in place of the usual simple random walk). We show that these two definitions coincide for edge-transitive graphs, and give a condition generalizing edge-transitive for which equality holds, and investigate by how much they can differ in general. We compute our non-backtracking Kemeny's constant for several families of graphs.

Stable first order theories as simplicial profinite sets
Misha Gavrilovich
https://arxiv.org/abs/2510.00854 https://arxiv.org/pdf/2510.00854

Stable first order theories as simplicial profinite sets
We rewrite simplicially the standard definitions of a complete first order theory, a model of it, and various characterisations of stability of a complete first order theory. In our reformulations the simplicial language replaces the standard definitions based on syntax, making them formally unnecessary. We view a complete first-order theory as a symmetric simplicial object in the category of profinite sets and open continuous maps, defined by the functor sending a finite set of variables int…

CHUCKLE -- When Humans Teach AI To Learn Emotions The Easy Way
Ankush Pratap Singh, Houwei Cao, Yong Liu
https://arxiv.org/abs/2510.09382 https://arxiv.org…

CHUCKLE -- When Humans Teach AI To Learn Emotions The Easy Way
Curriculum learning (CL) structures training from simple to complex samples, facilitating progressive learning. However, existing CL approaches for emotion recognition often rely on heuristic, data-driven, or model-based definitions of sample difficulty, neglecting the difficulty for human perception, a critical factor in subjective tasks like emotion recognition. We propose CHUCKLE (Crowdsourced Human Understanding Curriculum for Knowledge Led Emotion Recognition), a perception-driven CL frame…

HOW TO PROVE IT, PART 7
proof by forward reference:
Reference is usually to a forthcoming paper of the author,
which is often not as forthcoming as at first.
proof by semantic shift:
Some of the standard but inconvenient definitions are changed
for the statement of the result.
proof by appeal to intuition:
Cloud-shaped drawings frequently help here.

The “you don’t even know what a Nazi is” people are so laughable.
Dude, go fuck yourself, but before you do look up what “Nazi” means in a dictionary and that there’s 3 definitions for the word.

from my link log —
A distributed systems reliability glossary.
https://antithesis.com/resources/reliability_glossary/
saved 2025-12-03 https://…

A distributed systems reliability glossary
A list of key concepts for building and testing reliable distributed systems, with basic definitions and deep references.

DriftBench: Defining and Generating Data and Query Workload Drift for Benchmarking
Guanli Liu, Renata Borovica-Gajic
https://arxiv.org/abs/2510.10858 https://

DriftBench: Defining and Generating Data and Query Workload Drift for Benchmarking
Data and workload drift are key to evaluating database components such as caching, cardinality estimation, indexing, and query optimization. Yet, existing benchmarks are static, offering little to no support for modeling drift. This limitation stems from the lack of clear definitions and tools for generating data and workload drift. Motivated by this gap, we propose a unified taxonomy for data and workload drift, grounded in observations from both academia and industry. Building on this foundat…

Topological weak containment
Riley Thornton
https://arxiv.org/abs/2510.10882 https://arxiv.org/pdf/2510.10882

Topological weak containment
We build on work of Elek and Zucker and develop a topological analogue of the theory of weak containment. We show that definitions in terms of local patterns, containment in ultra(co)products, and continuous model theory are all equivalent, just as in ergodic theory. And, for actions on Cantor space, we show these are all equivalent to approximate conjugacy. Restricting our attention to Cantor space, we connect this theory to questions about generic actions. We show how the shape of the space…

Cyclic and alternating $U$-statistics
Svante Janson
https://arxiv.org/abs/2510.12480 https://arxiv.org/pdf/2510.12480…

Cyclic and alternating $U$-statistics
We define cyclic $U$-statistics as a variant of $U$-statistics based on variables $X_1,\dots,X_n$ that are assumed to be cyclically ordered. We also define alternating $U$-statistics where in the definition terms are summed with alternating sings (in three different ways). Only $U$-statistics of order 2 are considered. The definitions are inspired by special cases studied by Chebikin (2008) and Even-Zohar (2017) for random permutations. We show limit theorems similar to well-known results for…

Fine-grained CDN Delegation
Ethan Thompson, Ali Sadeghi Jahromi, AbdelRahman Abdou
https://arxiv.org/abs/2510.09983 https://arxiv.org/pdf/2510.09983…

Fine-grained CDN Delegation
The use of Content Delivery Networks (CDNs) has significantly increased over the past decade, with approximately 55 million websites currently relying on CDN services. Emerging solutions, such as Delegated Credentials (RFC 9345), lack fine-grained definitions of many critical aspects of delegation, such as the length of delegation chains, revocation mechanism, permitted operations, and a well-defined scope for said delegation. We present Delegation Certificates (DeCerts), which modify X.509 cer…

Less is More: On Copy Complexity in Quantum Cryptography
Prabhanjan Ananth, Eli Goldin
https://arxiv.org/abs/2510.04992 https://arxiv.org/pdf/2510.04992

Less is More: On Copy Complexity in Quantum Cryptography
Quantum cryptographic definitions are often sensitive to the number of copies of the cryptographic states revealed to an adversary. Making definitional changes to the number of copies accessible to an adversary can drastically affect various aspects including the computational hardness, feasibility, and applicability of the resulting cryptographic scheme. This phenomenon appears in many places in quantum cryptography, including quantum pseudorandomness and unclonable cryptography. To address th…

Large cities lose their growth edge as urban systems mature
Andrea Musso, Diego Rybski, Dirk Helbing, Frank Neffke
https://arxiv.org/abs/2510.12417 https://

Large cities lose their growth edge as urban systems mature
From 1975 to 2025, urban populations have become increasingly concentrated in large cities. On average across countries, the share of urban residents living in cities with over one million people rose from 18\% in 1975 to 39\% in 2025. Will this trend towards greater concentration in large cities continue or level off? We introduce two new city population datasets that use consistent city definitions across countries and over time. The first covers the world between 1975 and 2025, using satelli…

Perceived Fairness in Networks
Arthur Charpentier
https://arxiv.org/abs/2510.12028 https://arxiv.org/pdf/2510.12028…

Perceived Fairness in Networks
The usual definitions of algorithmic fairness focus on population-level statistics, such as demographic parity or equal opportunity. However, in many social or economic contexts, fairness is not perceived globally, but locally, through an individual's peer network and comparisons. We propose a theoretical model of perceived fairness networks, in which each individual's sense of discrimination depends on the local topology of interactions. We show that even if a decision rule satisfies standard …

Shit people, idioms only work if we all agree on the definitions!
After nearly 200 years of "Out-Of-Pocket" meaning "Paid for it yourself", some ignorant bonehead mashed "Out of office" together with it, and now all of corporate America says "Out-of-pocket" when they mean "unavailable".
Culturally it important? No, of course not. Am I irrationally furious every time I spend time during a meeting looking like an idiot because I h…

The twistor lifts of surfaces in 4-spaces
Naoya Ando
https://arxiv.org/abs/2509.22253 https://arxiv.org/pdf/2509.22253

The twistor lifts of surfaces in 4-spaces
This is a survey of the twistor lifts of surfaces in 4-spaces. In most part of this survey, the space is the Euclidean $4$-space $E^4$. The definitions of the Gauss maps and the twistor lifts of surfaces in $E^4$ are given by complex structures of $E^4$. Based on these definitions, we can understand that the Gauss maps of minimal surfaces are holomorphic and characterize isotropicity of minimal surfaces.

Disclosure and Evaluation as Fairness Interventions for General-Purpose AI
Vyoma Raman, Judy Hanwen Shen, Andy K. Zhang, Lindsey Gailmard, Rishi Bommasani, Daniel E. Ho, Angelina Wang
https://arxiv.org/abs/2510.05292

Disclosure and Evaluation as Fairness Interventions for General-Purpose AI
Despite conflicting definitions and conceptions of fairness, AI fairness researchers broadly agree that fairness is context-specific. However, when faced with general-purpose AI, which by definition serves a range of contexts, how should we think about fairness? We argue that while we cannot be prescriptive about what constitutes fair outcomes, we can specify the processes that different stakeholders should follow in service of fairness. Specifically, we consider the obligations of two major gr…

Division algebras of slice-Nash functions
Cinzia Bisi, Antonio Carbone
https://arxiv.org/abs/2510.09779 https://arxiv.org/pdf/2510.09779

Division algebras of slice-Nash functions
The purpose of this paper is to introduce the notion of Nash functions in the context of slice regular functions of one quaternionic or octonionic variable. We begin with a detailed analysis of the possible definitions of Nash slice regular functions which leads us to the definition of \textit{slice-Nash} function proposed in this paper (and which we strongly believe to be the natural generalisation of the classical real and complex Nash functions to this context). Once the `correct' definition…

The Fractional Two-Sided Quaternionic Dunkl Transform and Heisenberg-Type Inequalities
Mohamed Essenhajy
https://arxiv.org/abs/2510.11597 https://arxiv.org…

The Fractional Two-Sided Quaternionic Dunkl Transform and Heisenberg-Type Inequalities
This report investigates the main definitions and fundamental properties of the fractional two-sided quaternionic Dunkl transform in two dimensions. We present key results concerning its structure and emphasize its connections to classical harmonic analysis. Special attention is given to inversion, boundedness, spectral behavior, and explicit formulas for structured functions such as radial or harmonic functions. Within this framework, we establish a generalized form of the classical Heisenberg…

Developers of invasive visual prostheses for the blind (brain implants, retinal implants) try to protect their turf by ignoring noninvasive alternatives based on smart glasses, using outdated and restrictive definitions, from ivory towers https://www.youtube.com/watch?v=PewuFviiSsQ

Type Theory with Single Substitutions
Ambrus Kaposi (E\"otv\"os Lor\'and University), Szumi Xie (E\"otv\"os Lor\'and University)
https://arxiv.org/abs/2510.12303

Type Theory with Single Substitutions
Type theory can be described as a generalised algebraic theory. This automatically gives a notion of model and the existence of the syntax as the initial model, which is a quotient inductive-inductive type. Algebraic definitions of type theory include Ehrhard's definition of model, categories with families (CwFs), contextual categories, Awodey's natural models, C-systems, B-systems. With the exception of B-systems, these notions are based on a parallel substitution calculus where substitutions …

Null reduction and dynamical realization of Carrollian conformal symmetries
Ashis Saha, Rabin Banerjee, Sunandan Gangopadhyay
https://arxiv.org/abs/2510.06896 https://

Null reduction and dynamical realization of Carrollian conformal symmetries
We start from a Lorentzian action in a deformed light-cone background and applying the method of null reduction leads to a Carrollian action in one lower spacetime dimensions. We also identify the correct light-cone definitions of the symmetry generators and their dynamical forms in terms of the fields and take the $c\rightarrow0$ limit. It is observed that these generators produces the known kinematic Carrollian conformal algebraic commutation relations.

Double Orthogonal Factorization Systems
C. B. Aberl\'e, Elena Caviglia, Matthew Kukla, Rub\'en Maldonado, Luca Mesiti, Dorette Pronk, Tanjona Ralaivaosaona
https://arxiv.org/abs/2509.26343

Double Orthogonal Factorization Systems
We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by several explicit examples, including factorization systems on double categories of spans, relations and bimodules. We then prove monadicity results for orthogonal factorization systems on double categories in order to justify our definitions. For fibrant double c…

A recursive definition for the polymatroid Tutte polynomial
Xiaxia Guan, Xian'an Jin, Weiling Yang
https://arxiv.org/abs/2510.11046 https://arxiv.org/p…

A recursive definition for the polymatroid Tutte polynomial
The Tutte polynomial is a significant invariant of graphs and matroids. It is well-known that it has three equivalent definitions: bases expansion, rank generating function, and deletion-contraction formula. The polymatroid Tutte polynomial $\mathscr{T}_{P}$ generalizes the Tutte polynomial from matroids to polymatroids $P$. In \emph{[Adv. Math. 402 (2022) 108355.]} and \emph{[J. Combin. Theory Ser. A 188 (2022) 105584]}, the authors provided bases expansion and rank generating function constru…

🇺🇦 #NowPlaying on #BBC6Music's #NewMusicFix
Rainy Miller:
🎵 Mud in my Mouth. (Predetermined Definitions)
#RainyMiller
https://rainymiller.bandcamp.com/track/mud-in-my-mouth-predetermined-definitions

Characteristic polynomials of tensors via Grassmann integrals and distributions of roots for random Gaussian tensors
Nicolas Delporte, Giacomo La Scala, Naoki Sasakura, Reiko Toriumi
https://arxiv.org/abs/2510.04068

Characteristic polynomials of tensors via Grassmann integrals and distributions of roots for random Gaussian tensors
We propose a new definition of characteristic polynomials of tensors based on a partition function of Grassmann variables. This new notion of characteristic polynomial addresses general tensors including totally antisymmetric ones, but not totally symmetric ones. Drawing an analogy with matrix eigenvalues obtained from the roots of their characteristic polynomials, we study the roots of our tensor characteristic polynomial. Unlike standard definitions of eigenvalues of tensors of dimension $N$ …

Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
Fabien de Montgolfier (IRIF), Renaud Torfs (IRIF)
https://arxiv.org/abs/2510.04621

Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs $\star$
There are three usual definitions of a maximum bipartite clique (biclique) in a bipartite graph\,: either maximizing the number of vertices, or of edges, or finding a maximum balanced biclique. The first problem can be solved in polynomial time, the last ones are NP-complete. Here we show how these three problems may be efficiently solved for two classes of bipartite graphs: Star123-free twin-free graphs, and bounded bimodularwidth twin-free graphs, a class that may be defined using bimodular d…

Revised comment on the paper titled "The Origin of Quantum Mechanical Statistics: Insights from Research on Human Language
Miko{\l}aj Sienicki, Krzysztof Sienicki
https://arxiv.org/abs/2512.07881 https://arxiv.org/pdf/2512.07881 https://arxiv.org/html/2512.07881
arXiv:2512.07881v1 Announce Type: new
Abstract: This short note comments on \citet{Aerts2024Origin}, which proposes that ranked word frequencies in texts should be read through the lens of Bose--Einstein (BE) statistics and even used to illuminate the origin of quantum statistics in physics. The core message here is modest: the paper offers an interesting analogy and an eye-catching fit, but several key steps mix physical claims with definitions and curve-fitting choices. We highlight three such points: (i) a normalization issue that is presented as "bosonic enhancement", (ii) an identification of rank with energy that makes the BE fit only weakly diagnostic of an underlying mechanism, and (iii) a baseline comparison that is too weak to support an ontological conclusion. We also briefly flag a few additional concerns (interpretation drift, parameter semantics, and reproducibility).
toXiv_bot_toot

Efficient Mining of Low-Utility Sequential Patterns
Jian Zhu, Zhidong Lin, Wensheng Gan, Ruichu Cai, Zhifeng Hao, Philip S. Yu
https://arxiv.org/abs/2510.10243 https://

Efficient Mining of Low-Utility Sequential Patterns
Discovering valuable insights from rich data is a crucial task for exploratory data analysis. Sequential pattern mining (SPM) has found widespread applications across various domains. In recent years, low-utility sequential pattern mining (LUSPM) has shown strong potential in applications such as intrusion detection and genomic sequence analysis. However, existing research in utility-based SPM focuses on high-utility sequential patterns, and the definitions and strategies used in high-utility S…

Day 11: Bee Johnson
As promised, back to printed books, and since I hadn't yet done any authors of picture or board books, here's one. It looks like Johnson is primarily an illustrator and has only written a single kids' book, but it's a magnificent one: "What Can A Mess Make?"
Naturally, the illustrations are rich and evocative, but it's also got one of my favorite formats (just a few lines per page, with consistent meter and rhymes throughout) and has the incredibly charming theme of two sisters who are constantly making messes, except it highlights the fun (and other emotions) they get out of their messy play, reminding parents cleaning up messes that there's a benefit to letting your kids make the mess in the first place, which is an idea that's stuck with me as I clean up my own kids' messes. This book checks *all* of my boxes for a good picture book (which is kinda hard).
#20AuthorsNoMen
P.S. at this point, I think I've exhausted the range of "author" definitions I wanted to include in my list, and I've now got the unenviable task of balancing between genres and trying to hit some of my favorite authors before we get to 20. We'll see how that goes...

A Practitioner's Guide to Multi-turn Agentic Reinforcement Learning
Ruiyi Wang, Prithviraj Ammanabrolu
https://arxiv.org/abs/2510.01132 https://arxiv.o…

A Practitioner's Guide to Multi-turn Agentic Reinforcement Learning
We study what actually works and what doesn't for training large language models as agents via multi-turn reinforcement learning. Despite rapid progress, existing frameworks and definitions are fragmented, and there is no systematic formulation or analysis of which design choices matter across tasks. We address this gap by first breaking down the design space into three inter-related pillars -- environment, reward, and policy -- and empirically derive a recipe for training LLM agents in situate…

$\chi$ -extending modular lattices
Jesus Adrian Celis-Gonz\'alez, Hugo Alberto Rinc\'on-Mej\'ia
https://arxiv.org/abs/2509.22903 https://arxiv.…

$χ$ -extending modular lattices
This paper investigates the theory of lattices, focusing on extending lattices relative to abstract classes, modular lattices, and torsion lattices. Definitions of type-1 and type-2 extending lattices are provided, along with their weakly extending counterparts. Modular and upper continuous lattices are analyzed, with lemmas establishing relationships between pseudo-complements, complements, and essential elements. Applications to module theory are highlighted.

WTMAD-4: A Fair Weighting Scheme for GMTKN55
Kyle R. Bryenton, Erin R. Johnson
https://arxiv.org/abs/2509.23498 https://arxiv.org/pdf/2509.23498

WTMAD-4: A Fair Weighting Scheme for GMTKN55
The GMTKN55 data set is a collection of standard benchmarks used in molecular quantum chemistry that spans small- and large-molecule thermochemistry, reaction barriers, and non-covalent interactions. Herein, we identify a flaw in the weighted mean absolute deviation (WTMAD) definitions commonly used to quantify performance of various electronic-structure methods for the GMTKN55 set, which under-weight some of its component benchmarks by orders of magnitude. A new WTMAD-4 metric is proposed, bas…

🇺🇦 #NowPlaying on #BBC6Music's #NewMusicFix
Rainy Miller:
🎵 Mud in my Mouth. (Predetermined Definitions)
#RainyMiller
https://rainymiller.bandcamp.com/track/mud-in-my-mouth-predetermined-definitions

Replaced article(s) found for cs.LO. https://arxiv.org/list/cs.LO/new
[1/1]:
- Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
Agi Kurucz, Frank Wolter, Michael Zakharyaschev

Inhomogeneous branching trees with symmetric and asymmetric offspring and their genealogies
Frederik M. Andersen, Marc A. Suchard, Carsten Wiuf, Samir Bhatt
https://arxiv.org/abs/2510.07921

Inhomogeneous branching trees with symmetric and asymmetric offspring and their genealogies
We define symmetric and asymmetric branching trees, a class of processes particularly suited for modeling genealogies of inhomogeneous populations where individuals may reproduce throughout life. In this framework, a broad class of Crump-Mode-Jagers processes can be constructed as (a)symmetric Sevast'yanov processes, which count the branches of the tree. Analogous definitions yield reduced (a)symmetric Sevast'yanov processes, which restrict attention to branches that lead to extant progeny. We …

Colored Petri Nets are Lax Double Functors
Jade Master, Joe Moeller
https://arxiv.org/abs/2510.01946 https://arxiv.org/pdf/2510.01946

Colored Petri Nets are Lax Double Functors
We give a characterization of colored Petri nets as lax double functors. Framing colored Petri nets in terms of category theory allows for canonical definitions of various well-known constructions on colored Petri nets. In particular, we show how morphisms of colored Petri nets may be understood as natural transformations. A result from folklore, which we sketch in the appendix, shows that lax double functors are equivalent to functors with codomain their former domain. We use this result to ch…

On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
Hadar Rotschield, Liat Peterfreund
https://arxiv.org/abs/2510.07062 https://

On the Expressiveness of Languages for Querying Property Graphs in Relational Databases
SQL/PGQ is the emerging ISO standard for querying property graphs defined as views over relational data. We formalize its expressive power across three fragments: the read-only core, the read-write extension, and an extended variant with richer view definitions. Our results show that graph creation plays a central role in determining the expressiveness. The read-only fragment is strictly weaker than the read-write fragment, and the latter is still below the complexity class NL. Extending view d…

Two Decades of Probabilistic Approach to Liouville Conformal Field Theory
R\'emi Rhodes, Vincent Vargas
https://arxiv.org/abs/2509.21053 https://arxiv.…

Two Decades of Probabilistic Approach to Liouville Conformal Field Theory
Over the past twenty years, the probabilistic approach to Liouville Conformal Field Theory (LCFT) has undergone remarkable developments, transforming a collection of ideas at the interface of probability, geometry, complex analysis and physics into a coherent mathematical theory. Building on Gaussian Free Fields and Gaussian Multiplicative Chaos, rigorous definitions of correlation functions and partition functions have been established, culminating in the probabilistic derivation of the DOZZ f…

Asplund spaces $C_k(X)$ beyond Banach spaces
Marian Fabian, Jerzy K\c{a}kol, Arkady Leiderman
https://arxiv.org/abs/2510.01873 https://arxiv.org/pdf/2510.0…

Asplund spaces $C_k(X)$ beyond Banach spaces
This paper addresses the Asplund property for the space of continuous functions $C_k(X)$ equipped with the compact-open topology, when $X$ is an arbitrary Tychonoff space. Motivated by inconsistent definitions in prior literature extending the Asplund property beyond Banach spaces, we provide a unified and self-contained treatment of core results in this context. A characterization of the Asplund property for $C_k(X)$ is established, alongside a review of classical results, including the Nami…

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
Martin Dvorak, Tristan Figueroa-Reid, Rida Hamadani, Byung-Hak Hwang, Evgenia Karunus, Vladimir Kolmogorov, Alexander Meiburg, Alexander Nelson, Peter Nelson, Mark Sandey, Ivan Sergeev
https://arxiv.org/abs/2509.20539

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited number of notions and results have been implemented so far. In this work, we formalize the proof of the forward (composition) direction of Seymour's theorem for regular matroids. To this end, we develop a library in Lean 4 that implements definitions and result…