共查询到20条相似文献,搜索用时 15 毫秒
1.
Nearrings here are right nearrings. LetN be a nearring and fix an element α εN. Form another nearring Nα by taking addition to be the same as the addition inN but define the productx ⊗y of two elementsx, y ε Nα byx ⊗y =xay. The nearring Nα is referred to as a laminated nearring ofN andN is referred to as the base nearring. The element α is called the laminating element or the laminator. An elementx of a nearingN is a left zero ifxy =x for ally εN. A homomorphismϕ from a nearringN
1 into a nearringN
2 is a left zero covering homomorphism if for each left zeroy εN
2,ϕ(x) =y for somex εN
1. The left zero covering homomorphisms from one laminated nearring into another are investigated where the base nearring is
the nearring of all continuous selfmaps of the Euclidean group ℝ2 under pointwise addition and composition and the laminators are complex polynomials. Finally, it is shown that one can determine
whether or not two such laminated nearrings are isomorphic simply by inspecting the coefficients of the two laminating polynomials. 相似文献
2.
Gaston Casanova 《Advances in Applied Clifford Algebras》1999,9(2):221-224
Let bev=x+αy where α#0, α2 = 0,x andy real are elements of a commutative ring. So inR(1, 3) ife
0,e
1,e
2,e
3 form a canonical framee
02=1,e
12=e
22=e
32=−1 the vector α=e
0+e
1 is different from zero while
The ring admits divisors of zero as α. 相似文献
3.
Consider the retarded difference equationx
n
−x
n−1
=F(−f(x
n
)+g(x
n−k
)), wherek is a positive integer,F,f,g:R→R are continuous,F andf are increasing onR, anduF(u)>0 for allu≠0. We show that whenf(y)≥g(y) (resp. f(y)≤g(y)) fory∈R, every solution of (*) tends to either a constant or −∞ (resp. ∞) asn→∞. Furthermore, iff(y)≡g(y) fory∈R, then every solution of (*) tends to a constant asn→∞.
Project supported by NNSF (19601016) of China and NSF (97-37-42) of Hunan 相似文献
4.
Our purpose here is to consider on a homogeneous tree two Pompeiutype problems which classically have been studied on the
plane and on other geometric manifolds. We obtain results which have remarkably the same flavor as classical theorems. Given
a homogeneous tree, letd(x, y) be the distance between verticesx andy, and letf be a function on the vertices. For each vertexx and nonnegative integern let Σ
n
f(x) be the sum Σ
d(x, y)=n
f(y) and letB
n
f(x)=Σ
d(x, y)≦n
f(y). The purpose is to study to what extent Σ
n
f andB
n
f determinef. Since these operators are linear, this is really the study of their kernels. It is easy to find nonzero examples for which
Σ
n
f orB
n
f vanish for one value ofn. What we do here is to study the problem for two values ofn, the 2-circle and the 2-disk problems (in the cases of Σ
n
andB
n respectively). We show for which pairs of values there can exist non-zero examples and we classify these examples. We employ
the combinatorial techniques useful for studying trees and free groups together with some number theory. 相似文献
5.
Let y = y(x) be a function defined by a continued fraction. A lower bound for |Λ| = |β
1
y
1 + β
2
y
2 + α| is given, where y
1 = y(x
1), y
2 = y(x
2), x
1 and x
2 are positive integers, α, β
1 and β
2 are algebraic irrational numbers. 相似文献
6.
W. T. Gowers 《Israel Journal of Mathematics》1990,69(2):129-151
We show that if 0<ε≦1, 1≦p<2 andx
1, …,x
n is a sequence of unit vectors in a normed spaceX such thatE ‖∑
l
n
εi
x
l‖≧n
1/p, then one can find a block basisy
1, …,y
m ofx
1, …,x
n which is (1+ε)-symmetric and has cardinality at leastγn
2/p-1(logn)−1, where γ depends on ε only. Two examples are given which show that this bound is close to being best possible. The first
is a sequencex
1, …,x
n satisfying the above conditions with no 2-symmetric block basis of cardinality exceeding 2n
2/p-1. This sequence is not linearly independent. The second example is a sequence which satisfies a lowerp-estimate but which has no 2-symmetric block basis of cardinality exceedingCn
2/p-1(logn)4/3, whereC is an absolute constant. This applies when 1≦p≦3/2. Finally, we obtain improvements of the lower bound when the spaceX containing the sequence satisfies certain type-condition. These results extend results of Amir and Milman in [1] and [2].
We include an appendix giving a simple counterexample to a question about norm-attaining operators. 相似文献
7.
Ryuei Nishii 《Annals of the Institute of Statistical Mathematics》1986,38(1):319-329
Summary Let a set ofp responsesy=(y
1,...y
p
)′ has a multivariate linear regression on a set ofq explanatory variablesx=(x
1,...x
q
)′. Our aim is to select the most informative subset of responses for making inferences about an unknownx from an observedy. Under normality ony, two selection methods, based on the asymptotic mean squared error and on the Akaike's information criterion, are proposed
by Fujikoshi and Nishii (1986,Hiroshima Math. J.,16, 269–277). In this paper, under a mild condition we will derive the cross-validation criterion and obtain the asymptotic
properties of the three procedures. 相似文献
8.
The complexity of computing the Tutte polynomialT(M,x,y) is determined for transversal matroidM and algebraic numbersx andy. It is shown that for fixedx andy the problem of computingT(M,x,y) forM a transversal matroid is #P-complete unless the numbersx andy satisfy (x−1)(y−1)=1, in which case it is polynomial-time computable. In particular, the problem of counting bases in a transversal matroid,
and of counting various types of “matchable” sets of nodes in a bipartite graph, is #P-complete. 相似文献
9.
E. A. Kireeva 《Journal of Mathematical Sciences》2008,152(4):540-557
Let F be a field of prime characteristic p and let V
p be the variety of associative algebras over F without unity defined by the identities [[x, y], z] = 0 and x
4 = 0 if p = 2 and by the identities [[x, y], z] = 0 and x
p = 0 if p > 2 (here [x, y] = xy − yx). Let A/V
p be the free algebra of countable rank of the variety V
p and let S be the T-space in A/V
p generated by x
12
x
22 ⋯ x
k2 + V
2, where k ∈ ℕ if p = 2, and by {ie4170-01}, where k ∈ ℕ and α
1, …, α
2k
∈ {0, p − 1} if p > 2. As is known, S is not finitely generated as a T-space. In the present paper, we prove that S is a limit T-space, i.e., a maximal nonfinitely generated T-space. As a corollary, we have constructed a limit T-space in
the free associative F-algebra without unity of countable rank.
__________
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 1, pp. 135–159, 2007. 相似文献
10.
Reinhard Wolf 《Arkiv f?r Matematik》1997,35(2):387-400
One of our main results is the following: LetX be a compact connected subset of the Euclidean spaceR
n
andr(X, d
2) the rendezvous number ofX, whered
2 denotes the Euclidean distance inR
n
. (The rendezvous numberr(X, d
2) is the unique positive real number with the property that for each positive integern and for all (not necessarily distinct)x
1,x
2,...,x
n
inX, there exists somex inX such that
.) Then there exists some regular Borel probability measure μ0 onX such that the value of ∫
X
d
2(x, y)dμ0 (y) is independent of the choicex inX, if and only ifr(X, d
2) = supμ ∫
X
∫
X
d
2(x, y)dμ(x)dμ(y), where the supremum is taken over all regular Borel probability measures μ onX. 相似文献
11.
Pieter Moree 《manuscripta mathematica》1993,80(1):199-211
LetB(x,y) be the sum taken over alln, 1≤n≤x, such that n can be represented as a sum of two squares of integers andn has no prime factors exceedingy. It is shown foru smaller than about .5log logx/log log logx thatB(x,x
1/u)≈cxlog-1/2
xσ(u), where σ(u satisfies a delay differential equation similar to the one satisfied by the Dickman function andc is a positive constant. 相似文献
12.
Chih-Wen Weng 《Graphs and Combinatorics》1998,14(3):275-304
Let Γ=(X,R) denote a distance-regular graph with diameter D≥2 and distance function δ. A (vertex) subgraph Ω⊆X is said to be weak-geodetically closed whenever for all x,y∈Ω and all z∈X,
We show that if the intersection number c
2>1 then any weak-geodetically closed subgraph of X is distance-regular. Γ is said to be i-bounded, whenever for all x,y∈X at distance δ(x,y)≤i,x,y are contained in a common weak-geodetically closed subgraph of Γ of diameter δ(x,y). By a parallelogram of length i, we mean a 4-tuple xyzw of vertices in X such that δ(x,y)=δ(z,w)=1, δ(x,w)=i, and δ(x,z)=δ(y,z)=δ(y,w)=i−1. We prove the following two theorems.
Theorem 1.
LetΓdenote a distance-regular graph with diameter
D≥2, and assume the intersection numbers
c
2>1, a
1≠0. Then for each integer i (1≤i≤D), the following (i)–(ii) are equivalent.
(i)*Γis i-bounded.
(ii)*Γcontains no parallelogram of length≤i+1.
Restricting attention to the Q-polynomial case, we get the following stronger result.
Theorem 2.
Let Γ denote a distance-regular graph with diameter D≥3, and assume the intersection numbers c
2>1, a
1≠0. Suppose Γ is Q-polynomial. Then the following (i)–(iii) are equivalent.
(i)*Γcontains no parallelogram of length 2 or 3.
(ii)*Γis D-bounded.
(iii)*Γhas classical parameters (D,b,α,β), and either
b<−1, or elseΓis a dual polar graph or a Hamming graph.
Received: February 8, 1995 / Revised: November 8, 1996 相似文献
13.
Tetsuya Abe 《Graphs and Combinatorics》2002,18(3):395-402
A pair (x,y) of elements in a lattice is mismatching if x is join-irreducible, y is meet-irreducible, and xy. The excess of a lattice L is defined by ex(L):=|L|− min{|V
x
|+|I
y
|:(x,y) is mismatching}, where V
x
(I
y
) is the principal filter (ideal) generated by x(y), respectively. In the first half of this paper, it is shown that a lattice has excess zero (one) if and only if it is isomorphic
to a Boolean lattice (one of a chain of length two, a diamond, and a pentagon), respectively. In the second half, we show
that for each relatively complemented lattice which is not Boolean, its size is at most five times its excess. Moreover we
determine extremal configurations.
Received: September 2, 1999 Final version received: July 25, 2000
Acknowledgments. The author thanks the referee for constructive comments.
Present address: Bureau of Human Resources, National Personnel Authority, 1-2-3 Kasumigaseki, Chiyoda-ku, Tokyo 100-8913, Japan. e-mail: abetet@jinji.go.jp 相似文献
14.
Andrea Vietri 《Graphs and Combinatorics》2007,23(1):111-121
We analyse 3-subset difference families of Z2d+1⊕Z2d+1 arising as reductions (mod 2d+1) of particular families of 3-subsets of Z⊕Z. The latter structures, namely perfect d-families, can be viewed as 2-dimensional analogues of difference triangle sets having the least scope. Indeed, every perfect d-family is a set of base blocks which, under the natural action of the translation group Z⊕Z, cover all edges {(x,y),(x′,y′)} such that |x−x′|, |y−y′|≤d. In particular, such a family realises a translation invariant (G,K3)-design, where V(G)=Z⊕Z and the edges satisfy the above constraint. For that reason, we regard perfect families as part of the hereby defined translation designs, which comprise and slightly generalise many structures already existing in the literature. The geometric context allows
some suggestive additional definitions. The main result of the paper is the construction of two infinite classes of d-families. Furthermore, we provide two sporadic examples and show that a d-family may exist only if d≡0,3,8,11 (mod 12). 相似文献
15.
Ignacy Kotlarski 《Annali di Matematica Pura ed Applicata》1966,74(1):129-134
Summary The aim of this paper is to prove the following theorem about characterization of probability distributions in Hilbert spaces:Theorem. — Let x1, x2, …, xn be n (n≥3) independent random variables in the Hilbert spaceH, having their characteristic functionals fk(t) = E[ei(t,x
k)], (k=1, 2, …, n): let y1=x1 + xn, y2=x2 + xn, …, yn−1=xn−1 + xn.
If the characteristic functional f(t1, t2, …, tn−1) of the random variables (y1, y2, …, yn−1) does not vanish, then the joint distribution of (y1, y2, …, yn−1) determines all the distributions of x1, x2, …, xn up to change of location. 相似文献
16.
Raffaele Mosca 《Graphs and Combinatorics》2001,17(3):517-528
Let G be a graph with n vertices, and denote as γ(G) (as θ(G)) the cardinality of a minimum edge cover (of a minimum clique cover) of G. Let E (let C) be the edge-vertex (the clique-vertex) incidence matrix of G; write then P(E)={x∈ℜ
n
:Ex≤1,x≥0}, P(C)={x∈ℜ
n
:Cx≤1,x≥0}, α
E
(G)=max{1
T
x subject to x∈P(E)}, and α
C
(G)= max{1
T
x subject to x∈P(C)}. In this paper we prove that if α
E
(G)=α
C
(G), then γ(G)=θ(G).
Received: May 20, 1998?Final version received: April 12, 1999 相似文献
17.
Sofiya Ostrovska 《Proceedings Mathematical Sciences》2007,117(4):485-493
Let φ be a power series with positive Taylor coefficients {a
k
}
k=0∞ and non-zero radius of convergence r ≤ ∞. Let ξ
x
, 0 ≤ x < r be a random variable whose values α
k
, k = 0, 1, …, are independent of x and taken with probabilities a
k
x
k
/φ(x), k = 0, 1, ….
The positive linear operator (A
φ
f)(x):= E[f(ξ
x
)] is studied. It is proved that if E(ξ
x
) = x, E(ξ
x
2) = qx
2 + bx + c, q, b, c ∈ R, q > 0, then A
φ
reduces to the Szász-Mirakyan operator in the case q = 1, to the limit q-Bernstein operator in the case 0 < q < 1, and to a modification of the Lupaş operator in the case q > 1. 相似文献
18.
Let R be a noncommutative prime ring of characteristic different from 2, let Z(R) be its center, let U be the Utumi quotient ring of R, let C be the extended centroid of R, and let f(x
1,..., x
n
) be a noncentral multilinear polynomial over C in n noncommuting variables. Denote by f(R) the set of all evaluations of f(x
1, …, xn) on R. If F and G are generalized derivations of R such that [[F(x), x], [G(y), y]] ∈ Z(R) for any x, y ∈ f(R), then one of the following holds:
(1) |
there exists α ∈ C such that F(x) = αx for all x ∈ R 相似文献
19.
《代数通讯》2013,41(10):5003-5010
Abstract Let R be a prime ring of characteristic different from 2, d a non-zero derivation of R, I a non-zero right ideal of R, a ∈ R, S 4(x 1,…, x 4) the standard polynomial in 4 variables. Suppose that, for any x, y ∈ I, a[d([x, y]), [x, y]] = 0. If S 4(I, I, I, I)I ≠ 0, then aI = ad(I) = 0. 相似文献
20.
Ishai Oren 《Israel Journal of Mathematics》1982,42(4):353-360
LetT be the unit circle, α irrational andF: T → R a step function. A necessary and sufficient condition for the skew of the α-rotation byf (considered as taking values mod 1) to be minimal is given. Also, the boundedness of Σ
i=1
n
f(x+iα asn → α is resolved. 相似文献
|