Related papers: Formalizing parity complexes
Bipolar Argumentation Frameworks (BAFs) admit several interpretations of the support relation and diverging definitions of semantics. Recently, several classes of BAFs have been captured as instances of bipolar Assumption-Based…
In this paper will be introduced large, probably complete family of complex base systems, which are 'proper' - for each point of the space there is a representation which is unique for all but some zero measure set. The condition defining…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
This article presents a methodology that automatically derives a combinatorial specification for a permutation class C, given its basis B of excluded patterns and the set of simple permutations in C, when these sets are both finite. This is…
Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions,…
A new method of deriving comparative statics information using generalized compensated derivatives is presented which yields constraint-free semidefiniteness results for any differentiable, constrained optimization problem. More generally,…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…
We introduce decomposition algebras as a natural generalization of axial algebras, Majorana algebras and the Griess algebra. They remedy three limitations of axial algebras: (1) They separate fusion laws from specific values in a field,…
We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…
From Smyth's classification, modular compactifications of pointed smooth rational curves are indexed by combinatorial data, so-called extremal assignments. We explore their combinatorial structures and show that any extremal assignment is a…
Let $p$ be a prime number and let $X$ be a complex algebraic variety with an action of $\mathbb{Z}/p\mathbb{Z}$. We develop the theory of parity complexes in a certain $2$-periodic localization of the equivariant constructible derived…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
Orthogonality is a notion based on the duality between programs and their environments used to determine when they can be safely combined. For instance, it is a powerful tool to establish termination properties in classical formal systems.…
Let $G$ be a finite group. In 2024, Cameron introduced two different concepts of independence (namely independence and strong independence) for the subsets of $G$, yielding to the definition of two simplicial complexes whose vertices are…
Axial algebras are a recently introduced class of non-associative algebra motivated by applications to groups and vertex-operator algebras. We develop the structure theory of axial algebras focussing on two major topics: (1) radical and…
In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…
A classical combinatorial fact is that the simplicial complex consisting of disjointly embedded chords in a convex planar polygon is a sphere. For any surface F with non-empty boundary, there is an analogous complex Arc(F) consisting of…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…