English
Related papers

Related papers: Difference hierarchies and duality with an applica…

200 papers

This paper explores the fine-grained structure of classes of regular languages maintainable in fragments of first-order logic within the dynamic descriptive complexity framework of Patnaik and Immerman. A result by Hesse states that the…

Logic in Computer Science · Computer Science 2026-01-27 Corentin Barloy , Felix Tschirbs , Nils Vortmeier , Thomas Zeume

Many classification problems consider classes that form a hierarchy. Classifiers that are aware of this hierarchy may be able to make confident predictions at a coarse level despite being uncertain at the fine-grained level. While it is…

Machine Learning · Computer Science 2023-02-13 Jack Valmadre

Families of objects appear in several contexts, like algebraic topology, theory of deformations, theoretical physics, etc. An unified coordinate-free algebraic framework for families of geometrical quantities is presented here, which allows…

Differential Geometry · Mathematics 2013-04-30 Giovanni Moreno

We extend to general Cartesian categories the idea of Coherent Differentiation recently introduced by Ehrhard in the setting of categorical models of Linear Logic. The first ingredient is a summability structure which induces a partial…

Logic in Computer Science · Computer Science 2023-06-08 Thomas Ehrhard , Aymeric Walch

Our main result is that any topological algebra based on a Boolean space is the extended Stone dual space of a certain associated Boolean algebra with additional operations. A particular case of this result is that the profinite completion…

Logic · Mathematics 2013-09-13 Mai Gehrke

We introduce Riesz Logic, whose models are abelian lattice ordered groups, which generalise Riesz spaces (vector lattices), and show soundness and completeness. Our motivation is to provide a logic for distributional semantics of natural…

Logic in Computer Science · Computer Science 2014-10-14 Daoud Clarke

Category theory has foundational importance because it provides conceptual lenses to characterize what is important and universal in mathematics---with adjunctions being the primary lense. If adjunctions are so important in mathematics,…

Category Theory · Mathematics 2013-05-31 David Ellerman

We combine the theory of traces in homotopical algebra with sheaf theory in derived algebraic geometry to deduce general fixed point and character formulas. The formalism of dimension (or Hochschild homology) of a dualizable object in the…

Algebraic Geometry · Mathematics 2019-06-06 David Ben-Zvi , David Nadler

This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive…

Optimization and Control · Mathematics 2024-10-02 Robert Ghrist , Julian Gould , Miguel Lopez

Large language models (LLMs) have revolutionized natural language processing, yet they remain constrained by fixed, non-differentiable tokenizers like Byte Pair Encoding (BPE), which hinder end-to-end optimization and adaptability to noisy…

Computation and Language · Computer Science 2026-01-30 Alon Rozental

We investigate the quantifier alternation hierarchy in first-order logic on finite words. Levels in this hierarchy are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…

Formal Languages and Automata Theory · Computer Science 2014-04-29 Thomas Place , Marc Zeitoun

A crucial step in the history of General Relativity was Einstein's adoption of the principle of general covariance which demands a coordinate independent formulation for our spacetime theories. General covariance helps us to disentangle a…

History and Philosophy of Physics · Physics 2022-05-19 Daniel Grimmer

The dot-depth hierarchy is a classification of star-free languages. It is related to the quantifier alternation hierarchy of first-order logic over finite words. We consider fragments of languages with dot-depth 1/2 and dot-depth 1 obtained…

Formal Languages and Automata Theory · Computer Science 2015-03-19 Manfred Kufleitner , Alexander Lauser

It is known that many networks modeling real-life complex systems are small-word (large local clustering and small diameter) and scale-free (power law of the degree distribution), and very often they are also hierarchical. Although most of…

Combinatorics · Mathematics 2016-08-09 C. Dalfó , M. A. Fiol

Given a regular language $L$, we study the language of words $\mathsf{D}(L)$, that distinguish between pairs of different left-quotients of $L$. We characterize this distinguishability operation, show that its iteration has always a fixed…

Formal Languages and Automata Theory · Computer Science 2014-12-11 Cezar Câmpeanu , Nelma Moreira , Rogério Reis

Categories provide a coarse grained description of the world. A fundamental question is whether categories simply mirror an underlying structure of nature, or instead come from the complex interactions of human beings among themselves and…

Physics and Society · Physics 2008-06-19 Andrea Puglisi , Andrea Baronchelli , Vittorio Loreto

For an arbitrary dynamical system there is a strong relationship between global dynamics and the order structure of an appropriately constructed Priestley space. This connection provides an order-theoretic framework for studying global…

Dynamical Systems · Mathematics 2024-07-22 William Kalies , Robert Vandervorst

Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…

Category Theory · Mathematics 2008-02-06 Claudio Pisani

Cartesian difference categories are a recent generalisation of Cartesian differential categories which introduce a notion of "infinitesimal" arrows satisfying an analogue of the Kock-Lawvere axiom, with the axioms of a Cartesian…

Logic in Computer Science · Computer Science 2020-12-01 Mario Alvarez-Picallo , C. -H. Luke Ong

Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes…

Machine Learning · Computer Science 2012-07-03 Konstantina Palla , David Knowles , Zoubin Ghahramani