Related papers: Some contributions to Regular Polygons
By using Moreau's decomposition theorem for projecting onto cones, the problem of projecting onto a simplicial cone is reduced to finding the unique solution of a nonsmooth system of equations. It is shown that a semi-smooth Newton method…
We discuss a method for constructing multiplicative connections on proper Lie groupoids or, more exactly, for reducing the task of constructing such connections to a number of in principle simpler tasks involving only Lie groupoids that are…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…
We consider the problem of existence of polynomials with small norm. This range of problems has been extensively studied by many authors in the case of the unit circle (or a compact Abelian group), i.e. when the characters are bounded. In…
We study the $p$-adic absolute value of the roots of the $L$-functions associated to certain twisted character sums, and additive character sums associated to polynomials $P(x^d)$, when $P$ varies among the space of polynomial of fixed…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
We give an overview of the constrained Willmore problem and address some conjectures arising from partial results and numerical experiments. Ramifications of these conjectures would lead to a deeper understanding of the Willmore functional…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…
We discuss a procedure to simplify the Landau potential, based on Michel's reduction to orbit space and Poincar\'e normalization procedure; and illustrate it by concrete examples. The method makes use, as in Poincar\'e theory, of a chain of…
The change of conformal moduli of polygonal quadrilaterals under some geometric transformations is studied. We consider the motion of one vertex when the other vertices remain fixed, the rotation of sides, polarization, symmetrization, and…
We show a possibility to apply certain philosophical concepts to the analysis of concrete mathematical structures. Such application gives a clear justification of topological and geometric properties of considered mathematical objects.
Fix an integer n>=1. Suppose that a simple polygon is the union of n triangles whose vertices along the common boundary are arranged cyclically. How many sides can such a union -- to be called regular -- have at most? This gives OEIS…
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such…
In this paper we consider the existence and regularity problem for Coulomb frames in the normal bundle of two-dimensional surfaces with higher codimension in Euclidean spaces. While the case of two codimensions can be approached directly by…
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
We consider a class of optimization problems that involve determining the maximum value that a function in a particular class can attain subject to a collection of difference constraints. We show that a particular linear programming…
A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…
The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…
We consider various inequalities for polynomials, with an emphasis on the most fundamental inequalities of approximation theory. In the sequel a key role is played by the generalized Minkowski functional \alpha(K,x), already being used by…