Search results for "Discrete"

On a numerical solution of the Maxwell equations by discrete exterior calculus

2014

The average number of Sylow subgroups of a finite group

2013

We prove that if the average Sylow number (ignoring the Sylow numbers that are one) of a finite group G is ⩽7, then G is solvable.

Characterization of strong chain geometries by their automorphism group

1992

A wide class of chain geometries is characterized by their automorphism group using properties of a distinguished involution.

The Fitting Subgroup and Some Injectors of Radical Locally Finite Groups with min-pfor Allp

2003

Abstract This work was intended as an attempt to continue the study of the class ℬ of generalised nilpotent groups started in a previous paper. We present some results concerning the Fitting subgroup and the ℬ-injectors of a radical locally finite group satisfying min-p for all p.

A Gaschütz–Lubeseder Type Theorem in a Class of Locally Finite Groups

1999

The aim of this paper is to present a Gaschutz–Lubeseder type theorem in the class cL of all radical locally finite groups satisfying min−p for all primes p. Notice that these groups are countable and co-Hopfian by [1, (5.4.8)]. In retrospect, the theory of saturated formations of finite soluble groups began with the results of Gaschutz [3] in 1963. He introduced the concept of “covering subgroup” as a generalization of Sylow and Hall subgroups. These covering subgroups have many of the properties of Sylow and Hall subgroups other than the arithmetic ones. The main idea of Gaschutz’s work was concerned with group theoretical classes having the same properties. He defined a formation F to be…

On some classes of supersoluble groups

2007

[EN] Finite groups G for which for every subgroup H and for all primes q dividing the index |G:H| there exists a subgroup K of G such that H is contained in K and |K:H|=q are called Y-groups. Groups in which subnormal subgroups permute with all Sylow subgroups are called PST-groups. In this paper a local version of the Y-property leading to a local characterisation of Y-groups, from which the classical characterisation emerges, is introduced. The relationship between PST-groups and Y-groups is also analysed.

Variational parabolic capacity

2015

We establish a variational parabolic capacity in a context of degenerate parabolic equations of $p$-Laplace type, and show that this capacity is equivalent to the nonlinear parabolic capacity. As an application, we estimate the capacities of several explicit sets.

A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics

2011

International audience; We present a complete, exact and efficient implementation to compute the edge-adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the edge-adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always comp…

Modal Consequence Relations Extending S4.3: An Application of Projective Unification

2016

We characterize all finitary consequence relations over $\mathbf{S4.3}$ , both syntactically, by exhibiting so-called (admissible) passive rules that extend the given logic, and semantically, by providing suitable strongly adequate classes of algebras. This is achieved by applying an earlier result stating that a modal logic $L$ extending $\mathbf{S4}$ has projective unification if and only if $L$ contains $\mathbf{S4.3}$ . In particular, we show that these consequence relations enjoy the strong finite model property, and are finitely based. In this way, we extend the known results by Bull and Fine, from logics, to consequence relations. We also show that the lattice of consequence relation…

Computing Subdivision Surface Intersection

2003

Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.