首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 921 毫秒
1.
We prove that Basic Arithmetic, BA, has the de Jongh property, i.e., for any propositional formula A(p 1,..., p n ) built up of atoms p 1,..., p n , BPC \({\vdash}\) A(p 1,..., p n ) if and only if for all arithmetical sentences B 1,..., B n , BA \({\vdash}\) A(B 1,..., B n ). The technique used in our proof can easily be applied to some known extensions of BA.  相似文献   

2.
We look for conditions which make two ideals and in a noetherian ring A have the same form ideal in an associated graded ring GA(α). More precisely, when and and fi?f'iεα m m?0, ? i , we give a necessary and sufficient condition to have , involving the first syzygies modules both of (f1,...,fn) and (f'1,...,f'n); our proof is based on the Artin-Rees lemma. Finally we show that, when the sequence f1,...,fn is regular and for an integer q, then f1?f'i ? αq+1 ? i implies .  相似文献   

3.
We consider an algebraB n,m , over the field R with n+m generators xi,..., xn, ξ1,..., ηm, satisfying the following relations: (1') $$\left[ {x_k ,x_l } \right] \equiv x_k x_l - x_l x_k = 0,[x_k ,\xi _i ] = 0,$$ , (2') $$\left\{ {\xi _i ,\xi _j } \right\} \equiv \xi _i \xi _j + \xi _j \xi _i = 0$$ , where k,l =1, ..., n and i, j=1,..., m. In this algebra we define differentiation, integration, and also a group of automorphisms. We obtain an integration equation invariant with respect to this group, which coincides in the case m=0 with the equation for the change of variables in an integral, an equation whichis well known in ordinary analysis; in the case n=0 our equation coincides with F. A. Berezin's result [1, 3] for integration over a Grassman algebra.  相似文献   

4.
The variety \(\mathfrak{u}_{m,n} \) is defined by the system of n-ary operations ωi,..., ωm, the system of m-ary operations ?i,..., ?n, 1≤ m ≤ n, and the system of identities $$\begin{gathered} x_1 ...x_n \omega _1 ...x_1 ...x_n \omega _m \varphi _i = x_i (i = 1,...,n), \hfill \\ x_1 ...x_m \varphi _1 ...x_1 ...x_m \varphi _n \omega _j = x_j (i = 1,...,m), \hfill \\ \end{gathered} $$ It is proved in this paper that the subalgebra U of the free product \(\Pi _{i \in I}^* A_i \) of the algebras Ai (i ε I) can be expanded as the free product of nonempty intersections U ∩ Ai (i ε I) and a free algebra.  相似文献   

5.
A surface Γ=(f 1(X1,..., xm),...,f n(x1,..., xm)) is said to be extremal if for almost all points of Γ the inequality $$\parallel a_1 f_1 (x_1 , \ldots ,x_m ) + \ldots + a_n f_n (x_1 , \ldots ,x_m )\parallel< H^{ - n - \varepsilon } ,$$ , where H=max(¦a i¦) (i=1, 2, ..., n), has only a finite number of solutions in the integersa 1, ...,a n. In this note we prove, for a specific relationship between m and n and a functional condition on the functionsf 1, ...,f n, the extremality of a class of surfaces in n-dimensional Euclidean space.  相似文献   

