Related papers: A Note on Affinely Regular Polygons
We provide a definitive classification of all finite sets of regular polygons that admit a tiling of the hyperbolic plane, thereby establishing the decidability of the Domino Problem for this class of prototiles. We show that admissibility…
This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…
We investigate graded retracts of polytopal algebras (essentially the homogeneous rings of affine cones over projective toric varieties) as polytopal analogues of vector spaces. In many cases we show that these retracts are again polytopal…
Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…
We study complements of hypersurfaces in schemes with respect to the property being affine.
For a polygon $x=(x_j)_{j\in \mathbb{Z}}$ in $\mathbb{R}^n$ we consider the midpoints polygon $(M(x))_j=\left(x_j+x_{j+1}\right)/2\,.$ We call a polygon a soliton of the midpoints mapping $M$ if its midpoints polygon is the image of the…
A special linear Lie group over the real number field and the quarternion field admits a projectivley flat affine connection. We show that parabolic subgroups are autoparallel submanifolds and give a criterion the induced connection is…
We define $(\alpha_n)$ -regular sets in uniformly perfect metric spaces. This definition is quasisymmetrically invariant and the construction resembles generalized dyadic cubes in metric spaces. For these sets we then determine the…
Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics,…
One may associate several frames to a given polytope, such as its collection of vertices, edges, or facet normal vectors. In this note, we use these frames to generate geometric inequalities for the simplex in $\mathbb{R}^d$ and polytopes…
Regular polygons are characterized as area-constrained critical points of the perimeter functional with respect to particular families of perturbations in the class of polygons with a fixed number of sides. We also review recent results in…
We give an explicit formula for the motivic integrals related to the Milnor number over spaces of parametrised arcs on the plane with fixed tangency orders with the axis. These integrals are rational functions of the parameters and the…
A few formulas and theorems for statistical structures are proved. They deal with various curvatures as well as with metric properties of the cubic form or its covariant derivative. Some of them generalize formulas and theorems known in the…
We give a completely normal element in the maximal real subfield of a cyclotomic field over the field of rational numbers, which is different from that of Okada. This result is a consequence of the criterion for a normal element developed…
We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…
We consider two number-theoretic problems arising from Fuglede's spectral set conjecture: characterizing finite sets that tile integers, and finding polynomials with (0,1) coefficients whose roots have a certain multiplicative structure. We…
Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.
For two general polytopal complexes the set of face-wise affine maps between them is shown to be a polytopal complex in an algorithmic way. The resulting algorithm for the affine hom-complex is analyzed in detail. There is also a natural…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
We use a non-linear characterization of orthonormal polynomials due to Saff in order to show that the behavior of orthonormal polynomials is determined only by its leading coefficient and its normalization. Several applications of this…