Related papers: Geometric constructibility of cyclic polygons and …
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the…
Certain topics on polygons are extended from Euclidean to hyperbolic geometry. This first part deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The non-Euclidean versions are more difficult due to the…
A construction described by the current author (2017) uses two linear prototypes to build a compound graph with Ramsey properties inherited from the prototype graphs. The resulting graph is linear; and cyclic if both prototypes are cyclic.…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
A real projective orbifold is an $n$-dimensional orbifold modeled on $\mathbb{RP}^n$ with the group $PGL(n+1, \mathbb{R})$. We concentrate on an orbifold that contains a compact codimension $0$ submanifold whose complement is a union of…
We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…
This paper is purely expository. We present short elementary proofs of * the Gauss Theorem on constructibility of regular polygons; * the existence of a cubic equation unsolvable in real radicals; * the existence of a quintic equation…
An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…
In this paper, necessary and sufficient conditions for the reversibility of a cyclic code of arbitrary length over a finite commutative chain ring have been derived. MDS reversible cyclic codes having length p^s over a finite chain ring…
In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…
Our aim is to prove a Poncelet type theorem for a line configuration on the complex projective. More precisely, we say that a polygon with 2n sides joining 2n vertices A1, A2,..., A2n is well inscribed in a configuration Ln of n lines if…
In 1975, Erd\H{o}s asked the following natural question: What is the maximum number of edges that an $n$-vertex graph can have without containing a cycle with all diagonals? Erd\H{o}s observed that the upper bound $O(n^{5/3})$ holds since…
We settle 22 conjectures of Cohen about cyclic numbers (positive integers $n$ with $\gcd(n,\varphi(n))=1$), proving 16 and disproving 6, and we completely resolve a related OEIS problem about sequences whose running averages are Fibonacci…
We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…
Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…
A subspace of a finite field is called a Sidon space if the product of any two of its nonzero elements is unique up to a scalar multiplier from the base field. Sidon spaces, introduced by Roth et al. (IEEE Trans Inf Theory 64(6): 4412-4422,…
A small polygon is a polygon that has diameter one. The maximal perimeter of a convex equilateral small polygon with $n=2^s$ sides is not known when $s \ge 4$. In this paper, we construct a family of convex equilateral small $n$-gons,…
We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…
Given a convex $n$-gon, we can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with…
The purpose of this paper is to study the cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$. After providing the generator polynomial of cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$, we give the necessary and sufficient condition…