首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 656 毫秒
1.
If a monoid S is given by some finite complete presentation ℘, we construct inductively a chain of CW-complexes
such that Δ n has dimension n, for every 2≤mn, the m-skeleton of Δ n is Δ m , and p m are critical (m+1)-cells with 1≤mn−2. For every 2≤mn−1, the following is an exact sequence of (ℤS,ℤS)-bimodules
where if m=2. We then use these sequences to obtain a free finitely generated bimodule partial resolution of ℤS. Also we show that for groups properties FDT and FHT coincide.  相似文献   

2.
We formulate a series of conjectures (and a few theorems) on the quotient of the polynomial ring in two sets of variables by the ideal generated by all S n invariant polynomials without constant term. The theory of the corresponding ring in a single set of variables X = {x 1, ..., x n} is classical. Introducing the second set of variables leads to a ring about which little is yet understood, but for which there is strong evidence of deep connections with many fundamental results of enumerative combinatorics, as well as with algebraic geometry and Lie theory.  相似文献   

3.
We apply group actions to some natural situations like the natural ‘linear’ action of GL r (Z n ) and some of its subgroups to derive number-theoretic identities like
.   相似文献   

4.
Given n−1 points on the real line and a set of n rods of strictly positive lengths , we get to choose an n-th point xn anywhere on the real line and to assign the rods to the points according to an arbitrary permutation π. The rod is thought of as the workload brought in by a customer arriving at time xk into a first in -first out queue which starts empty at − ∞. If any xi equals xj for i < j, service is provided to the rod assigned to xi before the rod assigned to xj. Let denote the set of departure times of the customers (rods). Let denote the number of choices for the location of xn for which . Rybko and Shlosman proved that
for Lebesgue almost all . Let denote the departure point of the rod λk. Let Nπ, k(y) denote the number of choices for the location of xn for which and let . In this paper we prove that for every and every k we have for all but finitely many y. This implies (and strengthens) the rod placement theorem of Rybko and Shlosman. AMS Subject Classifications: 60G55, 05A05, 60C05, 60K25 Research supported by ONR MURI N00014-1-0637, NSF ECS-0123512, Marvell Semiconductor, and the University of California MICRO program.  相似文献   

5.
Let R be a prime ring of characteristic different from 2, C its extended centroid, d a nonzero derivation of R, f(x 1, . . . , x n ) a multilinear polynomial over C, ρ a nonzero right ideal of R and m > 1 a fixed integer such that
$$\qquad \left ([d(f(r_{1},\ldots ,r_{n})),f(r_{1},\ldots ,r_{n})]\right )^{m}=[d(f(r_{1},\ldots ,r_{n})),f(r_{1},\ldots ,r_{n})] $$
for all r 1, . . . , r n ρ. Then either [f(x 1,…,x n ),x n+1]x n+2 is an identity for ρ or d(ρ)ρ = 0.
  相似文献   

6.
The main result of this paper is an exponential sum bound in prime fields for multilinear expressions of the type under nearly optimal conditions on . It provides the expected generalization of the well-known inequality for r = 2. We also establish a new result on Gauss sums for multiplicative subgroups H of , obtaining a nontrivial estimate provided . This is a further improvement on [BGK]. Received: May 2007, Revision: October 2007, Accepted: October 2007  相似文献   

7.
We obtain an estimate of the modulus of a complete multiple rational trigonometric sum: $$\left| {\sum {_{x_{1, \ldots ,} x_r = 1^{\exp \left( {{{2\pi if\left( {x_{1, \ldots ,} x_r } \right)} \mathord{\left/ {\vphantom {{2\pi if\left( {x_{1, \ldots ,} x_r } \right)} q}} \right. \kern-\nulldelimiterspace} q}} \right)} }^q } } \right| \ll q^{{{r - 1} \mathord{\left/ {\vphantom {{r - 1} {n + \varepsilon }}} \right. \kern-\nulldelimiterspace} {n + \varepsilon }}} ,$$ where $$\begin{gathered} f\left( {x_{1, \ldots ,} x_r } \right) = \sum {_{0 \leqslant t_1 , \ldots ,t_r \leqslant n^a t_1 , \ldots ,t_r x_1^{t_1 } \ldots x_r^{t_r } ,} } \hfill \\ a_{0, \ldots ,0} = 0,\left( {a_{0, \ldots ,0,1} , \ldots ,a_{n, \ldots ,n,} q} \right) = 1 \hfill \\ \end{gathered} $$ , and an estimate of the modulus of a multiple trigonometric integral.  相似文献   

