首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Let be the space of all bounded linear operators on a Banach space X and let LatA be the lattice of invariant subspaces of the operator . We characterize some maps with one of the following preserving properties: Lat(Φ(A)+Φ(B))=Lat(A+B), or Lat(Φ(A)Φ(B))=Lat(AB), or Lat(Φ(A)Φ(B)+Φ(B)Φ(A))=Lat(AB+BA), or Lat(Φ(A)Φ(B)Φ(A))=Lat(ABA), or Lat([Φ(A),Φ(B)])=Lat([A,B]).  相似文献   

2.
We consider implicit nonlinear lattice equations modelling one-dimensional metamaterials formed by a discrete array of nonlinear split-ring resonators. We study the existence and bifurcation of localised excitations and use the results to prove the existence of periodic travelling waves in the presence of small damping and travelling drive. Two different systems are considered, with each of them admitting either homoclinic or heteroclinic solutions.  相似文献   

3.
The paper presents a short survey of stereological problems concerning dihedral angles, their solutions and applications, and introduces a graph for determining the distribution functions of planar angles under the hypothesis that dihedral angles in 3 are of the same size and create a random field.  相似文献   

4.
Let G be a connected reductive algebraic group over an algebraically closed field K of characteristic zero. Let G/B denote the complete flag variety of G. A G-homogeneous space G/H is said to be spherical if H has finitely many orbits in G/B. A class of spherical homogeneous spaces containing the tori, the complete homogeneous spaces and the group G (viewed as a G×G-homogeneous space) has particularly nice properties. Namely, the pair (G,H) is called a spherical pair of minimal rank if there exists x in G/B such that the orbit H.x of x by H is open in G/B and the stabilizer Hx of x in H contains a maximal torus of H. In this article, we study and classify the spherical pairs of minimal rank.  相似文献   

5.
6.
The Besson–Courtois–Gallot theorem is proven for noncompact finite volume Riemannian manifolds. In particular, no bounded geometry assumptions are made. This proves the minimal entropy conjecture for nonuniform rank one lattices. This research was partially supported by an NSF Postdoctoral Fellowship. Received: June 2004; Revision: January 2006; Accepted: March 2006  相似文献   

7.
《Discrete Mathematics》2023,346(5):113346
We derive upper and lower bounds on the sum of distances of a spherical code of size N in n dimensions when N=Θ(nα),0<α?2. The bounds are derived by specializing recent general, universal bounds on energy of spherical sets. We discuss asymptotic behavior of our bounds along with several examples of codes whose sum of distances closely follows the upper bound.  相似文献   

8.
LetG be a connected semisimple Lie group with finite center. Let be an irreducible non-uniform lattice inG. We show that if the real rank ofG is 2, then the Dehn (or filling) function of is exponential.  相似文献   

9.
10.
Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4baFfea0dXde9vqpa0lb9% cq0dXdb9IqFHe9FjuP0-iq0dXdbba9pe0lb9hs0dXda91qaq-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaacaWFTbGaa8% xAaiaa-5gacaWFPbGaa8xBaiaa-LgacaWF6bGaa8xzaiaa-bcacaWF% 7bacbiGaa43yamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+Hhaca% GFRaGaa4hzamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+LhacaGF% RaWaaabuaeaacaGFJbWaa0baaSqaaiaa+PgaaeaacaGF0baaaOGaam% iEaiabl+y6NjaadsgadaqhaaWcbaGaamOAaaqaaiaadshaaaGccaWG% 5bGaaiiFaaWcbaGaa8NAaiaa-1dacaWFXaaabeqdcqGHris5aOGaa4% hEaiabgIGiolaa+HfacaGFSaGaa4xEaiabgIGiolaa+LfacaWF9bGa% a8hlaaaa!5D2E!\[minimize \{ c_0^t x + d_0^t y + \sum\limits_{j = 1} {c_j^t xd_j^t y|} x \in X,y \in Y\} ,\]where X Rn1 and Y R n2 are non-empty and bounded polytopes. We show that a variant of parametric simplex algorithm can solve large scale rank two bilinear programming problems efficiently. Also, we show that a cutting-cake algorithm, a more elaborate variant of parametric simplex algorithm can solve medium scale rank three problems.This research was supported in part by Grant-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. 63490010.  相似文献   

11.
We compute the quasi-isometry group of an irreducible nonuniform lattice in a semisimple Lie group with finite center and no rank one factors, and show that any two such lattices are quasi-isometric if and only if they are commensurable up to conjugation.

  相似文献   


12.
For each finite subgroup G of SLn(C), we introduce the generalized Cartan matrix AG in view of McKay correspondence from the fusion rule of its natural representation. Using group theory, we show that the generalized Cartan matrices have similar favorable properties such as positive semi- definiteness as in the classical case of affine Cartan matrices. The complete McKay quivers for SL3 (C) are explicitly described and classified based on representation theory.  相似文献   

