Related papers: Determining Generic Point Configurations From Unla…
We introduce a recursive method to deconstruct the automorphism group of an ordered set. By connecting this method with deep results for permutation groups, we prove the Automorphism Conjecture for ordered sets of width less than or equal…
Recent work argued that the scaling of a dimensionless quantity $Q_D$ with path length is a better proxy for quantifying the scaling of the computational cost of maintaining adiabaticity than the timescale. It also conjectured that…
Bifurcations of the $A_{n}$ type in Arnold's classification, in non-autonomous $p$-periodic difference equations generated by parameter depending families with $p$ maps, are studied. It is proved that the conditions of degeneracy,…
Given a graph and two fixed vertices $s$ and $t$, the Replacement Path Problem (RP) is to compute for every edge $e$, the distance between $s$ and $t$ when $e$ is removed. There are two natural extensions to RP: (1) Single Source…
We consider isomorphism properties of infinite random geometric graphs defined over a variety of metrics. In previous work, it was shown that for $\mathbb{R}^n$ with the $L_{\infty}$-metric, the infinite random geometric graph is, with…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formula $C$, are well-known {\it NP}-complete problems. Here we…
Given a smooth family of unparameterized curves such that through every point in every direction there passes exactly one curve, does there exist a Lagrangian with extremals being precisely this family? It is known that in dimension 2 the…
A degree monotone path in a graph $G$ is a path $P$ such that the sequence of degrees of the vertices in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by $mp(G)$. This…
A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…
In this paper we consider two topological transforms that are popular in applied topology: the Persistent Homology Transform (PHT) and the Euler Characteristic Transform (ECT). Both of these transforms are of interest for their mathematical…
Applying robust optimization often requires selecting an appropriate uncertainty set both in shape and size, a choice that directly affects the trade-off between average-case and worst-case performances. In practice, this calibration is…
Let $G=\mathbf{Z}_{p} \oplus \mathbf{Z}_{p^2}$, where $p$ is a prime number. Suppose that $d$ is a divisor of the order of $G$. In this paper we find the number of automorphisms of $G$ fixing $d$ elements of $G$, and denote it by…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
In this paper we discuss a classical geometrical problem of estimating an unknown point's location in $\Real{n}$ from several noisy measurements of the Euclidean distances from this point to a set of known reference points (anchors). We…
The parameters of a $q$-ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been widely investigated in recent years. In this paper, we give a…
A path $P$ in a graph $G$ is said to be a degree monotone path if the sequence of degrees of the vertices of $P$ in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by…
Let $P(G)=(P_{0}(G),P_{1}(G),\cdots, P_{\rho}(G))$ be the path sequence of a graph $G$, where $P_{i}(G)$ is the number of paths with length $i$ and $\rho$ is the length of a longest path in $G$. In this paper, we first give the path…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…