Search results for "Geometry"

showing 10 items of 4487 documents

Zur Hyperebenenalgebraisierung in desargues-Schen projektiven Verbandsgeometrien

1991

As a completion and extension of a result of A. Day and D. Pickering [5] we obtain the following structure theorem in the conceptual frame of projective lattice geometries: In a Desarguesian projective geometry the subgeometry of every at least one-dimensional hyperplane is module induced.

CombinatoricsDiscrete mathematicsProjective harmonic conjugateCollineationBlocking setDuality (projective geometry)Projective spaceGeometry and TopologyProjective planeNon-Desarguesian planeProjective geometryMathematicsJournal of Geometry
researchProduct

A Group-theoretical Finiteness Theorem

2008

We start with the universal covering space $${\*M^n}$$ of a closed n-manifold and with a tree of fundamental domains which zips it $${T\longrightarrow\*M^n}$$ . Our result is that, between T and $${\* M^n}$$ , is an intermediary object, $${T\stackrel{p} {\longrightarrow} G \stackrel{F}{\longrightarrow} \*M^n}$$ , obtained by zipping, such that each fiber of p is finite and $${T\stackrel{p}{\longrightarrow}G\stackrel{F}{\longrightarrow} \*M^n}$$ admits a section.

CombinatoricsDiscrete mathematicsSection (fiber bundle)Tree (descriptive set theory)Differential geometryCovering spaceGroup (mathematics)Hyperbolic geometryGeometry and TopologyAlgebraic geometryPL-structureDeveloping mapsPartial sectionCayley 2-complexMathematics
researchProduct

Elementarteiler von Inzidenzmatrizen symmetrischer Blockpläne

1986

By a study of the integral code generated by the rows of the incidence matrix and its extention the following results are obtained: Let d 1,...,d V(d 1|d 2,d 2|d 3...) be the elementary divisors of the incidence matrix of a symmetric (v,n+λ, λ) design. Then d v=(n+λ)n/g.c.d. (n, λ). Moreover, if p is a prime such that p|n, p∤λ and if x p denotes the p-part of x, then (d idv+2−i) p =n p for 2≤i≤v. For projective planes it can be shown that d 1=···=d 3n−2=1, hence $$d_{n^2 - 2n{\text{ }} + {\text{ }}5} {\text{ }} = \cdots = d_{n^2 + n} = n$$ and $$d_{n^2 - n{\text{ }} + {\text{ }}1} = (n + 1)n$$ . The paper also contains some results about elementary divisors of incidence matrices G satisfyin…

CombinatoricsElementary divisorsGeometry and TopologyAlgebraic geometryProjective planePrime (order theory)MathematicsIncidence (geometry)Geometriae Dedicata
researchProduct

Covering and differentiation

1995

CombinatoricsEuclidean distanceDiscrete mathematicsConvex geometryEuclidean spaceEuclidean geometryAffine spaceBall (mathematics)Euclidean distance matrixGaussian measureMathematics
researchProduct

A Dual Version of Huppert's  -  Conjecture

2010

Huppert’s ρ-σ conjecture asserts that any finite group has some character degree that is divisible by “many” primes. In this note, we consider a dual version of this problem, and we prove that for any finite group there is some prime that divides “many” character degrees.

CombinatoricsFinite groupConjectureCharacter (mathematics)Mathematics::Number TheoryGeneral MathematicsMathematics::Metric GeometryDegree (angle)Prime (order theory)Dual (category theory)MathematicsInternational Mathematics Research Notices
researchProduct

k-Weakly almost convex groups and ? 1 ? $$\tilde M^3 $$

1993

We extend Cannon's notion ofk-almost convex groups which requires that for two pointsx, y on then-sphere in the Cayley graph which can be joined by a pathl1 of length ≤k, there is a second pathl2 in then-ball, joiningx andy, of bounded length ≤N(k). Ourk-weakly almost convexity relaxes this condition by requiring only thatl1 ∝l2 bounds a disk of area ≤C1(k)n1 - e(k) +C2(k). IfM3 is a closed 3-manifold with 3-weakly almost convex fundamental group, then π1∞\(\tilde M^3 = 0\).

CombinatoricsFundamental groupCayley graphDifferential geometryHyperbolic geometryBounded functionRegular polygonGeometry and TopologyAlgebraic geometryConvexityMathematicsGeometriae Dedicata
researchProduct

On finding common neighborhoods in massive graphs

2003

AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We prove lower bounds on the resources needed to solve this problem on resource-bounded models of computation. In streaming models, in which algorithms can access the input only a constant number of times and only sequentially, we show that, even with randomization, any algorithm that determines if there exists any pair of vertices with a large common neighborhood must essentially store and process the input graph off line. In sampling models, in which algorithms can only query an oracle for the common neighborhoods of specified vertex pairs, we show that any algorithm must …

CombinatoricsGeneral Computer ScienceModel of computationExistential quantificationGraphOracleOff lineComputer Science(all)Theoretical Computer ScienceVertex (geometry)MathematicsTheoretical Computer Science
researchProduct

Permutability in finite soluble groups

1994

Let G be a finite soluble group and let Σ be a Hall system of G. A subgroup U of G is said to be Σ-permutable if U permutes with every member of Σ. In [1; I, 4·29] it is proved that if U and V are Σ-permutable subgroups of G then so also are U ∩ V and 〈U, V〉.

CombinatoricsGroup (mathematics)General MathematicsGeometryPermutable primeMathematicsMathematical Proceedings of the Cambridge Philosophical Society
researchProduct

Characterization of chain geometries of finite dimension by their automorphism group

1990

A large class of chain geometries of finite dimension is characterized as strong chain spaces possessing a distinguished group of automorphisms fixing two distant points.

CombinatoricsInner automorphismChain (algebraic topology)HolomorphSymmetric groupSO(8)Alternating groupOuter automorphism groupGeometry and TopologyAutomorphismMathematicsGeometriae Dedicata
researchProduct

Residual 𝑝 properties of mapping class groups and surface groups

2008

Let M ( Σ , P ) \mathcal {M}(\Sigma , \mathcal {P}) be the mapping class group of a punctured oriented surface ( Σ , P ) (\Sigma ,\mathcal {P}) (where P \mathcal {P} may be empty), and let T p ( Σ , P ) \mathcal {T}_p(\Sigma ,\mathcal {P}) be the kernel of the action of M ( Σ , P ) \mathcal {M} (\Sigma , \mathcal {P}) on H 1 ( Σ ∖ P , F p ) H_1(\Sigma \setminus \mathcal {P}, \mathbb {F}_p) . We prove that T p ( Σ , P ) \mathcal {T}_p( \Sigma ,\mathcal {P}) is residually p p . In particular, this shows that M ( Σ , P ) \mathcal {M} (\Sigma ,\mathcal {P}) is virtually residually p p . For a group G G we denote by I p ( G ) \mathcal {I}_p(G) the kernel of the natural action of Out ⁡ ( G ) \ope…

CombinatoricsKernel (algebra)Class (set theory)Conjugacy classGroup (mathematics)Applied MathematicsGeneral MathematicsOrder (group theory)Property aGeometrySurface (topology)Mapping class groupMathematicsTransactions of the American Mathematical Society
researchProduct