13.
Given a finite group G and a natural number n, we study the structure of the complex of nested sets of the associated Dowling lattice (Proc. Internat. Sympos., 1971, pp. 101–115) and of its subposet of the G-symmetric partitions which was recently introduced by Hultman (, 2006), together with the complex of G-symmetric phylogenetic trees . Hultman shows that the complexes and are homotopy equivalent and Cohen–Macaulay, and determines the rank of their top homology. An application of the theory of building sets and nested set complexes by Feichtner and Kozlov (Selecta Math. (N.S.) 10, 37–60, 2004) shows that in fact is subdivided by the order complex of . We introduce the complex of Dowling trees and prove that it is subdivided by the order complex of . Application of a theorem of Feichtner and Sturmfels (Port. Math. (N.S.) 62, 437–468, 2005) shows that, as a simplicial complex, is in fact isomorphic to the Bergman complex of the associated Dowling geometry. Topologically, we prove that is obtained from by successive coning over certain subcomplexes. It is well known that is shellable, and of the same dimension as . We explicitly and independently calculate how many homology spheres are added in passing from to . Comparison with work of Gottlieb and Wachs (Adv. Appl. Math. 24(4), 301–336, 2000) shows that is intimely related to the representation theory of the top homology of . Research partially supported by the Swiss National Science Foundation, project PP002-106403/1.  相似文献   

14.
15.
Rigorous bounds for the bond percolation critical probability are determined for three Archimedean lattices: .7385 < pc((3, 122) bond) < .7449, .6430 < pc((4, 6, 12) bond) < .7376, .6281 < pc((4, 82) bond) < .7201. Consequently, the bond percolation critical probability of the (3, 122) lattice is strictly larger than those of the other ten Archimedean lattices. Thus, the (3, 122) bond percolation critical probability is possibly the largest of any vertex‐transitive graph with bond percolation critical probability that is strictly less than one. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20: 507–518, 2002  相似文献   

16.
In this paper we give a simpler proof of the L p -Schwartz space isomorphism (0 < p ≤ 2) under the Fourier transform for the class of functions of left δ-type on a Riemannian symmetric space of rank one. Our treatment rests on Anker’s [2] proof of the corresponding result in the case of left K-invariant functions on X. Thus we give a proof which relies only on the Paley-Wiener theorem.  相似文献   

17.
The Bundle Theorem is proved for geometric locally projective lattices of rank 4 which for every given line (rank 2 element) do not contain too many lines that are on a common plane (rank 3 element) with this line, but on no common point (rank 1 element). By a result of J. Kahn (Math. Z.175 (1980), 219–247), this implies that these lattices are projectively embeddable.  相似文献   

18.
The rank three subgroups of a one-dimensional affine group over a finite field were classified in 1978 by Foulser and Kallaher. Although one can use their results for a classification of corresponding rank three graphs, the author did not find such a classification in a literature. The goal of this note is to present such a classification. It turned out that graph classification is much simpler than the group one. More precisely, it is shown that the graphs in the title are either the Paley graphs or one of the graphs constructed by Van Lint and Schrijver or by Peisert. Our approach is based on elementary group theory and does not use the classification of rank three affine groups.  相似文献   

19.
Let Г be a torsion-free uniform lattice of SU(m, 1), m > 1. Let G be either SU(p, 2) with p ≥ 2, ${{\rm Sp}(2,\mathbb {R})}Let Г be a torsion-free uniform lattice of SU(m, 1), m > 1. Let G be either SU(p, 2) with p ≥ 2, or SO(p, 2) with p ≥ 3. The symmetric spaces associated to these G’s are the classical bounded symmetric domains of rank 2, with the exceptions of SO*(8)/U(4) and SO*(10)/U(5). Using the correspondence between representations of fundamental groups of K?hler manifolds and Higgs bundles we study representations of the lattice Г into G. We prove that the Toledo invariant associated to such a representation satisfies a Milnor-Wood type inequality and that in case of equality necessarily G = SU(p, 2) with p ≥ 2m and the representation is reductive, faithful, discrete, and stabilizes a copy of complex hyperbolic space (of maximal possible induced holomorphic sectional curvature) holomorphically and totally geodesically embedded in the Hermitian symmetric space SU(p, 2)/S(U(p) × U(2)), on which it acts cocompactly.  相似文献   

20.
In this study, we aim to explore the extent of mathematics pre-service teachers’ ability to apply their procedural understanding combined with spatial perception for drawing conceptual conclusions related to angles in a pyramid. The participants are 16 pre-service high school mathematics teachers. They have studied solid geometry during one academic year, solving problems with various 3-D geometric figures including pyramids and engaging in activities designed to develop spatial perception. At the end of the year, they have taken a final test which examines procedural understanding of 3-D geometric figures as well as relational understanding and spatial perception regarding angles in pyramids. The results illustrate that attainments of the majority of the pre-service teachers in problems requiring only procedural understanding are higher than the attainments in problems which require relational understanding. The results also lead to the assumption that relational understanding of learned material requires application of special teaching methods. Hence, we recommend integrating in the syllabus appropriate courses that focus on the development of this type of understanding.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号