Related papers: Twisting cubic rabbits
In this note, we use a toy problem of detecting cycles of length two in a tent map to highlight some curious phenomena in the behavior of discrete dynamical systems. This work presents no new results or proofs, only computer experiments and…
A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…
By using a notion of a geometric Dehn twist in $\sharp_k(S^2 \times S^1)$, we prove that when projections of two $\mathbb{Z}$-splittings to the free factor complex are far enough from each other in the free factor complex, Dehn twist…
We define the twisted doubling zeta integrals of Cai-Friedberg-Ginzburg-Kaplan in the setting of algebraic families. We then prove a rationality result and a functional equation for these zeta integrals. This allows us to define an…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
The theory of Hubbard trees provides an effective classification of non-linear post-critically finite polynomial maps from \C to itself. This note will extend this classification to the case of maps from a finite union of copies of \C to…
This paper contains two topics, the index of a power subgroup in the mapping class group $\mathcal{M}(0,2n)$ of a $2n$-punctured sphere and in the hyperelliptic mapping class group $\Delta(g,0)$ of an oriented closed surface of genus $g$.…
We introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard even if the family of feasible solutions has a very simple…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We study central extensions E of elementary abelian 2-groups by elementary abelian 2-groups. Associated to such an extension is a quadratic map which determines the extension uniquely. The components of the map determine a quadratic ideal…
In this article, we investigate the possible torsion subgroups of twists of abelian varieties with good reduction. As an application, we prove a theorem concerning ramified primes over any quadratic extension where odd-order torsion growth…
We introduce a certain class of link diagrams, which includes all closed braid diagrams. We show a generalized version of K\'alm\'an's full-twist formula for the HOMFLY polynomial in the class.
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
In this paper we apply the twisted Alexander polynomial to study the fibering and genus detecting problems for oriented links. In particular we generalize a conjecture of Dunfield, Friedl and Jackson on the torsion polynomial of hyperbolic…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…
We consider the universal family $E_n^d$ of superelliptic curves: each curve $\Sigma_n^d$ in the family is a $d$-fold covering of the unit disk, totally ramified over a set $P$ of $n$ distinct points; $\Sigma_n^d\hookrightarrow E_n^d\to…
Investigating a problem of B. Mohar, we show that every one-ended Hamiltonian cubic graph with end degree 3 contains a second Hamilton cycle. We also construct two examples showing that this result does not extend to give a third Hamilton…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…