8.
The classical prime geodesic theorem (PGT) gives an asymptotic formula (as x tends to infinity) for the number of closed geodesics with length at most x on a hyperbolic manifold M. Closed geodesics correspond to conjugacy classes of π1(M) = Γ where Γ is a lattice in G = SO(n,1). The theorem can be rephrased in the following format. Let be the space of representations of into Γ modulo conjugation by Γ. is defined similarly. Let be the projection map. The PGT provides a volume form vol on such that for sequences of subsets {B t }, satisfying certain explicit hypotheses, |π−1(B t )| is asymptotic to vol(B t ). We prove a statement having a similar format in which is replaced by a free group of finite rank under the additional hypothesis that n = 2 or 3.   相似文献   

9.
In this paper we study sequential dynamical systems (SDS) over words. An SDS is a triple consisting of: (a) a graph Y with vertex set {v1, ..., vn}, (b) a family of Y-local functions , where K is a finite field and (c) a word w, i.e., a family (w1, ..., wk), where wi is a Y-vertex. A map is called Y-local if and only if it fixes all variables and depends exclusively on the variables , for . An SDS induces an SDS- map, , obtained by the map-composition of the functions according to w. We show that an SDS induces in addition the graph G(w,Y) having vertex set {1, ..., k} where r, s are adjacent if and only if ws, wr are adjacent in Y. G(w, Y) is acted upon by Sk via and Fix(w) is the group of G(w, Y) graph automorphisms which fix w. We analyze G(w, Y)-automorphisms via an exact sequence involving the normalizer of Fix(w) in Aut(G(w, Y)), Fix(w) and Aut(Y). Furthermore we introduce an equivalence relation over words and prove a bijection between word equivalence classes and certain orbits of acyclic orientations of G(w, Y). Received September 12, 2004  相似文献   

10.
Given a nontrivial Borel measure on ℝ, let p n be the corresponding orthonormal polynomial of degree n whose zeros are λ j (n), j=1,…,n. Then for each j=1,…,n,
with
defines a discrete probability distribution. The Shannon entropy of the sequence {p n } is consequently defined as
In the case of Chebyshev polynomials of the first and second kinds, an explicit and closed formula for is obtained, revealing interesting connections with number theory. In addition, several results of numerical computations exemplifying the behavior of for other families are presented.   相似文献   

11.
Let be an n-dimensional compact, possibly with boundary, submanifold in an (n + p)-dimensional space form R n+p (c). Assume that r is even and , in this paper we introduce rth mean curvature function S r and (r + 1)-th mean curvature vector field . We call M to be an r-minimal submanifold if on M, we note that the concept of 0-minimal submanifold is the concept of minimal submanifold. In this paper, we define a functional of , by calculation of the first variational formula of J r we show that x is a critical point of J r if and only if x is r-minimal. Besides, we give many examples of r-minimal submanifolds in space forms. We calculate the second variational formula of J r and prove that there exists no compact without boundary stable r-minimal submanifold with in the unit sphere S n+p . When r = 0, noting S 0 = 1, our result reduces to Simons’ result: there exists no compact without boundary stable minimal submanifold in the unit sphere S n+p .   相似文献   

12.
There are two sequences in two variables which characterize the solvability of finite groups. Namely, the sequence of Bandman, Greuel, Grunewald, Kunyavskii, Pfister and Plotkin which is defined by u 1x −2 y −1 x and and the sequence of Bray, Wilson, and Wilson defined by s 1 = x and . We define new sequences and proof that six of them characterize the solvability of finite groups.   相似文献   

13.
We consider a question raised by Suhov and Voice from quantum information theory and quantum computing. An element of a partition of {1, ..., n} is said to be block-stable for if it is not moved to another block under the action of π. The problem concerns the determination of the generating series for elements of with respect to the number of block-stable elements of a canonical partition of a finite n-set, with block sizes k1, ..., kr, in terms of the moment (power) sums pq(k1, ..., kr). We also consider the limit subject to the condition that exists for q = 1, 2,.... Received January 31, 2006  相似文献   

