Related papers: A graphite-prism definition for Avogadro's "intege…
Fixing the value of Avogadro's constant, the number of atoms in 12 grams of carbon-12, at exactly 84446886^3 would imply that one gram is the mass of exactly 18x14074481^3 carbon-12 atoms. This new definition of the gram, and thereby also…
New results are reported from an ongoing international research effort to accurately determine the Avogadro constant by counting the atoms in an isotopically enriched silicon crystal. The surfaces of two 28Si-enriched spheres were…
The Avogadro constant links the atomic and the macroscopic properties of matter. Since the molar Planck constant is well known via the measurement of the Rydberg constant, it is also closely related to the Planck constant. In addition, its…
The face-centered cubic grid is a three dimensional 12-regular infinite grid. This graph represents an optimal way to pack spheres in the three-dimensional space. In this grid, the vertices represent the spheres and the edges represent the…
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into Gamma_f, the f-dimensional Fibonacci cube. We give bounds on the Fibonacci dimension of a graph in terms of…
Crystal structures are characterized by atomic bases within a primitive unit cell that repeats along a regular lattice throughout 3D space. The periodic and infinite nature of crystals poses unique challenges for geometric graph…
Crystallographic defects play a key role in determining the properties of crystalline materials. The new class of two-dimensional materials, foremost graphene, have enabled atomically resolved studies of defects, such as vacancies, grain…
We develop a picture of graphenic crystallites within disordered carbons that goes beyond the traditional model of graphitic platelets at random orientation. Using large atomistic models containing one million atoms, we redefine the meaning…
Let $G(V,E)$ be a simple, undirected graph where $V$ is the set of vertices and $E$ is the set of edges. A $b$-dimensional cube is a Cartesian product $I_1\times I_2\times...\times I_b$, where each $I_i$ is a closed interval of unit length…
Advantages and disadvantages of fixation of fundamental physical constants' values for definition of SI units are considered. The case with a new definition of the mass unit on the base of a fixed value of the Avogadro constant is studied…
In this paper, it is proved that, for $\gamma\in(\frac{317}{320},1)$, every sufficiently large odd integer can be written as the sum of nine cubes of primes, each of which is of the form $[n^{1/\gamma}]$. This result constitutes an…
To constitute atoms of a $\sigma$ algebra is not a easy task due to the large number of its elements. However, determining them via generators seems a feasible and simple way since most $\sigma$ algebras are generated by their smaller…
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…
It is shown that atom interferometry allows for the construction of MIGO, the Matter-wave Interferometric Gravitational-wave Observatory. MIGOs of the same sensitivity as LIGO or LISA are expected to be orders of magnitude smaller than…
Let $\Gamma=(V,E)$ be a simple connected graph. A vertex $a$ is said to recognize (resolve) two different elements $b_{1}$ and $b_{2}$ from $V(\Gamma)\cup E(\Gamma)$ if $d(a, b_{1})\neq d(a, b_{2}\}$. A subset of distinct ordered vertices…
A non-negative integer invariant, estimating from below the number of geometrically different critical points of a smooth function $f$ defined in the 2-disk, $f:\mathbb{B}^{2}\rightarrow\mathbb{R}$, is considered. (We denote it by…
The construction of atomically-precise carbon nanostructures holds promise for developing novel materials for scientific study and nanotechnology applications. Here we show that graphene origami is an efficient way to convert graphene into…
A connected graph G is matching covered if every edge lies in some perfect matching of G. Lovasz proved that every matching covered graph G can be uniquely decomposed into a list of bricks (nonbipartite) and braces (bipartite) up to…
A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…
For any fixed surface Sigma of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Sigma is colorable from an assignment of lists of size three in time O(|V(G)|). Furthermore, we can allow a subgraph…