A distance on the equivalence classes of spherical curves generated by deformations of type RI

2018 ◽  
Vol 27 (12) ◽  
pp. 1850066 ◽  
Author(s):  
Yukari Funakoshi ◽  
Megumi Hashizume ◽  
Noboru Ito ◽  
Tsuyoshi Kobayashi ◽  
Hiroko Murai

In this paper, we introduce a distance [Formula: see text] on the equivalence classes of spherical curves under deformations of type RI and ambient isotopies. We obtain an inequality that estimate its lower bound (Theorem 1). In Theorem 2, we show that if for a pair of spherical curves [Formula: see text] and [Formula: see text], [Formula: see text] and [Formula: see text] and [Formula: see text] satisfy a certain technical condition, then [Formula: see text] is obtained from [Formula: see text] by a single weak RIII only. In Theorem 3, we show that if [Formula: see text] and [Formula: see text] satisfy other conditions, then [Formula: see text] is ambient isotopic to a spherical curve that is obtained from [Formula: see text] by a sequence of a particular local deformations, which realizes [Formula: see text].

2018 ◽  
Vol 29 (02) ◽  
pp. 315-329 ◽  
Author(s):  
Timothy Ng ◽  
David Rappaport ◽  
Kai Salomaa

The neighbourhood of a language [Formula: see text] with respect to an additive distance consists of all strings that have distance at most the given radius from some string of [Formula: see text]. We show that the worst case deterministic state complexity of a radius [Formula: see text] neighbourhood of a language recognized by an [Formula: see text] state nondeterministic finite automaton [Formula: see text] is [Formula: see text]. In the case where [Formula: see text] is deterministic we get the same lower bound for the state complexity of the neighbourhood if we use an additive quasi-distance. The lower bound constructions use an alphabet of size linear in [Formula: see text]. We show that the worst case state complexity of the set of strings that contain a substring within distance [Formula: see text] from a string recognized by [Formula: see text] is [Formula: see text].


Author(s):  
Prasad Mangalaramanan

This paper demonstrates the limitations of repeated elastic finite element analyses (REFEA) based limit load determination that uses the classical lower bound theorem. The r-node method is prescribed as an alternative for obtaining better limit load estimates. Lower bound aspects pertaining to r-nodes are also discussed.


2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Gábor Hetyei

International audience We introduce the short toric polynomial associated to a graded Eulerian poset. This polynomial contains the same information as Stanley's pair of toric polynomials, but allows different algebraic manipulations. Stanley's intertwined recurrence may be replaced by a single recurrence, in which the degree of the discarded terms is independent of the rank. A short toric variant of the formula by Bayer and Ehrenborg, expressing the toric h-vector in terms of the cd-index, may be stated in a rank-independent form, and it may be shown using weighted lattice path enumeration and the reflection principle. We use our techniques to derive a formula expressing the toric h-vector of a dual simplicial Eulerian poset in terms of its f-vector. This formula implies Gessel's formula for the toric h-vector of a cube, and may be used to prove that the nonnegativity of the toric h-vector of a simple polytope is a consequence of the Generalized Lower Bound Theorem holding for simplicial polytopes. Nous introduisons le polynôme torique court associé à un ensemble ordonné Eulérien. Ce polynôme contient la même information que le couple de polynômes toriques de Stanley, mais il permet des manipulations algébriques différentes. La récurrence entrecroisée de Stanley peut être remplacée par une seule récurrence dans laquelle le degré des termes écartés est indépendant du rang. La variante torique courte de la formule de Bayer et Ehrenborg, qui exprime le vecteur torique d'un ensemble ordonné Eulérien en termes de son cd-index, est énoncée sous une forme qui ne dépend pas du rang et qui peut être démontrée en utilisant une énumération des chemins pondérés et le principe de réflexion. Nous utilisons nos techniques pour dériver une formule exprimant le vecteur h-torique d'un ensemble ordonné Eulérien dont le dual est simplicial, en termes de son f-vecteur. Cette formule implique la formule de Gessel pour le vecteur h-torique d'un cube, et elle peut être utilisée pour démontrer que la positivité du vecteur h-torique d'un polytope simple est une conséquence du Théorème de la Borne Inférieure Généralisé appliqué aux polytopes simpliciaux.


2019 ◽  
Vol 38 (5) ◽  
pp. 197-204
Author(s):  
M. Lellis Thivagar ◽  
V. Sutha Devi

Lattice is a partially ordered set in which all finite subsets have a least upper bound and greatest lower bound. Dedekind worked on lattice theory in the 19th century. Nano topology explored by Lellis Thivagar et.al. can be described as a collection of nano approximations, a non-empty finite universe and empty set for which equivalence classes are buliding blocks. This is named as Nano topology, because of its size and what ever may be the size of universe it has atmost five elements in it. The elements of Nano topology are called the Nano open sets. This paper is to study the nano topology within the context of lattices. In lattice, there is a special class of joincongruence relation which is defined with respect to an ideal. We have defined the nano approximations of a set with respect to an ideal of a lattice. Also some properties of the approximations of a set in a lattice with respect to ideals are studied. On the other hand, the lower and upper approximations have also been studied within the context various algebraic structures.


2020 ◽  
Vol 117 (28) ◽  
pp. 16181-16186
Author(s):  
Rocco Martinazzo ◽  
Eli Pollak

The Ritz upper bound to eigenvalues of Hermitian operators is essential for many applications in science. It is a staple of quantum chemistry and physics computations. The lower bound devised by Temple in 1928 [G. Temple,Proc. R. Soc. A Math. Phys. Eng. Sci.119, 276–293 (1928)] is not, since it converges too slowly. The need for a good lower-bound theorem and algorithm cannot be overstated, since an upper bound alone is not sufficient for determining differences between eigenvalues such as tunneling splittings and spectral features. In this paper, after 90 y, we derive a generalization and improvement of Temple’s lower bound. Numerical examples based on implementation of the Lanczos tridiagonalization are provided for nontrivial lattice model Hamiltonians, exemplifying convergence over a range of 13 orders of magnitude. This lower bound is typically at least one order of magnitude better than Temple’s result. Its rate of convergence is comparable to that of the Ritz upper bound. It is not limited to ground states. These results complement Ritz’s upper bound and may turn the computation of lower bounds into a staple of eigenvalue and spectral problems in physics and chemistry.


Sign in / Sign up

Export Citation Format

Share Document