Related papers: Mating the Basilica with a Siegel Disk
We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…
Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…
A proof is sketched of the Polynomial Conjecture of the author (circulated as preprint "Brick Tiling and Monotone Boolean Functions", available at the http://www.math.ufl.edu/~squash/tilingstuff.html url) which says that the family of…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We study the Hilbert geometry induced by the Siegel disk domain, an open bounded convex set of complex square matrices of operator norm strictly less than one. This Hilbert geometry yields a generalization of the Klein disk model of…
We connect the algebraic geometry and representation theory associated to Freudenthal's magic square. We give unified geometric descriptions of several classes of orbit closures, describing their hyperplane sections and desingularizations,…
In this paper we present a geometric proof of the following fact. Let $D$ be a Jordan domain in $\mathbb{C}$, and let $f$ be analytic on $cl(D)$. Then there is an injective analytic map $\phi:D\to\mathbb{C}$, and a polynomial $p$, such that…
We study the pullback of the apolarity invariant of complex polynomials in one variable under a polynomial map on the complex plane. As a consequence, we obtain variations of the classical results of Grace and Walsh in which the unit disk,…
We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.
Matrices over the dual numbers are considered. We propose an approach to classify these matrices up to similarity. Some preliminary results on the realization of this approach are obtained. In particular, we produce explicitly canonical…
We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.
We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm.
An interesting problem in classical differential geometry is to find methods to prove that two surfaces defined by different charts actually coincide up to position in space. In a previous paper we proposed a method in this direction for…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
Positive and negative quadratic forms are well known and widely used. They are multivariate homogeneous polynomials of degree two taking positive or negative values respectively for any values of their arguments not all zero. In the present…
Zernike polynomials are widely used in optics and ophthalmology due to their direct connection to classical optical aberrations. While orthogonal on the unit disk, their application to discrete data or non-circular domains--such as…
We give a solvability criterion for a special case of the $\mu$-synthesis problem. That is, we prove the necessity and sufficiency of a condition for the existence of an analytic $2 \times 2$ matrix-valued function on the disc subject to a…
In this Note, we will characterize the Poisson structures compatible with the canonical metric of $\reel^3$. We will also give some relvant examples of such structures. The notion of compatibility used in this Note was introduced and…
Given a set of disks in the plane, the goal of the problem studied in this paper is to choose a subset of these disks such that none of its members contains the centre of any other. Each disk not in this subset must be merged with one of…
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…