Related papers: Extremal Cylinder Configurations I: Configuration …
We study the octahedral configurations $O_6$ of six equal cylinders touching the unit sphere. We show that the configuration $O_6$ is a local sharp maximum of the distance function. Thus it is not unlockable and, moreover, rigid.
Motivated by a question of W. Kuperberg, we study the 18-dimensional manifold of configurations of 6 non-intersecting infinite cylinders of radius $r,$ all touching the unit ball in $\mathbb{R}^{3}.$ We find a configuration with \[…
This paper consists of two related parts. In the first part we give a self-contained proof of homological stability for the spaces C_n(M;X) of configurations of n unordered points in a connected open manifold M with labels in a…
In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem…
The configuration space $\mathcal{C}^n(X)$ of an algebraic curve $X$ is the algebraic variety consisting of all $n$-point subsets $Q\subset X$. We describe the automorphisms of $\mathcal{C}^n(\mathbb{C})$, deduce that the (infinite…
Cyclic codes are an important subclass of linear codes with wide applications in communication systems and data storage systems. In 2013, Ding and Helleseth presented nine open problems on optimal ternary cyclic codes $\mathcal{C}_{(1,e)}$.…
We study packings of $n$ hard spheres of equal radius in the $d$-dimensional unit cube. We present a nonsmooth function whose local extrema are the radii of jammed packings (where no subset of spheres can be moved keeping all others fixed)…
We provide a complete classification of possible configurations of mutually pairwise touching infinite cylinders in Euclidian 3D space. It turns out that there is a maximum number of such cylinders possible in 3D independently on the shape…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let $m=2\ell+1$ for an integer $\ell\geq 1$…
We show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to stationarity of order $1$),…
For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…
We prove that any region $\Gamma$ in a homogeneous $n$-dimensional and locally compact separable metric space $X$, where $n\geq 2$, cannot be irreducibly separated by a closed $(n-1)$-dimensional subset $C$ with the following property: $C$…
It is shown that there is a computable conformal map of the unit disk onto a domain $D$ that has a computable extension to the closure of the unit disk even though the boundary of $D$ is not effectively locally connected. The proof encodes…
In this paper we consider an extremal problem in geometry. Let $\lambda$ be a real number and $A$, $B$ and $C$ be arbitrary points on the unit circle $\Gamma$. We give full characterization of the extremal behavior of the function…
On a 6-dimensional, conformal, oriented, compact manifold $M$ without boundary, we compute a whole family of differential forms $\Omega_6(f,h)$ of order 6, with $f,h \in C^\infty(M).$ Each of these forms will be symmetric on $f,$ and $h,$…
The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq…
For a simple-root $\lambda$-constacyclic code $\mathcal{C}$ over $\mathbb{F}_q$, let $\langle\rho\rangle$ and $\langle\rho,M\rangle$ be the subgroups of the automorphism group of $\mathcal{C}$ generated by the cyclic shift $\rho$, and by…
We study the optimal packing of hard spheres in an infinitely long cylinder, using simulated annealing, and compare our results with the analogous problem of packing disks on the unrolled surface of a cylinder. The densest structures are…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…