Related papers: Polygons in three-dimensional space

For two non-congruent regular polygons of the same type, the method of finding the points in the plane at the equal distances to the vertices, is established. The existence of two points with this property is proved for two polygons with a…

According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…

This is a study of the construction of particular regular sub-n-gons T in regular n-gons P using a special system of chords of P. In particular, some of these sub-n-gons have areas which are integer divisors of the area of the given n-gon…

In this paper, we establish more properties of generalized poly-Euler polynomials with three parameters and we investigate a kind of symmetrized generalization of poly- Euler polynomials. Moreover, we introduce a more general form of multi…

In the present paper we propose generalizations of the regularity and counting lemmas for multidimensional matrices under a finite alphabet. Firstly, we prove a variant of a multidimensional regularity lemma with the help of a translation…

Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…

Bosse et al. conjectured that for every natural number $d \ge 2$ and every $d$-dimensional polytope $P$ in $\real^d$ there exist $d$ polynomials $p_0(x),...,p_{d-1}(x)$ satisfying $P=\{x \in \mathbb{R}^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge…

We consider the curves whose all normal planes are at the same distance from a fixed point and obtain some characterizations of them in the 3-dimensional Euclidean space.

In this work we present a full geometric characterization of the 1-dimensional polynomial and regular images $S$ of $\R^n$ and we compute for all of them the invariants ${\rm p(S)}$ and ${\rm r}(S)$, already introduced in \cite{fg2}.

Let $S$ be a set of $n$ points in the Euclidean plane and general position i.e., no three points are collinear. An \emph{at most $k$-out polygon of $S$} is a simple polygon such that each vertex is a point in $S$ and there are at most $k$…

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…

Let $\mathbb F$ denote a field and let $V$ denote a vector space over $\mathbb F$ with finite positive dimension. We consider a pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfies the following conditions: (i) each of…

On a smooth complex projective variety $X$ of dimension $n$, consider an ample vector bundle $\mathcal{E}$ of rank $r \leq n-2$ and an ample line bundle $H$. A numerical character $m_2=m_2(X,\mathcal{E},H)$ of the triplet…

In this paper we prove regularity results for a class of nonlinear degenerate elliptic equations of the form $\displaystyle -\operatorname{div}(A(|\nabla u|)\nabla u)+B\left( |\nabla u|\right) =f(u)$; in particular, we investigate the…

A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two…

A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$,…

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…

A concept of generalized regular polytope is introduced in this work. The number of its (1...n-1)-dimensional elements is not necessarily integer, though all the combinatorial and metric properties meet those of regular polytopes in a…

We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…

Induced by three gluons symmetry, Mandelstam variables $s$, $t$, $u$ symmetric expressions are widely involved in collider physics, especially in heavy quarkonium physics. In this work we study general form of $s$, $t$, $u$ symmetric…