6.
Given Banach space operators AB( ) and BB( ), let A?BB( ? ) denote the tensor product of A and B. Let σ a , σ aw and σ ab denote the approximate point spectrum, the Weyl approximate point spectrum and the Browder approximate point spectrum, respectively. Then σ aw (A?B) ? σ a (A aw (B) ? σ aw (A a (B) ? σ a (A ab (B) ? σ ab (A a (B) = σ ab (A?B), and a sufficient condition for the (a-Weyl spectrum) identity σ aw (A?B) = σ a (A aw (B) ? σ aw (A a (B) to hold is that σ aw (A?B) = σ ab (A?B). Equivalent conditions are proved in Theorem 1, and the problem of the transference of a-Weyl’s theorem for a-isoloid operators A and B to their tensor product A?B is considered in Theorem 2. Necessary and sufficient conditions for the (plain) Weyl spectrum identity are revisited in Theorem 3.  相似文献   

7.
In this paper, we are concerned with the following nth-order ordinary differential equation $$x^{(n)}(t)+f(t,x(t),x'(t),\ldots,x^{(n-1)}(t))=0,\quad t\in (0,1),$$ with the nonlinear boundary conditions $$\begin{array}{l}x^{(i)}(0)=0,\quad i=0,1,\ldots,n-3,\\[3pt]g(x^{(n-2)}(0),x^{(n-1)}(0),x(\xi_1),\ldots,x(\xi_{m-2}))=A,\\[3pt]h(x^{(n-2)}(1),x^{(n-1)}(1),x(\eta_1),\ldots,x(\eta_{l-2}))=B,\end{array}$$ here A,BR, f:[0,1]×R n R is continuous, g:[0,1]×R m R is continuous, h:[0,1]×R l R is continuous, ξ i ∈(0,1), i=1,…,m?2, and η j ∈(0,1), j=1,…,l?2. The existence result is given by using a priori estimate, Nagumo condition, the method of upper and lower solutions and Leray-Schauder degree. We also give an example to demonstrate our result.  相似文献   

8.
Sufficient conditions are found for the existence of multiparametric families of proper oscillatory and vanishing-at-infinity solutions of the differential equation $$u^{(n)} (t) = g\left( {t, u(\tau _0 (t)), \ldots ,u^{(m - 1)} (\tau _{m - 1} (t))} \right)$$ , wheren≥4,m is the integer part of π/2,g:R +×R m R is a function satisfying the local Carathéodory conditions, and τ i :R +R(i=0,...,m?1) are measurable functions such that τ i (t) →+∞ fort→+∞(i=0,...,m?1).  相似文献   

9.
Let SF(n) be the usual monoid of orientation- and base point-preserving self-equivalences of the n-sphere ${\mathbb{S}^n}$ n. If Y is a (right) SF(n)-space, one can construct a classifying space B(Y, SF(n), *)=B n for ${\mathbb{S}^n}$ n-fibrations with Y-structure, by making use of the two-sided bar construction. Let k: B n →BSF(n) be the forgetful map. A Y-structure on a spherical fibration corresponds to a lifting of the classifying map into B n . Let K i =K $\left( {{\mathbb{Z}_2 }} \right)$ , i) be the Eilenberg–Mac Lane space of type $\left( {{\mathbb{Z}_2 }} \right)$ , i). In this paper we study families of structures on a given spherical fibration. In particular, we construct a universal family of Y-structures, where Y=W n is a space homotopy equivalent to ∏ i≥1 K i . Applying results due to Booth, Heath, Morgan and Piccinini, we prove that the universal family is a spherical fibration over the space map{B n , B n B n . Furthermore, we point out the significance of this space for secondary characteristic classes. Finally, we calculate the cohomology of B n .  相似文献   

10.
For a positive integer n, the divisor function with congruence conditions d(n; l 1, M 1, l 2, M 2) denotes the number of factorizations n?=?n 1 n 2, where each of the factors ${n_i\in\mathbb{N}}$ belongs to a prescribed congruence class l i modulo M i ? (i?=?1, 2). In this paper we study the higher power moments of the error term in the asymptotic formula of ${\sum\nolimits_{n\leq M_1M_2x}d(n;l_1,M_1,l_2,M_2)}$ .  相似文献   

11.
We call A ? $ \mathbb{E} $ n cone independent of B ? $ \mathbb{E} $ n , the euclidean n-space, if no a = (a 1,..., a n ) ∈ A equals a linear combination of B \ {a} with non-negative coefficients. If A is cone independent of A we call A a cone independent set. We begin the analysis of this concept for the sets P(n) = {A ? {0, 1} n ? $ \mathbb{E} $ n : A is cone independent} and their maximal cardinalities c(n) ? max{|A| : AP(n)}. We show that lim n → ∞ $ \frac{{c\left( n \right)}}{{2^n }} $ > $\frac{1}{2}$ , but can't decide whether the limit equals 1. Furthermore, for integers 1 < k < ? ≤ n we prove first results about c n (k, ?) ? max{|A| : AP n (k, ?)}, where P n (k, ?) = {A : A ? V n k and V n ? is cone independent of A} and V n k equals the set of binary sequences of length n and Hamming weight k. Finding c n (k, ?) is in general a very hard problem with relations to finding Turan numbers.  相似文献   

12.
For an m × n matrix B = (b ij ) m×n with nonnegative entries b ij , let B(k, l) denote the set of all k × l submatrices of B. For each AB(k, l), let a A and g A denote the arithmetic mean and geometric mean of elements of A respectively. It is proved that if k is an integer in ( $\tfrac{m} {2}$ ,m] and l is an integer in ( $\tfrac{n} {2}$ , n] respectively, then $$\left( {\prod\limits_{A \in B\left( {k,l} \right)} {a_A } } \right)^{\tfrac{1} {{\left( {_k^m } \right)\left( {_l^n } \right)}}} \geqslant \frac{1} {{\left( {_k^m } \right)\left( {_l^n } \right)}}\left( {\sum\limits_{A \in B\left( {k,l} \right)} {g_A } } \right),$$ with equality if and only if b ij is a constant for every i, j.  相似文献   

13.
LetG be a finite abelian group,G?{Z n, Z2?Z2n}. Then every sequenceA={g 1,...,gt} of $t = \frac{{4\left| G \right|}}{3} + 1$ elements fromG contains a subsequenceB?A, |G|=|G| such that $\sum\nolimits_{g_i \in B^{g_i } } { = 0 (in G)} $ . This bound, which is best possible, extends recent results of [1] and [22] concerning the celebrated theorem of Erdös-Ginzburg-Ziv [21].  相似文献   

14.
For any rational functions with complex coefficients A(z),B(z), and C(z), where A(z), C(z) are not identically zero, we consider the sequence of rational functions H m (z) with generating function ∑H m (z)t m =1/(A(z)t 2+B(z)t+C(z)). We provide an explicit formula for the limiting pair correlation function of the roots of $\prod_{m=0}^{n}H_{m}(z)$ , as n→∞, counting multiplicities, on certain closed subarcs J of a curve $\mathcal{C}$ where the roots lie. We give an example where the limiting pair correlation function does not exist if J contains the endpoints of $\mathcal{C}$ .  相似文献   

15.
We study the algebraic independence of values of the Ramanujan q-series $A_{2j+1}(q)=\sum_{n=1}^{\infty}n^{2j+1}q^{2n}/(1-q^{2n})$ or S 2j+1(q) (j≥0). It is proved that, for any distinct positive integers i, j satisfying $(i,j)\not=(1,3)$ and for any $q\in \overline{ \mathbb{Q}}$ with 0<|q|<1, the numbers A 1(q), A 2i+1(q), A 2j+1(q) are algebraically independent over $\overline{ \mathbb{Q}}$ . Furthermore, the q-series A 2i+1(q) and A 2j+1(q) are algebraically dependent over $\overline{ \mathbb{Q}}(q)$ if and only if (i,j)=(1,3).  相似文献   

16.
A simple matrix is a (0,1)-matrix with no repeated columns. For a (0,1)-matrix F, we say that a (0,1)-matrix A has F as a configuration if there is a submatrix of A which is a row and column permutation of F (trace is the set system version of a configuration). Let \({\|A\|}\) denote the number of columns of A. We define \({{\rm forb}(m, F) = {\rm max}\{\|A\| \,:\, A}\) is m-rowed simple matrix and has no configuration F. We extend this to a family \({\mathcal{F} = \{F_1, F_2, \ldots , F_t\}}\) and define \({{\rm forb}(m, \mathcal{F}) = {\rm max}\{\|A\| \,:\, A}\) is m-rowed simple matrix and has no configuration \({F \in \mathcal{F}\}}\) . We consider products of matrices. Given an m 1 × n 1 matrix A and an m 2 × n 2 matrix B, we define the product A × B as the (m 1m 2) × n 1 n 2 matrix whose columns consist of all possible combinations obtained from placing a column of A on top of a column of B. Let I k denote the k × k identity matrix, let \({I_k^{c}}\) denote the (0,1)-complement of I k and let T k denote the k × k upper triangular (0,1)-matrix with a 1 in position i, j if and only if i ≤ j. We show forb(m, {I 2 × I 2, T 2 × T 2}) is \({\Theta(m^{3/2})}\) while obtaining a linear bound when forbidding all 2-fold products of all 2 × 2 (0,1)-simple matrices. For two matrices F, P, where P is m-rowed, let \({f(F, P) = {\rm max}_{A} \{\|A\| \,:\,A}\) is m-rowed submatrix of P with no configuration F}. We establish f(I 2 × I 2, I m/2 × I m/2) is \({\Theta(m^{3/2})}\) whereas f(I 2 × T 2, I m/2 × T m/2) and f(T 2 × T 2, T m/2 × T m/2) are both \({\Theta(m)}\) . Additional results are obtained. One of the results requires extensive use of a computer program. We use the results on patterns due to Marcus and Tardos and generalizations due to Klazar and Marcus, Balogh, Bollobás and Morris.  相似文献   

17.
We consider the problem of scheduling two agents A and B on a set of m uniform parallel machines. Each agent is assumed to be independent from the other: agent A and agent B are made up of n A and n B jobs, respectively. Each job is defined by its processing time and possibly additional data such as a due date, a weight, etc., and must be processed on a single machine. All machines are uniform, i.e. each machine has its own processing speed. Notice that we consider the special case of equal-size jobs, i.e. all jobs share the same processing time. Our goal is to minimize two maximum functions associated with agents A and B and referred to as $F_{max}^{A}=\max_{i\in A} f^{A}_{i}(C_{i})$ and $F_{max}^{B}=\max_{i\in B}f^{B}_{i}(C_{i})$ , respectively, with C i the completion time of job i and $f_{i}^{X}$ a non-decreasing function. These kinds of problems are called multi-agent scheduling problems. As we are dealing with two conflicting criteria, we focus on the calculation of the strict Pareto optima for the $(F_{max}^{A}, F_{max}^{B} )$ criteria vector. In this paper we develop a minimal complete Pareto set enumeration algorithm with time complexity and memory requirements.  相似文献   

18.
19.
In this paper, we study integral operators of the form Tαf(x)=∫Rn|x-A1y|-α1 ··· |x-Amy|-αmf(y)dy,where Ai are certain invertible matrices, αi 0, 1 ≤ i ≤ m, α1 + ··· + αm = n-α, 0 ≤α n. For 1/q = 1/p-α/n , we obtain the Lp (Rn, wp)-Lq(Rn, wq) boundedness for weights w in A(p, q) satisfying that there exists c 0 such that w(Aix) ≤ cw(x), a.e. x ∈ Rn , 1 ≤ i ≤ m.Moreover, we obtain theappropriate weighted BMO and weak type estimates for certain weights satisfying the above inequality. We also give a Coifman type estimate for these operators.  相似文献   

20.
Ikramov  Kh. D.  Nazari  A. M. 《Mathematical Notes》2004,75(5-6):608-616
Let A be a complex matrix of order n with n ≥ 3. We associate with A the 3n × 3n matrix $Q\left( {\gamma } \right) = \left( \begin{gathered} A \gamma _1 I_n \gamma _3 I_n \\ 0 A \gamma _2 I_n \\ 0 0 A \\ \end{gathered} \right)$ where $\gamma _1 ,\gamma _2 ,\gamma _3 $ are scalar parameters and γ=(γ123). Let σi, 1 ≤ i ≤ 3n, be the singular values of Q(γ) in the decreasing order. We prove that, for a normal matrix A, its 2-norm distance from the set $\mathcal{M}$ of matrices with a zero eigenvalue of multiplicity at least 3 is equal to $\mathop {max}\limits_{\gamma _1 ,\gamma _2 \geqslant 0,\gamma _3 \in \mathbb{C}} \sigma _{3n - 2} (Q\left( \gamma \right)).$ This fact is a refinement (for normal matrices) of Malyshev's formula for the 2-norm distance from an arbitrary n × n matrix A to the set of n × n matrices with a multiple zero eigenvalue.  相似文献   

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

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