Related papers: Combinatorial aspects of nodal curves
We construct a family of rings. To a plane diagram of a tangle we associate a complex of bimodules over these rings. Chain homotopy equivalence class of this complex is an invariant of the tangle. On the level of Grothendieck groups this…
We study the structure of various invariants of the symmetric powers of a smooth projective curve in terms of that of the Jacobian of the curve. We generalise the results of Macdonald and Collino to various invariants including the…
Globally irreducible nodes (i.e. nodes whose branches belong to the same irreducible component) have mild effects on the most common topological invariants of an algebraic curve. In other words, adding a globally irreducible node (simple…
We make a systematic study of the focal surface of a congruence of lines in the projective space. Using differential techniques together with techniques from intersection theory, we reobtain in particular all the invariants of the focal…
The paper investigates invariants of compactified Picard modular surfaces by principal congruence subgroups of Picard modular groups. The applications to the surface classification and modular forms are discussed.
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…
There is a natural conjugation action on the set of endomorphism of $\P^N$ of fixed degree $d \geq 2$. The quotient by this action forms the moduli of degree $d$ endomorphisms of $\P^N$, denoted $\mathcal{M}_d^N$. We construct invariant…
A notion of curvature is introduced in multivariable operator theory and an analogue of the Gauss-Bonnet-Chern theorem is established for graded (contractive) Hilbert modules over the complex polynomial algebra in d variables, d=1,2,3,....…
We study intersection theory on the relative Hilbert scheme of a family of nodal-or-smooth curves, over a base of arbitrary dimension. We introduce an additive group called 'discriminant module', generated by diagonal loci, node scrolls,…
In this paper, we introduce new combinatorial invariants of any finite simple graph, which arise in toric topology. We compute the $i$-th (rational) Betti number and Euler characteristic of the real toric variety associated to a graph…
We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…
We generalise the finite biquandle colouring invariant to a polynomial invariant based on labelling a knot diagram with a finite birack that reduces to the biquandle colouring invariant in that case. The polynomial is an invariant of a…
The Jacobian group (also known as the critical group or sandpile group) is an important invariant of a finite, connected graph $X$; it is a finite abelian group whose cardinality is equal to the number of spanning trees of $X$ (Kirchhoff's…
We analyze the weight diagram associated with foliations on the complex projective plane through the Hilbert-Mumford criterion in Geometric Invariant Theory, focusing in particular on invariants such as the algebraic multiplicity and the…
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…
A genus one curve of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We describe a general method for investigating the invariant theory of such models. We use it to explain how we found our…
In this paper we study probabilistic aspects such as subgroup commutativity degree and cyclic subgroup commutativity degree of the (generalized) dicyclic groups. We find explicit formulas for these concepts and we provide another example of…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
We study families of superelliptic curves with fixed automorphism groups. Such families are parametrized with invariants expressed in terms of the coefficients of the curves. Algebraic relations among such invariants determine the lattice…
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…