首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
A theorem of the alternatives for the equation \({|Ax|-|B||x|=b\ (A,B\in{\mathbb{R}}^{n\times n},\, b\in{\mathbb{R}}^n)}\) is proved and several consequences are drawn. In particular, a class of matrices A, B is identified for which the equation has exactly 2 n solutions for each positive right-hand side b.  相似文献   

2.
We completely describe ranges of η-functions of η-like linear orderings without computable presentations.  相似文献   

3.
This paper deals with some properties of α1-matrices and α2-matrices which are subclasses of nonsingular H-matrices. In particular, new characterizations of these two subclasses are given, and then used for proving algebraic properties related to subdirect sums and Hadamard products.  相似文献   

4.
Sufficient conditions for the blow-up of nontrivial generalized solutions of the interior Dirichlet problem with homogeneous boundary condition for the homogeneous elliptic-type equation Δu + q(x)u = 0, where either q(x) ≠ const or q(x) = const= λ > 0, are obtained. A priori upper bounds (Theorem 4 and Remark 6) for the exact constants in the well-known Sobolev and Steklov inequalities are established.  相似文献   

5.
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The crossing numbers of GC n for some graphs G on five and six vertices and the cycle C n are also given. In this paper, we extend these results by determining the crossing number of the Cartesian product GC n , where G is a specific graph on six vertices.  相似文献   

6.
For a commutative ring A with identity, and for infinite cardinals α as well as the symbol ∞, which indicates the situation in which there are no cardinal restrictions, one defines A to be α-regular if for each subset D of A, with |D| < α and de = 0, for any two distinct d, eD, there is an sA such that d 2 s = d, for each dD, and if xd = 0, for each dD, then xs = 0  相似文献   

7.
We reveal a relation between the operations of α-completion and closure for the systems of functions of a k-valued logic. For k = 3, 4 we construct the α-bases consisting of two binary operations. We prove that the complete system T of functions of a 4-valued logic containing all permutations of the set E 4 = {0, 1, 2, 3} and the operation of addition modulo 4 is not α-complete, whereas its α-completion [T α] will be an α-complete system.  相似文献   

8.
We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x/(log x)1+o(1) numbers not exceeding x common to the ranges of φ and σ. Here φ is Euler’s totient function and σ is the sum-of-divisors function.  相似文献   

9.
We introduce the so-called g-α-irresolute functions in generalized topological spaces. We obtain some properties and several characterizations of this type of functions.  相似文献   

10.
Let X be a set and the full transformation semigroup on X. Let ρ be an equivalence relation on X and
Then T(X,ρ) is a subsemigroup of . In this note, we describe the equivalence relations ρ on X for which in the semigroup T(X,ρ).  相似文献   

11.
We use the method of local representation and original method of Brauer to study the block with K(B)−L(B)=1, and get some properties on the defect group and the structure of this kind of blocks. Then, we show that K(B) conjecture holds for this kind of blocks.  相似文献   

12.
We investigate the relation between analytic Campanato spaces \(\mathcal {AL}_{p,s}\) and the spaces F(pqs), characterize the bounded and compact Riemann–Stieltjes operators from \(\mathcal {AL}_{p,s}\) to \(F(p,p-s-1,s)\). We also describe the corona theorem and the interpolating sequences for the class \(F(p,p-2,s)\), which is the Möbius invariant subspace of the analytic Besov type spaces \(B_p(s)\).  相似文献   

13.
Crossing numbers of graphs are in general very difficult to compute. There are several known exact results on the crossing number of the Cartesian products of paths, cycles or stars with small graphs. In this paper we study cr(KmPn), the crossing number of the Cartesian product KmPn. We prove that for m ≥ 3,n ≥ 1 and cr(KmPn)≥ (n − 1)cr(Km+2e) + 2cr(Km+1). For m≤ 5, according to Klešč, Jendrol and Ščerbová, the equality holds. In this paper, we also prove that the equality holds for m = 6, i.e., cr(K6Pn) = 15n + 3. Research supported by NFSC (60373096, 60573022).  相似文献   

