Related papers: The farthest point map on the 4-cube

We contribute a new algebraic method for computing the orthogonal projections of a point onto a rational algebraic surface embedded in the three dimensional projective space. This problem is first turned into the computation of the finite…

For the class of differentiable maps of the plane and, in particular, for standard-like maps (McMillan form), a simple relation is shown between the directions of the local invariant manifolds of a generic point and its contribution to the…

Let $f:\mathbb{P}^1\rightarrow\mathbb{P}^1$ be a quadratic rational map defined over the rational field $\mathbb{Q}$ with nonabelian automorphism group. We prove that no such map has a $\mathbb{Q}$-rational periodic point with exact period…

In this note, we give a description of rational maps from the open unit disc $\mathbb{D}$ to the pentablock that map the boundary of $\mathbb{D}$ to the distinguished boundary of the pentablock. We also obtain a new characterization of the…

The period map for cubic fourfolds takes values in a locally symmetric variety of orthogonal type of dimension 20. We determine the image of this period map (thus confirming a conjecture of Hassett) and give at the same time a new proof of…

A 4-regular matchstick graph is a planar unit-distance graph whose vertices have all degree 4. Examples of 4-regular matchstick graphs are currently known for all number of vertices $\geq$ 52 except for 53, 55, 56, 58, 59, 61, and 62. In…

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…

Let $\Sigma$ be a finite alphabet, $\Omega=\Sigma^{\mathbb{Z}^{d}}$ equipped with the shift action, and $\mathcal{I}$ the simplex of shift-invariant measures on $\Omega$. We study the relation between the restriction $\mathcal{I}_n$ of…

In the Matching Cut problem we ask whether a graph $G$ has a matching cut, that is, a matching which is also an edge cut of $G$. We consider the variants Perfect Matching Cut and Disconnected Perfect Matching where we ask whether there…

A parametric manifold can be viewed as the manifold of orbits of a (regular) foliation of a manifold by means of a family of curves. If the foliation is hypersurface orthogonal, the parametric manifold is equivalent to the 1-parameter…

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

The Hirsch Conjecture stated that any $d$-dimensional polytope with n facets has a diameter at most equal to $n - d$. This conjecture was disproved by Santos (A counterexample to the Hirsch Conjecture, Annals of Mathematics, 172(1) 383-412,…

We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.

A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…

Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their…

Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…

The aim of this paper is the determination of the largest $n$-dimensional polytope with $n+3$ vertices of unit diameter. This is a special case of a more general problem proposed by Graham.

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…

For a finite set of points $X$ on the unit hypersphere in $\mathbb{R}^d$ we consider the iteration $u_{i+1}=u_i+\chi_i$, where $\chi_i$ is the point of $X$ farthest from $u_i$. Restricting to the case where the origin is contained in the…