首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
Let G be a group. An element gG is called a test element of G if for every endomorphism ? : GG, ?(g) = g implies ? is an automorphism. We prove that for a finitely generated profinite group G, gG is a test element of G if and only if it is not contained in a proper retract of G. Using this result we prove that an endomorphism of a free pro-p group of finite rank which preserves an automorphic orbit of a nontrivial element must be an automorphism. We give numerous explicit examples of test elements in free pro-p groups and Demushkin groups. By relating test elements in finitely generated residually finite-p Turner groups to test elements in their pro-p completions, we provide new examples of test elements in free discrete groups and surface groups. Moreover, we prove that the set of test elements of a free discrete group of finite rank is dense in the profinite topology.  相似文献   

2.
3.
In this paper, we first present a new finite difference scheme to approximate the time fractional derivatives, which is defined in the sense of Caputo, and give a semidiscrete scheme in time with the truncation error O((Δt)3?α ), where Δt is the time step size. Then a fully discrete scheme based on the semidiscrete scheme for the fractional Cattaneo equation in which the space direction is approximated by a local discontinuous Galerkin method is presented and analyzed. We prove that the method is unconditionally stable and convergent with order O(h k+1 + (Δt)3?α ), where k is the degree of piecewise polynomial. Numerical examples are also given to confirm the theoretical analysis.  相似文献   

4.
We complete the series of results by M. V. Sapir, M. V. Volkov and the author solving the Finite Basis Problem for semigroups of rank ≤ k transformations of a set, namely based on these results we prove that the semigroup T k (X) of rank ≤ k transformations of a set X has no finite basis of identities if and only if k is a natural number and either k = 2 and |X| ∈ «3, 4» or k ≥ 3. A new method for constructing finite non-finitely based semigroups is developed. We prove that the semigroup of rank ≤ 2 transformations of a 4-element set has no finite basis of identities but that the problem of checking its identities is tractable (polynomial).  相似文献   

5.
6.
Gejza Jenča 《Order》2018,35(3):525-540
For an effect algebra A, we examine the category of all morphisms from finite Boolean algebras into A. This category can be described as a category of elements of a presheaf R(A) on the category of finite Boolean algebras. We prove that some properties (being an orthoalgebra, the Riesz decomposition property, being a Boolean algebra) of an effect algebra A can be characterized in terms of some properties of the category of elements of the presheaf R(A). We prove that the tensor product of effect algebras arises as a left Kan extension of the free product of finite Boolean algebras along the inclusion functor. The tensor product of effect algebras can be expressed by means of the Day convolution of presheaves on finite Boolean algebras.  相似文献   

7.
The congruence lattices of all algebras defined on a fixed finite set A ordered by inclusion form a finite atomistic lattice \(\mathcal {E}\). We describe the atoms and coatoms. Each meet-irreducible element of \(\mathcal {E}\) being determined by a single unary mapping on A, we characterize completely those which are determined by a permutation or by an acyclic mapping on the set A. Using these characterisations we deduce several properties of the lattice \(\mathcal {E}\); in particular, we prove that \(\mathcal {E}\) is tolerance-simple whenever \(|A|\ge 4\).  相似文献   

8.
The cable equation is one of the most fundamental equations for modeling neuronal dynamics. These equations can be derived from the Nernst-Planck equation for electro-diffusion in smooth homogeneous cylinders. Fractional cable equations are introduced to model electrotonic properties of spiny neuronal dendrites. In this paper, a Galerkin finite element method(GFEM) is presented for the numerical simulation of the fractional cable equation(FCE) involving two integro-differential operators. The proposed method is based on a semi-discrete finite difference approximation in time and Galerkin finite element method in space. We prove that the numerical solution converges to the exact solution with order O(τ+hl+1) for the lth-order finite element method. Further, a novel Galerkin finite element approximation for improving the order of convergence is also proposed. Finally, some numerical results are given to demonstrate the theoretical analysis. The results show that the numerical solution obtained by the improved Galerkin finite element approximation converges to the exact solution with order O(τ2+hl+1).  相似文献   

9.
Let G be a finite non-solvable group. We prove that there exists a proper subgroup A of G such that G is the product of three conjugates of A, thus replacing an earlier upper bound of 36 with the smallest possible value. The proof relies on an equivalent formulation in terms of double cosets, and uses the following theorem which is of independent interest and wider scope: Any group G with a BN-pair and a finite Weyl group W satisfies \(G = {\left( {B{n_0}B} \right)^2} = B{B^{{n_0}}}B\) where n0 is any preimage of the longest element of W. The proof of the last theorem is formulated in the dioid consisting of all unions of double cosets of B in G. Other results on minimal length product covers of a group by conjugates of a proper subgroup are given.  相似文献   

10.
For a lattice L, let Princ(L) denote the ordered set of principal congruences of L. In a pioneering paper, G. Grätzer characterized the ordered set Princ(L) of a finite lattice L; here we do the same for a countable lattice. He also showed that every bounded ordered set H is isomorphic to Princ(L) of a bounded lattice L. We prove a related statement: if an ordered set H with a least element is the union of a chain of principal ideals (equivalently, if 0 \({\in}\) H and H has a cofinal chain), then H is isomorphic to Princ(L) of some lattice L.  相似文献   

11.
We study groups with no elements of big orders. We prove that if the set of element orders of G is {1, 2, 3, 4, p, 9}, where p ∈ {7, 5}, then G is locally finite.  相似文献   

12.
Let (L,∧, ∨) be a finite lattice with a least element 0. AG(L) is an annihilating-ideal graph of L in which the vertex set is the set of all nontrivial ideals of L, and two distinct vertices I and J are adjacent if and only if IJ = 0. We completely characterize all finite lattices L whose line graph associated to an annihilating-ideal graph, denoted by L(AG(L)), is a planar or projective graph.  相似文献   

