Related papers: An explicit formula for the number of tunnels in d…
Light can be transmitted through disordered media with high efficiency due to the existence of open channels, but quantitative agreement with theory is difficult to obtain because of the large number of channels to control. By measuring, by…
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…
Obtaining complete information about the shape of an object by looking at it from a single direction is impossible in general. In this paper, we theoretically study obtaining differential geometric information of an object from orthogonal…
In this paper the number of ways to glue a surface of genus $g$ has been investigated. We've proven formulas for the number of gluings sphere from three polygons and from two bicolored polygons. Moreover, we've given a new proofs on the…
How much time does a tunneling wave packet spent in traversing a barrier? Quantum mechanical calculations result in zero time inside a barrier . In the nineties analogous tunneling experiments with microwaves were carried out. The results…
Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel…
The quantum mechanical tunneling through multiple quantum barriers is a long-standing and well-known problem. Three methods proposed earlier to calculate the tunneling probabilities and energy splitting: (1). Instanton Method (2) WKb…
Quantum tunneling, a phenomenon which has no counterpart in classical physics, is the quantum-mechanical process by which a microscopic particle can transition through a potential barrier even when the energy of the incident particle is…
We introduce one dimensional sets to help describe and constrain the integral curves of an $n$ dimensional dynamical system. These curves provide more information about the system than the zero-dimensional sets (fixed points) do. In fact,…
The complex-time method for quantum tunneling is studied. In one-dimensional quantum mechanics, we construct a reduction formula for a Green function in the number of turning points based on the WKB approximation. This formula yields a…
Recently, the work on quantum automorphism groups of graphs has seen renewed progress, which we expand in this paper. Quantum symmetry is a richer notion of symmetry than the classical symmetries of a graph. In general, it is non-trivial to…
In a previous paper the authors defined the growth rate of the tunnel number of knots, an invariant that measures that asymptotic behavior of the tunnel number under connected sum. In this paper we calculate the growth rate of the tunnel…
A basic problem in quantizing a field in curved space is the decomposition of the classical modes in positive and negative frequency. The decomposition is equivalent to a choice of a complex structure in the space of classical solutions. In…
We present some algorithms that provide useful topological information about curves in surfaces. One of the main algorithms computes the geometric intersection number of two properly embedded 1-manifolds $C_1$ and $C_2$ in a compact…
We construct immersions of trivalent abstract tropical curves in the Euclidean plane and embeddings of all abstract tropical curves in higher dimensional Euclidean space. Since not all curves have an embedding in the plane, we define the…
We use path-integrals to derive a general expression for the semiclassical approximation to the partition function of a one-dimensional quantum-mechanical system. Our expression depends solely on ordinary integrals which involve the…
Clustering is an unsupervised technique of Data Mining. It means grouping similar objects together and separating the dissimilar ones. Each object in the data set is assigned a class label in the clustering process using a distance measure.…
In this paper we give a mathematical model for a game that we call picture cube puzzle and investigate its properties. The central question is the number of moves required to solve the puzzle. A mathematical discussion is followed by the…
In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the…
We study the tunneling through an arbitrary number of finite rectangular opaque barriers and generalize earlier results by showing that the total tunneling phase time depends neither on the barrier thickness nor on the inter-barrier…