English
Related papers

Related papers: A Characterization of Combined Traces Using Labele…

200 papers

In 1984, Charney and Lee defined a category of stable curves and exhibited a rational homology equivalence from its geometric realisation to (the analytification of) the moduli stack of stable curves, also known as the…

Algebraic Geometry · Mathematics 2023-11-23 Mikala Ørsnes Jansen

We provide the first comprehensive study on how to classify trajectories using only their spatial representations, measured on 5 real-world data sets. Our comparison considers 20 distinct classifiers arising either as a KNN classifier of a…

Computational Geometry · Computer Science 2022-09-07 Hasan Pourmahmood-Aghababa , Jeff M. Phillips

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin's…

Logic in Computer Science · Computer Science 2007-05-23 B. Bloom , W. J. Fokkink , R. J. van Glabbeek

The conjugacy class of a generic unimodular 2 by 2 complex matrix is determined by its trace, which may be an arbitrary complex number. In the nineteenth century, it was known that a generic pair (X,Y) of such pairs is determined up to…

Geometric Topology · Mathematics 2011-07-12 William M. Goldman

The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…

Geometric Topology · Mathematics 2007-05-23 Joan S. Birman , Rolland Trapp

In this paper, we propose a first-order ontology for generalized stratified order structure. We then classify the models of the theory using model-theoretic techniques. An ontology mapping from this ontology to the core theory of Process…

Artificial Intelligence · Computer Science 2009-07-17 Dai Tri Man Le

Ordered logics and type systems have been used in a variety of applications including computational linguistics, memory allocation, stream processing, logical frameworks, parametricity, and enforcing security protocols. In most…

Logic in Computer Science · Computer Science 2026-05-20 Sophia Roshal , Frank Pfenning

Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…

Quantum Algebra · Mathematics 2009-10-31 Anne Schilling , S. Ole Warnaar

We use orientations on stable graphs to express the combinatorial structure of the compactified universal Jacobians in degrees g-1 and g over the moduli space of stable curves, \Mgb, and construct for them graded stratifications compatible…

Algebraic Geometry · Mathematics 2019-02-13 Lucia Caporaso , Karl Christ

The stratified structure of the configuration space $\mb G^N = G \times ... \times G$ reduced with respect to the action of $G$ by inner automorphisms is investigated for $G = SU(3) .$ This is a finite dimensional model coming from lattice…

High Energy Physics - Theory · Physics 2009-11-10 S. Charzyński , J. Kijowski , G. Rudolph , M. Schmidt

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

Geometric Topology · Mathematics 2016-01-14 Arnaud Mortier

We study algebraic K-theory and topological Hochschild homology in the setting of bimodules over a stable category, a datum we refer to as a laced category. We show that in this setting both K-theory and THH carry universal properties, the…

Algebraic Topology · Mathematics 2026-03-03 Yonatan Harpaz , Thomas Nikolaus , Victor Saunier

Let $X$ be a complex projective variety defined over $\mathbb R$. Recently, Bernardi and the first author introduced the notion of admissible rank with respect to $X$. This rank takes into account only decompositions that are stable under…

Algebraic Geometry · Mathematics 2019-09-26 Edoardo Ballico , Emanuele Ventura

In this paper we present a new approach to data modelling, called the concept-oriented model (CoM), and describe its main features and characteristics including data semantics and operations. The distinguishing feature of this model is that…

Databases · Computer Science 2008-07-01 Alexandr Savinov

The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…

Social and Information Networks · Computer Science 2023-01-23 Mariane B. Neiva , Odemir M. Bruno

We show that the topes of a complex of oriented matroids (abbreviated COM) of VC-dimension $d$ admit a proper labeled sample compression scheme of size $d$. This considerably extends results of Moran and Warmuth on ample classes, of…

Combinatorics · Mathematics 2023-04-21 Victor Chepoi , Kolja Knauer , Manon Philibert

Zaslavsky (1991) introduced a graphical structure called a biased graph and used it to characterize all single-element coextensions and elementary lifts of graphic matroids. We introduce a new, dual graphical structure that we call a…

Combinatorics · Mathematics 2024-02-01 Daniel Slilaty , Thomas Zaslavsky

Proposed the computerized method for calculating the relative level of order composites. Correlation between a level of structure order and properties of solids is shown. Discussed the possibility of clarifying the terminology used in…

Graphics · Computer Science 2020-12-16 Alexander Herega

Framed combinatorial topology is a recent approach to tame geometry which expresses higher-dimensional stratified spaces via tractable combinatorial data. The resulting theory of spaces is well-behaved and computable. In this paper we…

Algebraic Topology · Mathematics 2023-05-11 Lukas Heidemann

Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…

Combinatorics · Mathematics 2022-08-02 Nicola Apollonio , Lorenzo Balzotti