13.
Let G be a finite group. The prime graph of G is denoted by Γ(G). The main result we prove is as follows: If G is a finite group such that Γ(G) = Γ(L 10(2)) then G/O 2(G) is isomorphic to L 10(2). In fact we obtain the first example of a finite group with the connected prime graph which is quasirecognizable by its prime graph. As a consequence of this result we can give a new proof for the fact that the simple group L 10(2) is uniquely determined by the set of its element orders.  相似文献   

14.
Suppose that each finite subgroup of even order of a periodic group containing an element of order 2 lies in a subgroup isomorphic to a simple symplectic group of degree 4 over some finite field of characteristic 2. We prove that in that case the group is isomorphic to a simple symplectic group S 4(Q) over some locally finite field Q of characteristic 2.  相似文献   

15.
We consider two classifications of extensions of Johansson’s minimal logic J. Logics and then calculi are divided into levels and slices with numbers from 0 to ω. We prove that the first classification is strongly decidable over J, i.e., from any finite list Rul of axiom schemes and inference rules, we can effectively compute the level number of the calculus (J + Rul). We prove the strong decidability of each slice with finite number: for each n and arbitrary finite Rul, we can effectively check whether the calculus (J + Rul) belongs to the nth slice.  相似文献   

16.
We study the isometric extension problem for Hölder maps from subsets of any Banach space intoc 0 or into a space of continuous functions. For a Banach spaceX, we prove that anyα-Hölder map, with 0<α ≤1, from a subset ofX intoc 0 can be isometrically extended toX if and only ifX is finite dimensional. For a finite dimensional normed spaceX and for a compact metric spaceK, we prove that the set ofα’s for which allα-Hölder maps from a subset ofX intoC(K) can be extended isometrically is either (0, 1] or (0, 1) and we give examples of both occurrences. We also prove that for any metric spaceX, the above described set ofα’s does not depend onK, but only on finiteness ofK.  相似文献   

17.
Given E ? ? d , d ≥ 2, define
$D(E) \equiv \left\{ {{{x - y} \over {\left| {x - y} \right|}}:x,y \in E} \right\} \subset {S^{d - 1}}$
to be the set of directions determined by E. We prove that if the Hausdorff dimension of E is greater than d ? 1, then σ(D(E)) > 0, where σ denotes the surface measure on S d?1. In the process, we prove some tight upper and lower bounds for the maximal function associated with the Radon-Nikodym derivative of the natural measure on D. This result is sharp, since the conclusion fails to hold if E is a (d ? 1)-dimensional hyper-plane. This result can be viewed as a continuous analog of a recent result of Pach, Pinchasi, and Sharir ([22, 23]) on directions determined by finite subsets of ? d . We also discuss the case when the Hausdorff dimension of E is precisely d ? 1, where some interesting counter-examples have been obtained by Simon and Solomyak ([25]) in the planar case. In response to the conjecture stated in this paper, T. Orponen and T. Sahlsten ([20]) have recently proved that if the Hausdorff dimension of E equals d ? 1 and E is rectifiable and is not contained in a hyper-pane, the Lebesgue measure of the set of directions is still positive. Finally, we show that our continuous results can be used to recover and, in some cases, improve the exponents for the corresponding results in the discrete setting for large classes of finite point sets. In particular, we prove that a finite point set P ? ? d , d ≥ 3, satisfying a certain discrete energy condition (Definition 3.1) determines ? #P distinct directions.
  相似文献   

18.
Suppose that G is a finite group and K is a non-trivial conjugacy class of G such that KK?1 = 1 ∪ DD?1 with D a conjugacy class of G. We prove that G is not a non-abelian simple group and we give arithmetical conditions on the class sizes determining the solvability and the structure of 〈K〉 and 〈D〉.  相似文献   

19.
For an arbitrary local field K (a finite extension of the field Qp) and an arbitrary formal group law F over K, we consider an analog cF of the classical Hilbert pairing. A theorem by S.V. Vostokov and I.B. Fesenko says that if the pairing cF has a certain fundamental symbol property for all Lubin–Tate formal groups, then cF = 0. We generalize the theorem of Vostokov–Fesenko to a wider class of formal groups. Our first result concerns formal groups that are defined over the ring OK of integers of K and have a fixed ring O0 of endomorphisms, where O0 is a subring of OK. We prove that if the symbol cF has the above-mentioned symbol property, then cF = 0. Our second result strengthens the first one in the case of Honda formal groups. The paper consists of three sections. After a short introduction in Section 1, we recall basic definitions and facts concerning formal group laws in Section 2. In Section 3, we state and prove two main results of the paper (Theorems 1 and 2). Refs. 8.  相似文献   

20.
The reduced C*-algebra of the interior of the isotropy in any Hausdorff étale groupoid G embeds as a C*-subalgebra M of the reduced C*-algebra of G. We prove that the set of pure states of M with unique extension is dense, and deduce that any representation of the reduced C*-algebra of G that is injective on M is faithful. We prove that there is a conditional expectation from the reduced C*-algebra of G onto M if and only if the interior of the isotropy in G is closed. Using this, we prove that when the interior of the isotropy is abelian and closed, M is a Cartan subalgebra. We prove that for a large class of groupoids G with abelian isotropy—including all Deaconu–Renault groupoids associated to discrete abelian groups—M is a maximal abelian subalgebra. In the specific case of k-graph groupoids, we deduce that M is always maximal abelian, but show by example that it is not always Cartan.  相似文献   

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

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