共查询到20条相似文献,搜索用时 167 毫秒
1.
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]. 相似文献
2.
E. E. Marenich 《Journal of Mathematical Sciences》2009,163(6):732-738
It is proved that every (n × n) Boolean matrix can be expressed as a product of primes and elementary matrices in the semigroup of Boolean matrices. 相似文献
3.
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. 相似文献
4.
The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted by χ
t
(G). If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χ
et
(G). In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order.
Supported by the National Natural Science Foundation of China (No. 10771091). 相似文献
5.
Tiziano Granucci 《Annali dell'Universita di Ferrara》2010,56(2):283-293
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 functionalwith Ω a domain of class C 0, 1 in \({\mathbb{R}^{n}}\) and 2 ≤ p < n.
相似文献
$J\left( u\right) =\int\limits_{\Omega } \left\vert \partial u\right\vert^{p}\,dx$
6.
We study coherent systems of type (n, d, n + 1) on a Petri curve X of genus g ≥ 2. We describe the geometry of the moduli space of such coherent systems for large values of the parameter α. We determine the top critical value of α and show that the corresponding “flip” has positive codimension. We investigate also the non-emptiness of the moduli space
for smaller values of α, proving in many cases that the condition for non-emptiness is the same as for large α. We give some detailed results for g ≤ 5 and applications to higher rank Brill–Noether theory and the stability of kernels of evaluation maps, thus proving Butler’s
conjecture in some cases in which it was not previously known.
The authors are members of the research group VBAC (Vector Bundles on Algebraic Curves). The first two authors were supported
by EPSRC grant GR/T22988/01 for a visit to the University of Liverpool. The second author acknowledges the support of CONACYT
grant 48263-F. The third author thanks CIMAT, Guanajuato, México and California State University Channel Islands, where a
part of this paper was completed, and acknowledges support from the Academia Mexicana de Ciencias, under its exchange agreement
with the Royal Society of London. 相似文献
7.
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+1–q)/(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. 相似文献
8.
There is a natural duality between orbits of a real form G of a complex semisimple group G
on a homogeneous rational manifold Z=G
/P and those of the complexification K
of any of its maximal compact subgroups K: (,) is a dual pair if is a K-orbit. The cycle space C() is defined to be the connected component containing the identity of the interior of {g:g() is non-empty and compact}. Using methods which were recently developed for the case of open G-orbits, geometric properties of cycles are proved, and it is shown that C() is contained in a domain defined by incidence geometry. In the non-Hermitian case this is a key ingredient for proving that C() is a certain explicitly computable universal domain.Research of the first author partially supported by Schwerpunkt Global methods in complex geometry and SFB-237 of the Deutsche Forschungsgemeinschaft.The second author was supported by a stipend of the Deutsche Akademische Austauschdienst. 相似文献
9.
In this paper theI andII regularn-simplices are introduced. We prove that the sufficient and necessary conditions for existence of anI regularn-simplex in ℝ
n
are that ifn is even thenn = 4m(m + 1), and ifn is odd thenn = 4m + 1 with thatn + 1 can be expressed as a sum of two integral squares orn = 4m - 1, and that the sufficient and necessary condition for existence of aII regularn-simplex in ℝ
n
isn = 2m
2 - 1 orn = 4m(m + 1)(m ∈ ℕ). The connection between regularn-simplex in ℝ
n
and combinational design is given. 相似文献
10.
In this paper, we use the normalized Ricci–DeTurk flow to prove a stability result for strictly stable conformally compact Einstein manifolds. As an application, we show a local volume comparison of conformally compact manifolds with scalar curvature R ≥ ?n (n ? 1) and also the rigidity result when certain relative volume is zero. 相似文献
11.
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(Km □ Pn), the crossing number of the Cartesian product Km □ Pn. We prove that
for m ≥ 3,n ≥ 1 and cr(Km □ Pn)≥ (n − 1)cr(Km+2 − e) + 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(K6 □ Pn) = 15n + 3.
Research supported by NFSC (60373096, 60573022). 相似文献
12.
Tao Feng 《Designs, Codes and Cryptography》2009,51(2):175-194
Let D be a (v, k, λ)-difference set in an abelian group G, and (v, 31) = 1. If n = 5p
r
with p a prime not dividing v and r a positive integer, then p is a multiplier of D. In the case 31|v, we get restrictions on the parameters of such difference sets D for which p may not be a multiplier.
相似文献
13.
In this paper, the structure of the critical group of the graph K
m
× C
n
is determined, where m, n ≥ 3. 相似文献
14.
The Clausen functions appear in many problems, such as in the computation of singular integrals, quantum field theory, and
so on. In this paper, we consider the Clausen functions Cl
n
(θ) with n≥2. An efficient algorithm for evaluating them is suggested and the corresponding convergence analysis is established. Finally,
some numerical examples are presented to show the efficiency of our algorithm. 相似文献
15.
Emília Draženská 《Mathematica Slovaca》2011,61(5):675-686
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 G□C
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 G □ C
n
, where G is a specific graph on six vertices. 相似文献
16.
In this paper we give an explicit construction of basis matrices for a (k, n)-visual cryptography scheme \((k,n){\hbox {-}}\mathrm{VCS}\) for integers k and n with \(2\le k \le n\). In balanced VCS every set of participants with equal cardinality has same relative contrast. The VCS constructed in this paper is a balanced \((k,n){\hbox {-}}\mathrm{VCS}\) for general k. Also we obtain a formula for pixel expansion and relative contrast. We also prove that our construction gives optimal contrast and minimum pixel expansion when \(k=n\) and \(n-1\). 相似文献
17.
Sh. M. Nasibov 《Mathematical Notes》2017,101(1-2):123-131
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. 相似文献
18.
The simple incidence structure , formed by the points and the unordered pairs of distinct parallel lines of a finite affine plane of order n > 4, is a 2 – (n
2,2n,2n–1) design with intersection numbers 0,4,n. In this paper, we show that the converse is true, when n ≥ 5 is an odd integer.
Supported by M.I.U.R., Università di Palermo. 相似文献
19.
We assign to each pair of positive integers n and k ⩾ 2 a digraph G(n, k) whose set of vertices is H = {0, 1, ..., n − 1} and for which there is a directed edge from a ∈ H to b ∈ H if a
k
≡ b (mod n). We investigate the structure of G(n, k). In particular, upper bounds are given for the longest cycle in G(n, k). We find subdigraphs of G(n, k), called fundamental constituents of G(n, k), for which all trees attached to cycle vertices are isomorphic. 相似文献
20.
Wolfgang A. Schmid 《Abhandlungen aus dem Mathematischen Seminar der Universit?t Hamburg》2009,79(1):25-35
Let H be a Krull monoid with finite class group such that each class contains a prime divisor (e.g., the multiplicative monoid
of the ring of algebraic integers of some number field). It is shown that it can be determined whether the class group is
of the form ℤ/nℤ⊕ℤ/nℤ, for n≥3, just by considering the system of sets of lengths of H.
Supported by the Austrian Science Fund FWF (Project P18779-N13). 相似文献