14.
The hyperoctahedral group H in n dimensions (the Weyl group of Lie type B n ) is the subgroup of the orthogonal group generated by all transpositions of coordinates and reflections with respect to coordinate hyperplanes.With e 1 , ..., e n denoting the standard basis vectors of n and letting x k = e 1 + ··· + e k (k = 1, 2, ..., n), the set
is the vertex set of a generalized regular hyperoctahedron in n . A finite set with a weight function is called a Euclidean t-design, if
holds for every polynomial f of total degree at most t; here R is the set of norms of the points in ,W r is the total weight of all elements of with norm r, S r is the n-dimensional sphere of radius r centered at the origin, and is the average of f over S r . Here we consider Euclidean designs which are supported by orbits of the hyperoctahedral group. Namely, we prove that any Euclidean design on a union of generalized hyperoctahedra has strength (maximum t for which it is a Euclidean design) equal to 3, 5, or 7.We find explicit necessary and sufficient conditions for when this strength is 5 and for when it is 7.In order to establish our classification, we translate the above definition of Euclidean designs to a single equation for t = 5, a set of three equations for t = 7, and a set of seven equations for t = 9. Neumaier and Seidel (1988), as well as Delsarte and Seidel (1989), proved a Fisher-type inequality for the minimum size of a Euclidean t-design in n on p = |R| concentric spheres (assuming that the design is antipodal if t is odd).A Euclidean design with exactly N (n, p, t) points is called tight. We exhibit new examples of antipodal tight Euclidean designs, supported by orbits of the hyperoctahedral group, for N(n, p, t) = (3, 2, 5), (3, 3, 7), and (4, 2, 7).  相似文献   

15.
Let k be a finite field of characteristic p, l a prime number different from p, a nontrivial additive character, and a character on . Then ψ defines an Artin-Schreier sheaf on the affine line , and χ defines a Kummer sheaf on the n-dimensional torus . Let be a Laurent polynomial. It defines a k-morphism . In this paper, we calculate the weights of under some non-degeneracy conditions on f. Our results can be used to estimate sums of the form
where are multiplicative characters, is a nontrivial additive character, and f 1 , . . . , f m , f are Laurent polynomials. The research is supported by the NSFC (10525107).  相似文献   

16.
We analyze the convergence rate of a multigrid method for multilevel linear systems whose coefficient matrices are generated by a real and nonnegative multivariate polynomial f and belong to multilevel matrix algebras like circulant, tau, Hartley, or are of Toeplitz type. In the case of matrix algebra linear systems, we prove that the convergence rate is independent of the system dimension even in presence of asymptotical ill-conditioning (this happens iff f takes the zero value). More precisely, if the d-level coefficient matrix has partial dimension n r at level r, with , then the size of the system is , , and O(N(n)) operations are required by the considered V-cycle Multigrid in order to compute the solution within a fixed accuracy. Since the total arithmetic cost is asymptotically equivalent to the one of a matrix-vector product, the proposed method is optimal. Some numerical experiments concerning linear systems arising in 2D and 3D applications are considered and discussed.  相似文献   

17.
We study characterizations of generic rigid graphs and generic circuits in the plane using only few decompositions into spanning trees. Generic rigid graphs in the plane can be characterized by spanning tree decompositions [5,6]. A graph G with n vertices and 2n − 3 edges is generic rigid in the plane if and only if doubling any edge results in a graph which is the union of two spanning trees. This requires 2n − 3 decompositions into spanning trees. We show that n − 2 decompositions suffice: only edges of G − T can be doubled where T is a spanning tree of G. A recent result on tensegrity frameworks by Recski [7] implies a characterization of generic circuits in the plane. A graph G with n vertices and 2n − 2 edges is a generic circuit in the plane if and only if replacing any edge of G by any (possibly new) edge results in a graph which is the union of two spanning trees. This requires decompositions into spanning trees. We show that 2n − 2 decompositions suffice. Let be any circular order of edges of G (i.e. ). The graph G is a generic circuit in the plane if and only if is the union of two spanning trees for any . Furthermore, we show that only n decompositions into spanning trees suffice.  相似文献   

18.
19.
Let Γ g be the fundamental group of a closed oriented Riemann surface Σ g , g ≥ 2, and let G be a simple Lie group of Hermitian type. The Toledo invariant defines the subset of maximal representations Repmax g , G) in the representation variety Rep(Γ g , G). Repmax g , G) is a union of connected components with similar properties as Teichmüller space . We prove that the mapping class group acts properly on Repmax g , G) when , SU(n,n), SO*(4n), Spin(2,n).  相似文献   

20.
There exists a separable exact C*-algebra A which contains all separable exact C*-algebras as subalgebras, and for each norm-dense measure μ on A and independent μ-distributed random elements x 1, x 2, ... we have . Further, there exists a norm-dense non-atomic probability measure μ on the Cuntz algebra such that for an independent sequence x 1, x 2, ... of μ-distributed random elements x i we have . We introduce the notion of the stochastic rank for a unital C*-algebra and prove that the stochastic rank of C([0, 1] d ) is d. B. Burgstaller was supported by the Austrian Schr?dinger stipend J2471-N12.  相似文献   

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

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