Related papers: Some remarks on nmax(k) Diophantine n-gons

Let $f(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. The order of magnitude of $f(n,P_k)$, where $P_k$ is a path on $k$ vertices, is $n^{{\lfloor{\frac{k-1}{2}}\rfloor}+1}$. In this paper we determine the…

The polygon retrieval problem on points is the problem of preprocessing a set of $n$ points on the plane, so that given a polygon query, the subset of points lying inside it can be reported efficiently. It is of great interest in areas such…

In this paper, we solve the simultaneous Diophantine equations(SDE) x_1^u+...+x_n^u=k(y_1^u+...+y_{n/k}); u=1,3, where n >3, and k< n, is a divisor of n , and obtain nontrivial parametric solution for them. Furthermore we present a method…

This paper develops the metric theory of simultaneous inhomogeneous Diophantine approximation on a planar curve with respect to multiple approximating functions. Our results naturally generalize the homogeneous Lebesgue measure and Hausdor?…

In this paper, we consider the Diophantine equation $\lambda_1U_{n_1}+\ldots+\lambda_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2;…

The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…

In this paper we show that Diophantine problem for quadratic equations in Baumslag-Solitar groups $BS(1,k)$ and in wreath products $A \wr \mathbb{Z}$, where $A$ is a finitely generated abelian group and $\mathbb{Z}$ is an infinite cyclic…

The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…

In Diophantine approximation, inhomogeneous problems are linked with homogeneous ones by means of the so-called Transference Theorems. We revisit this classical topic by introducing new exponents of Diophantine approximation. We prove that…

The problem of maximising the number of cliques among $n$-vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of $1$-planar graphs where we determine precisely the maximum…

Given an undirected graph $G$, the Densest $k$-subgraph problem (DkS) asks to compute a set $S \subset V$ of cardinality $\left\lvert S\right\rvert \leq k$ such that the weight of edges inside $S$ is maximized. This is a fundamental NP-hard…

We begin to study model-theoretic properties of non-split isotropic reductive group schemes. In this paper we show that the base ring $K$ is e-interpretable in the point group $G(K)$ of every sufficiently isotropic reductive group scheme…

The well known theorems of Khintchine and Jarn\'ik in metric Diophantine approximation provide comprehensive description of the measure theoretic properties of real numbers approximable by rational numbers with a given error. Various…

When $k\ge 4$ and $0\le d\le (k-2)/4$, we consider the system of Diophantine equations \[ x_1^j+\ldots +x_k^j=y_1^j+\ldots +y_k^j\quad (1\le j\le k,\, j\ne k-d). \] We show that in this cousin of a Vinogradov system, there is a paucity of…

We explicitly construct a diffeomorphic pair (p(x),p^{-1}(x)) in terms of an appropriate quadric spline interpolating the prime series. These continuously differentiable functions are the smooth analogs of the prime series and the prime…

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

We consider a variation of the classical Erd\H{o}s-Szekeres problems on the existence and number of convex $k$-gons and $k$-holes (empty $k$-gons) in a set of $n$ points in the plane. Allowing the $k$-gons to be non-convex, we show bounds…

The main idea of this article is simply calculating integer functions in module. The algebraic in the integer modules is studied in completely new style. By a careful construction, a result is proven that two finite numbers is with unequal…

A variation on the classical polygon illumination problem was introduced in [Aichholzer et. al. EuroCG'09]. In this variant light sources are replaced by wireless devices called k-modems, which can penetrate a fixed number k, of "walls". A…

Let $\varphi_1,\ldots ,\varphi_r\in \mathbb Z[z_1,\ldots z_k]$ be integral linear combinations of elementary symmetric polynomials with $\text{deg}(\varphi_j)=k_j$ $(1\le j\le r)$, where $1\le k_1<k_2<\ldots <k_r=k$. Subject to the…