Related papers: Trace-free ${\rm SL}(2,\mathbb{C})$-representation…
Working over a field of characteristic zero, we give structure theorems for all grade three licci ideals and their minimal free resolutions. In particular, we completely classify such ideals up to deformation. The descriptions of their…
We give an optimal-size representation for the elements of the trace zero subgroup of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field extension of any prime degree. The representation is via the…
An irreducible representation of the free group on two generators X,Y into SL(2,C) is determined up to conjugation by the traces of X,Y and XY. We study the diagonal slice of representations for which X,Y and XY have equal trace. Using the…
General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible…
We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…
A 2-tree is a graph that can be formed by starting with a triangle and iterating the operation of making a new vertex adjacent to two adjacent vertices of the existing graph. Leizhen Cai asked in 1995 whether every maximal planar graph…
We consider the symplectic representation $\rho_n$ of a braid group $B(n)$ in $Sp(2l,\mathbb{Z})$, for $l=\Big[\dfrac{n-1}{2}\Big]$. If $P$ is a polynomial on the $4l^2$ coefficients of the matrices in $Sp(2l,\mathbb{Z})$, we show that the…
Humans recognize object structure from both their appearance and motion; often, motion helps to resolve ambiguities in object structure that arise when we observe object appearance only. There are particular scenarios, however, where…
Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…
We describe a family of representations in SL(3,$\mathbb C$) of the fundamental group $\pi$ of the Whitehead link complement. These representations are obtained by considering pairs of regular order three elements in SL(3,$\mathbb C$) and…
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…
Two Seifert surfaces of links in $S^3$ are said to be twist equivalent if one can be obtained from the other, up to isotopy, by repeatedly performing operations consisting of cutting along an embedded arc, applying a full twist near one…
It is known that if a classical link group is a free abelian group, then its rank is at most two. It is also known that a $k$-component 2-link group ($k>1$) is not free abelian. In this paper, we give examples of $T^2$-links each of whose…
We classify SL(2;C)-representations of a Brieskorn homology 3-sphere. We show any irreducible representation into SL(2;C) is conjugate to that into either SU(2) or SL(2;R). We also give a construction of SL(2;R)-representations for a…
Let $T$ be a tree, we show that the null space of the adjacency matrix of $T$ has relevant information about the structure of $T$. We introduce the Null Decomposition of trees, and use it in order to get formulas for independence number and…
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each node v equal to 2{\pi}/d(v). We show: 1. Any unordered tree has a crossing-free straight-line drawing with perfect angular resolution and…
We prove the meridional rank conjecture for twisted links and arborescent links associated to bipartite trees with even weights. These links are substantial generalizations of pretzels and two-bridge links, respectively. Lower bounds on…
A \emph{$k$--bisection} of a bridgeless cubic graph $G$ is a $2$--colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes have order…
For a bridgeless cubic graph $G$, $m_3(G)$ is the ratio of the maximum number of edges of $G$ covered by the union of $3$ perfect matchings to $|E(G)|$. We prove that for any $r\in [4/5, 1)$, there exist infinitely many cubic graphs $G$…
We study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf…