Related papers: Wronskians, cyclic group actions, and ribbon table…

We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…

We prove a new weak mean ergodic theorem (Theorem A) for 1-cocycles associated to weakly mixing representations of amenable groups. Let $G$ be a finitely generated, discrete, amenable group $G$ which admits a controlled Folner sequence. We…

Fibered Burnside rings appear as Grothendieck rings of fibered permutation representations of a finite group, generalizing Burnside rings and monomial representation rings. Their species, primitive idempotents and their conductors are of…

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…

Let R be a perfect F_p-algebra, equipped with the trivial norm. Let W(R) be the ring of p-typical Witt vectors over R, equipped with the p-adic norm. At the level of nonarchimedean analytic spaces (in the sense of Berkovich), we demonstrate…

For a fixed $r$, let $f_r(n)$ denote the minimum number of complete $r$-partite $r$-graphs needed to partition the complete $r$-graph on $n$ vertices. The Graham-Pollak theorem asserts that $f_2(n)=n-1$. An easy construction shows that…

For a wide class of groups including polycyclic and finitely generated polynomial growth groups it is proved that the Reidemeister number of an automorphism f is equal to the number of finite-dimensional fixed points of the induced map f^…

We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…

A $1-$factorization of a complete graph on $2n$ vertices is said to be $G-$regular if it posseses an automorphism group $G$ acting sharply transitively on the vertex-set. The problem of determining which groups can realize such a situation…

A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…

The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…

Let $k$ be a number field and $U$ a smooth integral $k$-variety. Let $X \to U$ be an abelian scheme. We consider the set $\mathcal{R}$ of rational points $m \in U(k)$ such that the Mordell-Weil rank of the fibre $U_{m}$ is strictly bigger…

In this work we use the bigonal, trigonal and tetragonal constructions to describe the fibers of the Prym map P : R_{g} ---->A_{g-1} inthe cases when it is dominant, i.e. for g < 7. The most interesting cases are g = 5, where the fiber is a…

The Wronskian determinants (for coefficients of higher-order differential operators on the affine real line or circle) satisfy the table of Jacobi-type quadratic identities for strong homotopy Lie algebras -- i.e. for a particular case of…

A combinatorial expression for the coefficient of the Schur function $s_{\lambda}$ in the expansion of the plethysm $p_{n/d}^d \circ s_{\mu}$ is given for all $d$ dividing $n$ for the cases in which $n=2$ or $\lambda$ is rectangular. In…

In this paper, we introduce the notions of $r$-fundamental groups of graphs, $r$-covering maps, and $r$-neighborhood complexes of graphs for a positive integer $r$. There is a natural correspondence between $r$-covering maps and…

Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…

We develop a general theory of Cartesian and non-Cartesian polynomials on products of complex spaces $\mathbb{C}^{n_1} \times \cdots \times \mathbb{C}^{n_k}$. We prove that, for any fixed degree $d \ge 2$, a (Zariski) generic polynomial is…

Wreath Macdonald polynomials arise from the geometry of $\Gamma$-fixed loci of Hilbert schemes of points in the plane, where $\Gamma$ is a finite cyclic group of order $r\ge 1$. For $r=1$, they recover the classical (modified) Macdonald…

The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…