Related papers: Invariance: a Theoretical Approach for Coding Sets…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We define a new topological invariant of line arrangements in the complex projective plane. This invariant is a root of unity defined under some combinatorial restrictions for arrangements endowed with some special torsion character on the…
If the inverse of a nonsingular polynomial matrix $L$ has a polynomial part then one can associate with $L$ a module over the ring of proper rational functions, which is related to the structure of $L$ at infinity. In this paper we…
Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…
The modern way to understand symmetries of a quantum field theory is via its topological defects in various dimensions. In this contribution to the proceedings we focus on line defects in 2d QFT and we point out that topological defects…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
In this paper we examine the reverse mathematical strength of a variation of Hindman's Theorem HT constructed by essentially combining HT with the Thin Set Theorem TS to obtain a principle which we call thin-HT. thin-HT says that every…
We study the reverse mathematics of countable analogues of several maximality principles that are equivalent to the axiom of choice in set theory. Among these are the principle asserting that every family of sets has a $\subseteq$-maximal…
We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
Provably correct software is one of the key challenges in our softwaredriven society. While formal verification establishes the correctness of a given program, the result of program synthesis is a program which is correct by construction.…
We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…
In this note, we revisit the $\Theta$-invariant as defined by R. Bott and the first author. The $\Theta$-invariant is an invariant of rational homology 3-spheres with acyclic orthogonal local systems, which is a generalization of the 2-loop…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
We introduce the notion of porous invariants for multipath (or branching/nondeterministic) affine loops over the integers; these invariants are not necessarily convex, and can in fact contain infinitely many 'holes'. Nevertheless, we show…
We provide a complete system of invariants for the formal classification of complex analytic unipotent germs of diffeomorphism at $\cn{n}$ fixing the orbits of a regular vector field. We reduce the formal classification problem to solve a…
The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…
In the first part of this paper, we propose a uniform interpretation of characteristic classes as obstructions to the reduction of the structure group and to the existence of an equivariant extension of a certain homomorphism defined a…
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and equitable partitions, but it does not preserve others like…
In a recent paper, Dave Benson and Peter Symonds defined a new invariant $\gamma_G(M)$ for a finite dimensional module $M$ of a finite group $G$ which attempts to quantify how close a module is to being projective. In this paper, we…