Related papers: Combinatorics of branchings in higher dimensional …
The notion of comparison between system runs is fundamental in formal verification. This concept is implicitly present in the verification of qualitative systems, and is more pronounced in the verification of quantitative systems. In this…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
Symmetric homology is an analog of cyclic homology in which the cyclic groups are replaced by symmetric groups. The foundations for the theory of symmetric homology of algebras are developed in the context of crossed simplicial groups using…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
2-Segal spaces arise not only from $S_\dotp$-constructions associated to Waldhausen and (proto) exact categories, but also from $S_\dotp$-constructions associated to certain double-categorical structures. A major step in this direction is…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the…
In this paper, we review a method for computing and parameterizing the set of homotopy classes of chain maps between two chain complexes. This is then applied to finding topologically meaningful maps between simplicial complexes, which in…
We study rational homology groups of one-point compactifications of spaces of complex monic polynomials with multiple roots. These spaces are indexed by number partitions. A standard reformulation in terms of quotients of orbit arrangements…
We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…
We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…
Multipath cohomology is a cohomology theory for directed graphs, which is defined using the path poset. The aim of this paper is to investigate combinatorial properties of path posets, and to provide computational tools for multipath…
We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…
The combinatorics of dimer models on brane tilings describe a large class of four-dimensional $\mathcal{N}=1$ gauge theories that afford quiver descriptions and have toric moduli spaces. We introduce a combinatorial optimization method…
This is a survey of some recent developments in the study of complements of line arrangements in the complex plane. We investigate the fundamental groups and finite covers of those complements, focusing on homological and enumerative…
Concentric tube continuum robots utilize nested tubes, which are subject to a set of inequalities. Current approaches to account for inequalities rely on branching methods such as if-else statements. It can introduce discontinuities, may…
This paper surveys the recent attempts at leveraging machine learning to solve constrained optimization problems. It focuses on surveying the work on integrating combinatorial solvers and optimization methods with machine learning…
Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…
Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a…