Related papers: A characterization of chains in dimension three
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…
The main result of this paper is that the identity component of the automorphism group of a compact, connected, strictly pseudoconvex CR manifold is compact unless the manifold is CR equivalent to the standard sphere. In dimensions greater…
A chain of evolution algebras (CEA) is an uncountable family (depending on time) of evolution algebras on the field of real numbers. The matrix of structural constants of a CEA satisfies Kolmogorov-Chapman equation. In this paper, we…
In this work, we show that for a certain class of threefolds in positive characteristics, rational-chain-connectivity is equivalent to supersingularity. The same result is known for K3 surfaces with elliptic fibrations. And there are…
We classify compact manifolds of dimension three equipped with a path structure and a fixed contact form (which we refer to as a strict path structure) under the hypothesis that their automorphism group is non-compact. We use a Cartan…
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…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis, and have been used…
We generalise the notion of contact manifold by allowing the contact distribution to have codimension two. There are special features in dimension six. In particular, we show that the complex structure on a three-dimensional complex contact…
We determine which 3-manifolds admit a unitary representation such that the corresponding twisted chain complex is acyclic.
Metric dimensions and metric basis are graph invariants studied for their use in locating and indexing nodes in a graph. It was recently established that for bicyclic graph of type-III ($\Theta $-graphs), the metric dimension is $3$ only,…
Let $G$ be a finite solvable group and let $\Delta(G)$ be the character degree graph of $G$. In this paper, we obtain the metric dimension of certain character degree graphs. Specifically, we calculate the metric dimension for a regular…
The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a…
Using an explicit family of plane quartic curves, we prove the existence of a genus 3 curve over any finite field of characteristic 3 whose number of rational points stays within a fixed distance from the Hasse-Weil-Serre upper bound. We…
Motivated by the Shilov boundaries of bounded symmetric domains we consider arbitrary CR-quadrics in a complex linear space (of finite dimension) that have a certain symmetry property. For these the non-affine local CR-automorphisms have a…
This article investigates the connectivity dimension of a graph. We introduce this concept in analogy to the metric dimension of a graph, providing a graph parameter that measures the heterogeneity of the connectivity structure of a graph.…