共查询到20条相似文献,搜索用时 0 毫秒
1.
Christopher K. Atkinson 《Geometriae Dedicata》2011,153(1):177-211
We give a method for computing upper and lower bounds for the volume of a non-obtuse hyperbolic polyhedron in terms of the combinatorics of the 1-skeleton. We introduce an algorithm that detects the geometric decomposition of good 3-orbifolds with planar singular locus and underlying manifold S 3. The volume bounds follow from techniques related to the proof of Thurston’s Orbifold Theorem, Schläfli’s formula, and previous results of the author giving volume bounds for right-angled hyperbolic polyhedra. 相似文献
2.
Guillaume Dufour 《Geometriae Dedicata》2010,147(1):277-282
We show that (finite volume) right-angled Coxeter polyhedra may exist in hyperbolic spaces only in dimension at most 12. This is a slight improvement on a theorem of Potyagailo and Vinberg stated in Potyagailo and Vinberg (Comment Math Helv 80:1–12, 2005). 相似文献
3.
Ruth Kellerhals 《Mathematische Annalen》1989,285(4):541-569
4.
Yosuke Miyamoto 《Geometriae Dedicata》1991,40(2):223-236
A truncated tetrahedron is a building block of hyperbolic 3-manifolds with totally geodesic boundary. We study the relation between the volume of a truncated tetrahedron and the area of its faces which form the boundary of manifolds. 相似文献
5.
In this paper we find conditions in order to construct hyperbolic right-angledN-gons with the lengths ofN-3 sides given.Explicit formulae for the length of a side in terms of the lengths ofN-3 non-adjacent sides are obtained.Partially supported by CICYT. 相似文献
6.
Vedran Šego 《Linear algebra and its applications》2010,433(7):1265-1275
In this paper, we propose the two-sided hyperbolic SVD (2HSVD) for square matrices, i.e., A=UΣV[∗], where U and V[∗] are J-unitary (J=diag(±1)) and Σ is a real diagonal matrix of “double-hyperbolic” singular values. We show that, with some natural conditions, such decomposition exists without the use of hyperexchange matrices. In other words, U and V[∗] are really J-unitary with regard to J and not some matrix which is permutationally similar to matrix J. We provide full characterization of 2HSVD and completely relate it to the semidefinite J-polar decomposition. 相似文献
7.
Potential theory on the complement of a subset of the real axis attracts much attention in both function theory and applied
sciences. This paper discusses one aspect of the theory — the logarithmic capacity of closed subsets of the real line. We
give simple but precise upper and lower bounds for the logarithmic capacity of multiple intervals and a lower bound valid
also for closed sets comprising an infinite number of intervals. Using some known methods to compute the exact values of capacity,
we demonstrate graphically how our estimates compare with them. The main machinery behind our results are the separating transformation
and dissymmetrization developed by V. N. Dubinin and a version of the latter due to K. Haliste, as well as some classical
symmetrization and projection results for the logarithmic capacity. The results of the paper improve some previous achievements
by A. Yu. Solynin and K. Shiefermayr. 相似文献
8.
This paper is concerned with the derivation of computable and guaranteed upper and lower bounds of the difference between
exact and approximate solutions of a boundary value problem for static Maxwell equations. Our analysis is based upon purely
functional argumentation and does not invoke specific properties of the approximation method. For this reason, the estimates
derived in the paper at hand are applicable to any approximate solution that belongs to the corresponding energy space. Such
estimates (also called error majorants of the functional type) have been derived earlier for elliptic problems. Bibliography:
24 titles. 相似文献
9.
10.
11.
12.
Two enzymes bound at opposite ends of a finite interval affect each other via activation and/or inhibition by their respective products. The local concentrations of the diffusing products, in the vicinity of the other enzyme, determines the rate of production by that enzyme of its product. A mathematical model (cf. Thames and Elster [J. Theor. Biol. 59 (1976), 415–427]) consists of linear diffusion equations coupled through unknown and nonlinear boundary conditions. When the (nonlinear) functions describing the boundary conditions have certain monotone properties it is shown that the boundary values can be found iteratively by means of convergent two sided bounds. Some results for reaction chains involving more that two enzymes are presented. 相似文献
13.
14.
John R. Parker 《Geometriae Dedicata》1995,57(3):223-234
We consider cyclic groupsG generated by an ellipto-parabolic isometry of complex hyperbolic space. We show that the Dirichlet fundamental polyhedron forG centred atz
0 has two faces ifz
0 is on the axis of the generator, otherwise it has infinitely many faces. 相似文献
15.
Krzysztof Koŀodziejczyk 《Monatshefte für Mathematik》1996,122(4):367-375
LetL
n be the lattice consisting of all pointsx inR
N such thatnx belongs to the fundamental latticeL
1 of points with integer coordinates. When the vertices of a polyhedronP inR
N are restricted to lie inL
1 there is a formula which relates the volume ofP to the numbers of points ofL
1,...,L
N in the interior and on the boundary ofP. The aim of this note is to show that the volume ofP can be determined only by means of the numbers of points ofL
1,...,L
N lying in the interior ofP and cannot be expressed by the numbers of points ofL
1,...,L
N lying on the boundary ofP. The latter numbers in turn can be used to compute to comopute the Euler characteristic of the boundary ofP. 相似文献
16.
Gil Kalai 《Discrete and Computational Geometry》1992,8(1):363-372
Let Δ(d, n) be the maximum diameter of the graph of ad-dimensional polyhedronP withn-facets. It was conjectured by Hirsch in 1957 that Δ(d, n) depends linearly onn andd. However, all known upper bounds for Δ(d, n) were exponential ind. We prove a quasi-polynomial bound Δ(d, n)≤n
2 logd+3.
LetP be ad-dimensional polyhedron withn facets, let ϕ be a linear objective function which is bounded onP and letv be a vertex ofP. We prove that in the graph ofP there exists a monotone path leading fromv to a vertex with maximal ϕ-value whose length is at most
.
This research was supported in part by a BSF grant, by a GIF grant, and by ONR-N00014-91-C0026. 相似文献
17.
We consider groups Γ generated by inversions in a pair of asymptotic complex hyperplanes in complex hyperbolic spaceH ? n . We show that there exists a Γ-invariant real hypersurfaceF ?H ? n such that the Dirichlet fundamental polyhedron for Γ centered at z0 has two sides (resp. infinitely many sides) if and only ifz 0 ∈F (resp.z 0 ?F). The Dirichlet regions are determined explicitly in terms of coordinates on Γ-invariant horospheres and the geometry ofH ? n is developed in terms of these horospherical coordinates. 相似文献
18.
This article presents an idea in the finite element methods (FEMs) for obtaining two-sided bounds of exact eigenvalues. This approach is based on the combination of nonconforming methods giving lower bounds of the eigenvalues and a postprocessing technique using conforming finite elements. Our results hold for the second and fourth-order problems defined on two-dimensional domains. First, we list analytic and experimental results concerning triangular and rectangular nonconforming elements which give at least asymptotically lower bounds of the exact eigenvalues. We present some new numerical experiments for the plate bending problem on a rectangular domain. The main result is that if we know an estimate from below by nonconforming FEM, then by using a postprocessing procedure we can obtain two-sided bounds of the first (essential) eigenvalue. For the other eigenvalues λl, l = 2, 3, …, we prove and give conditions when this method is applicable. Finally, the numerical results presented and discussed in the paper illustrate the efficiency of our method. 相似文献
19.
Peter Hall 《Probability Theory and Related Fields》1981,57(3):349-364
Summary We derive necessary and sufficient conditions for several characterizations of the rate of convergence of a sum of independent variables to a stable law. The technique used is to obtain upper and lower bounds on the rate in terms of functions depending in a very simple way on the common underlying distribution. This permits a general approach to the problem of rates of convergence. 相似文献
20.
Doklady Mathematics - 相似文献