首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
Let be a finite regular incidence-polytope. A realization of is given by an imageV of its vertices under a mapping into some euclidean space, which is such that every element of the automorphism group () of induces an isometry ofV. It is shown in this paper that the family of all possible realizations (up to congruence) of forms, in a natural way, a closed convex cone, which is also denoted by The dimensionr of is the number of equivalence classes under () of diagonals of , and is also the number of unions of double cosets ** *–1* ( *), where * is the subgroup of () which fixes some given vertex of . The fine structure of corresponds to the irreducible orthogonal representations of (). IfG is such a representation, let its degree bed G , and let the subgroup ofG corresponding to * have a fixed space of dimensionw G . Then the relations
  相似文献   

2.
Arithmetical functionsf andh are said to satisfy the Subbarao identity if
  相似文献   

3.
We give the general solution of the nonsymmetric partial difference functional equationf(x + t,y) + f(x – t,y) – 2f(x,y)/t 2 =f(x,y + s) + f(x,y – s) – 2f(x,y)/s 2 (N) analogous to the well-known wave equation ( 2/x 2 2/y 2)f(x,y) = 0 with the aid of generalized polynomials when no regularity assumptions are imposed onf. The result is as follows. Theorem.Let R be the set of all real numbers. A function f: R × R R satisfies the functional equation (N)for all x, y R, s, t R\{0}, and s t if and only if there exist
(i)  additive functions A, B: R R
(ii)  a function C: R × R R which is additive in each variable, and
(iii)  polynomials
  相似文献   

4.
In this paper, assuming a certain set-theoretic hypothesis, a positive answer is given to a question of H. Kraljevi, namely it is shown that there exists a Lebesgue measurable subsetA of the real line such that the set {c R: A + cA contains an interval} is nonmeasurable. Here the setA + cA = {a + ca: a, a A}. Two other results about sets of the formA + cA are presented.  相似文献   

5.
Dans cet article, nous démontrons essentiellement les deux résultats suivants, qui montrent que les solutions séries formelles à coefficients dans de certaines équations fonctionnelles sont rationnelles. Soient tout d'abords un entier naturel non nul, eta i ,b i ,(i = 1, , s), 2s nombres complexes, lesa i étant non nuls. On définit l'ensembleA comme étant l'intersection des parties de , contenant l'origine et stables par toutes les applicationsg i (x) = a i x + b i . On a alors le résultat suivant: Théorème 1.Soient f, R 1, ,R s s + 1 fractions rationnelles de (x), régulières à l'origine, et ai, bi (i = 1,, s), 2s éléments de . On suppose que les ai sont non nuls et de module strictement inférieur à un pour tout i = 1,, s. Soit y(x) un élément de [[x]], vérifiant l'équation fonctionnelle
  相似文献   

6.
In the present work it is studied the initial value problem for an equation in the form
  相似文献   

7.
LetV n ={1, 2, ...,n} ande 1,e 2, ...,e N ,N= be a random permutation ofV n (2). LetE t={e 1,e 2, ...,e t} andG t=(V n ,E t ). If is a monotone graph property then the hitting time() for is defined by=()=min {t:G t }. Suppose now thatG starts to deteriorate i.e. loses edges in order ofage, e 1,e 2, .... We introduce the idea of thesurvival time =() defined by t = max {u:(V n, {e u,e u+1, ...,e T }) }. We study in particular the case where isk-connectivity. We show that
  相似文献   

8.
IfK is a field of characteristic 0 then the following is shown. Iff, g, h: M n (K) K are non-constant solutions of the Binet—Pexider functional equation
  相似文献   

9.
Answering a question of Z. Daróczy we show that there are positive sequences n satisfying the recursion
  相似文献   

10.
LetC m be a compound quadrature formula, i.e.C m is obtained by dividing the interval of integration [a, b] intom subintervals of equal length, and applying the same quadrature formulaQ n to every subinterval. LetR m be the corresponding error functional. Iff (r) > 0 impliesR m [f] > 0 (orR m [f] < 0),=" then=" we=" say=">C m is positive definite (or negative definite, respectively) of orderr. This is the case for most of the well-known quadrature formulas. The assumption thatf (r) > 0 may be weakened to the requirement that all divided differences of orderr off are non-negative. Thenf is calledr-convex. Now letC m be positive definite or negative definite of orderr, and letf be continuous andr-convex. We prove the following direct and inverse theorems for the errorR m [f], where , denotes the modulus of continuity of orderr:
  相似文献   

11.
LetX be a locally compact abelian group and let a compact groupG act onX. We find solutionsf: X inL(X) of the following functional equation:
  相似文献   

12.
We solve the functional equation
  相似文献   

13.
A loopQ(·) is said to be anA l-loop (A r-loop) if x, y Q, l x,y AutQ (r x,y AutQ) hold, where
  相似文献   

14.
The purpose of this paper is to solve the following Pythagorean functional equation:(e p(x,y) ) 2 ) = q(x,y) 2 + r(x, y) 2, where each ofp(x,y), q(x, y) andr(x, y) is a real-valued unknown harmonic function of the real variablesx, y on the wholexy-planeR 2.The result is as follows.  相似文献   

15.
The functional equation
  相似文献   

16.
According to the Hobby-Rice theorem for anyn-dimensional subspaceU n ofL 1([a, b], ) ( positive, finite, nonatomic) there exist points =s 0x 1x m+1=b, where 0mn, such that
  相似文献   

17.
Given a pointx in a convex figureM, let(x) denote the number of all affine diameters ofM passing throughx. It is shown that, for a convex figureM, the following conditions are equivalent.
(i)  (x)2 for every pointx intM.
(ii)  either(x)3 or(x) on intM. Furthermore, the setB={x intM:(x) is either odd or infinite } is dense inM.
  相似文献   

18.
A -hyperfactorization ofK 2n is a collection of 1-factors ofK 2n for which each pair of disjoint edges appears in precisely of the 1-factors. We call a -hyperfactorizationtrivial if it contains each 1-factor ofK 2n with the same multiplicity (then =(2n–5)!!). A -hyperfactorization is calledsimple if each 1-factor ofK 2n appears at most once. Prior to this paper, the only known non-trivial -hyperfactorizations had one of the following parameters (or were multipliers of such an example)
(i)  2n=2 a +2, =1 (for alla3); cf. Cameron [3];
(ii)  2n=12, =15 or 2n=24, =495; cf. Jungnickel and Vanstone [8].
In the present paper we show the existence of non-trivial simple -hyperfactorizations ofK 2n for alln5.  相似文献   

19.
Letg(n,r) be the maximal order of an induced cycle in the Knesser graph Kn([n] r), whose vertices are ther-sets of [n]={1, ...,n} and whose adjacency relation is disjointness. Thusg(n, r) is the largestm for which there is a sequenceA 1,A 2,...,A m [n] ofr-sets withA i A j= if and only if |i-j|=1 orm–1. We prove that there is an absolute constantc>0 for which
c(2.587)^r $$ " align="middle" vspace="20%" border="0">  相似文献   

20.
It is shown that the following three limits
  相似文献   

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

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