Related papers: H\"older spiral arcs
The partial representation extension problem generalizes the recognition problem for classes of graphs defined in terms of vertex representations. We exhibit circular-arc graphs as the first example of a graph class where the recognition is…
Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…
In this article we investigate mixed polynomials and present conditions that can be applied on a specific class of polynomials in order to prove the existence of the Milnor Fibration, Milnor-L\^e Fibration and the equivalence between them.…
We define H{\"o}lder classes in the $L^p$ norm on a chord-arc curve in $\mathbb{R}^3$ and prove direct and inverse approximation theorems for functions from these classes by functions harmonic in a neighborhood of the curve. The…
We review the polynomial parameterization of classical knots and prove the analogous results for long $2$ knots. We also construct polynomial parameterizations for certain classes of knotted spheres (such as spun and twist spun of the…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…
We answer an open question in the theory of transducer degrees initially posed in [3], on the structure of polynomial transducer degrees, in particular the question of what degrees, if any, lie below the degree of $n^3$. Transducer degrees…
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…
We propose a general framework for geometric approximation of circular arcs by parametric polynomial curves. The approach is based on constrained uniform approximation of an error function by scalar polynomials. The system of nonlinear…
Poincare's classification of the dynamics of homeomorphisms of the circle is one of the earliest, but still one of the most elegant, classification results in dynamical systems. Here we generalize this to quasiperiodically forced circle…
A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…
We prove that if a compact set E in complex Euclidean space is contained in an arc J, then there is a choice of J whose polynomial hull is the union of J and the polynomial hull of E. This strengthens an earlier result of the author. We…
We present higher dimensional versions of the classical results of Euler and Fuss, both of which are special cases of the celebrated Poncelet porism. Our results concern polytopes, specifically simplices, parallelotopes and cross polytopes,…
We provide a topological characterization of quivers whose path algebra satisfies a polynomial identity. This class includes the oriented cycle and acyclic quivers and, in the latter case, we describe the associated T-ideal. We introduce a…
We examine the problem of the Fourier transform mapping one weighted Lebesgue space into another, by studying necessary conditions and sufficient conditions which expose an underlying geometry. In the necessary conditions, this geometry is…
In this paper, applying a canonical system with field rotation parameters and using geometric properties of the spirals filling the interior and exterior domains of limit cycles, we solve first the problem on the maximum number of limit…
For a hypergraph $\mathcal H$, we consider the edge-induced and vertex-induced subhypergraph polynomials and study their relation. We use this relation to prove that both polynomials are reconstructible, and to prove a theorem relating the…
We propose a novel class of spirals that are based on perfect polygonal formations. The spirals are defined by a fractal of right triangles that delineate their geometry and determine their progression rates and modes. We show how these…
The most elusive problem around the class of circular-arc graphs is identifying all minimal graphs that are not in this class. The main obstacle is the lack of a systematic way of enumerating these minimal graphs. McConnell [FOCS 2001]…
Elementary complex analysis and Hilbert space methods show that a union of at most n arcs on the circle is uniquely determined by the nth Fourier partial sum of its characteristic function. The endpoints of the arcs can be recovered from…