14.
A lot of research has been done on the spectrum of the sizes of maximal partial spreads in PG(3,q) [P. Govaerts and L. Storme, Designs Codes and Cryptography, Vol. 28 (2003) pp. 51–63; O. Heden, Discrete Mathematics, Vol. 120 (1993) pp. 75–91; O. Heden, Discrete Mathematics, Vol. 142 (1995) pp. 97–106; O. Heden, Discrete Mathematics, Vol. 243 (2002) pp. 135–150]. In [A. Gács and T. Sznyi, Designs Codes and Cryptography, Vol. 29 (2003) pp. 123–129], results on the spectrum of the sizes of maximal partial line spreads in PG(N,q), N 5, are given. In PG(2n,q), n 3, the largest possible size for a partial line spread is q2n-1+q2n-3+...+q3+1. The largest size for the maximal partial line spreads constructed in [A. Gács and T. Sznyi, Designs Codes and Cryptography, Vol. 29 (2003) pp. 123–129] is (q2n+1q)/(q2–1)–q3+q2–2q+2. This shows that there is a non-empty interval of values of k for which it is still not known whether there exists a maximal partial line spread of size k in PG(2n,q). We now show that there indeed exists a maximal partial line spread of size k for every value of k in that interval when q 9.J. Eisfeld: Supported by the FWO Research Network WO.011.96NP. Sziklai: The research of this author was partially supported by OTKA D32817, F030737, F043772, FKFP 0063/2001 and Magyary Zoltan grants. The third author is grateful for the hospitality of Ghent University.  相似文献   

15.
In the present paper we consider a q-analog of t–(v,k,)-designs. It is canonic since it arises by replacing sets by vector spaces over GF(q), and their orders by dimensions. These generalizations were introduced by Thomas [Geom.Dedicata vol. 63, pp. 247–253 (1996)] they are called t –(v,k,;q)- designs. A few of such q-analogs are known today, they were constructed using sophisticated geometric arguments and case-by-case methods. It is our aim now to present a general method that allows systematically to construct such designs, and to give complete catalogs (for small parameters, of course) using an implemented software package. &nbsp; In order to attack the (highly complex) construction, we prepare them for an enormous data reduction by embedding their definition into the theory of group actions on posets, so that we can derive and use a generalization of the Kramer-Mesner matrix for their definition, together with an improved version of the LLL-algorithm. By doing so we generalize the methods developed in a research project on t –(v,k,)-designs on sets, obtaining this way new results on the existence of t–(v,k,;q)-designs on spaces for further quintuples (t,v,k,;q) of parameters. We present several 2–(6,3,;2)-designs, 2–(7,3,;2)-designs and, as far as we know, the very first 3-designs over GF(q).classification 05B05  相似文献   

16.
We give a period formula for the adelic Ikeda lift of an elliptic modular form f for U(mm) in terms of special values of the adjoint L-functions of f. This is an adelic version of Ikeda’s conjecture on the period of the classical Ikeda lift for U(mm).  相似文献   

17.
In this paper, we show the regularity in Morrey spaces L2, for the gradient of minimizers of quasilinear functionals of the type We allow VMO dependence on the variable x and continuous dependence on the variable u.  相似文献   

18.
A generalization of the concept of parallel-sequential switching circuits (π-circuits) to the case when the variables assigned to contacts can take not two, as in the Boolean case, but a greater number of values. The conductivity of the contact is still two-valued (the contact is either closed or open). A lower bound is obtained on the complexity of these circuits computing the q-ary counter of multiplicity q, i.e., the function φ q : {0, 1, …, q − 1} n → {0, 1} that equals 1 if the sum of values of its variables is a multiple of q.  相似文献   

19.
The notion of derivatives for smooth representations of GL(n, ? p ) was defined in [BZ77]. In the archimedean case, an analog of the highest derivative was defined for irreducible unitary representations in [Sah89] and called the “adduced” representation. In this paper we define derivatives of all orders for smooth admissible Fréchet representations of moderate growth. The real case is more problematic than the p-adic case; for example, arbitrary derivatives need not be admissible. However, the highest derivative continues being admissible, and for irreducible unitarizable representations coincides with the space of smooth vectors of the adduced representation.In the companion paper [AGS] we prove exactness of the highest derivative functor, and compute highest derivatives of all monomial representations.We apply those results to finish the computation of adduced representations for all irreducible unitary representations and to prove uniqueness of degenerate Whittaker models for unitary representations, thus completing the results of [Sah89, Sah90, SaSt90, GS13a].  相似文献   

20.
Using Tilli’s technique [Cal Var 25(3):395–401, 2006], we shall give a new proof of the regularity of the local minima of the functional
$J\left( u\right) =\int\limits_{\Omega } \left\vert \partial u\right\vert^{p}\,dx$
with Ω a domain of class C 0, 1 in \({\mathbb{R}^{n}}\) and 2 ≤ p < n.
  相似文献   

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

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