首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
We generalize the elementary methods presented in several examples in the book [FZ] to obtain the Thomae formulae for general fully ramified Z n curves.  相似文献   

2.
An edge-coloring of a graph G is an assignment of colors to all the edges of G. A g c -coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v) times. The maximum integer k such that G has a g c -coloring with k colors is called the g c -chromatic index of G and denoted by \(\chi\prime_{g_{c}}\)(G). In this paper, we extend a result on edge-covering coloring of Zhang and Liu in 2011, and give a new sufficient condition for a simple graph G to satisfy \(\chi\prime_{g_{c}}\)(G) = δ g (G), where \(\delta_{g}\left(G\right) = min_{v\epsilon V (G)}\left\{\lfloor\frac{d\left(v\right)}{g\left(v\right)}\rfloor\right\}\).  相似文献   

3.
Given 1≤ p,q < ∞, let BLpLq be the class of all Banach lattices X such that X is isometrically lattice isomorphic to a band in some Lp(Lq)-Banach lattice. We show that the range of a positive contractive projection on any BLpLq-Banach lattice is itself in BLpLq. It is a consequence of this theorem and previous results that BLpLq is first-order axiomatizable in the language of Banach lattices. By studying the pavings of arbitrary BLpLq-Banach lattices by finite dimensional sublattices that are themselves in this class, we give an explicit set of axioms for BLpLq. We also consider the class of all sublattices of Lp(Lq)-Banach lattices; for this class (when p/q is not an integer) we give a set of axioms that are similar to Krivine’s well-known axioms for the subspaces of Lp-Banach spaces (when p/2 is not an integer). We also extend this result to the limiting case q = ∞.  相似文献   

4.
We prove that for a fixed integer s2 every K s,s -free graph of average degree at least r contains a K p minor where . A well-known conjecture on the existence of dense K s,s -free graphs would imply that the value of the exponent is best possible. Our result implies Hadwigers conjecture for K s,s -free graphs whose chromatic number is sufficiently large compared with s.  相似文献   

5.
For p > 0, the l n,p -generalized surface measure on the l n,p -unit sphere is studied and used for deriving a geometric measure representation for l n,p -symmetric distributions having a density.  相似文献   

6.
We consider the spectral resolution of a Uq (sl 2)-invariant solution R of the constant Yang–Baxter equation in the braid group form. It is shown that if the two highest coefficients in this resolution are not equal, then R is either the Drinfeld R-matrix or its inverse. Bibliography: 13 titles.  相似文献   

7.
With the objective of generating “shape-preserving” smooth interpolating curves that represent data with abrupt changes in magnitude and/or knot spacing, we study a class of first-derivative-based -smooth univariate cubic L 1 splines. An L 1 spline minimizes the L 1 norm of the difference between the first-order derivative of the spline and the local divided difference of the data. Calculating the coefficients of an L 1 spline is a nonsmooth non-linear convex program. Via Fenchel’s conjugate transformation, the geometric dual program is a smooth convex program with a linear objective function and convex cubic constraints. The dual-to-primal transformation is accomplished by solving a linear program.  相似文献   

8.
In this paper we consider n-poised planar node sets, as well as more special ones, called G C n sets. For the latter sets each n-fundamental polynomial is a product of n linear factors as it always holds in the univariate case. A line ? is called k-node line for a node set \(\mathcal X\) if it passes through exactly k nodes. An (n + 1)-node line is called maximal line. In 1982 M. Gasca and J. I. Maeztu conjectured that every G C n set possesses necessarily a maximal line. Till now the conjecture is confirmed to be true for n ≤ 5. It is well-known that any maximal line M of \(\mathcal X\) is used by each node in \(\mathcal X\setminus M, \)meaning that it is a factor of the fundamental polynomial. In this paper we prove, in particular, that if the Gasca-Maeztu conjecture is true then any n-node line of G C n set \(\mathcal {X}\) is used either by exactly \(\binom {n}{2}\) nodes or by exactly \(\binom {n-1}{2}\) nodes. We prove also similar statements concerning n-node or (n ? 1)-node lines in more general n-poised sets. This is a new phenomenon in n-poised and G C n sets. At the end we present a conjecture concerning any k-node line.  相似文献   

9.
Convergence of the greedy algorithm in Walsh system in L p , p > 1 is studied. It is proved that there exists a function in L p , 1 < p < 2, with greedy algorithm not converging in measure to that function. A continuous function with divergent in L p , p > 2, greedy algorithm is constructed and sufficient conditions for convergence of the greedy algorithm in L p , p > 1 are given.  相似文献   

10.
Suppose that D is a bounded domain with a piecewise C^1 smooth boundary in C^n. Let ψ∈C^1 α(δD). By using the Hadamard principal value of the higher order singular integral and solid angle coefficient method of points on the boundary, we give the Plemelj formula of the higher order singular integral with the Boehner-Martinelli kernel, which has integral density ψ. Moreover, by means of the Plemelj formula and methods of complex partial differential equations, we discuss the corresponding Cauehy boundary value problem with the Boehner-Martinelli kernel on a closed piecewise smooth manifold and obtain its unique branch complex harmonic solution.  相似文献   

11.
12.
Let M n (K) be the algebra of all n × n matrices over an infinite field K. This algebra has a natural ℤ n -grading and a natural ℤ-grading. Finite bases for its ℤ n -graded identities and for its ℤ-graded identities are known. In this paper we describe finite generating sets for the ℤ n -graded and for the ℤ-graded central polynomials for M n (K) Partially supported by CNPq 620025/2006-9  相似文献   

13.
Yan QU 《数学学报(英文版)》2007,23(10):1903-1908
Let π be an irreducible unitary cuspidal representation of GLm(AQ) with m ≥ 2, and L(s, Tr) the L-function attached to π. Under the Generalized Riemann Hypothesis for L(s,π), we estimate the normal density of primes in short intervals for the automorphic L-function L(s, π). Our result generalizes the corresponding theorem of Selberg for the Riemann zeta-function.  相似文献   

14.
A Shilla graph is defined as a distance-regular graph of diameter 3 with second eigen-value θ1 equal to a3. For a Shilla graph, let us put a = a3 and b = k/a. It is proved in this paper that a Shilla graph with b2 = c2 and noninteger eigenvalues has the following intersection array:
$$\left\{ {\frac{{{b^2}\left( {b - 1} \right)}}{2},\frac{{\left( {b - 1} \right)\left( {{b^2} - b + 2} \right)}}{2},\frac{{b\left( {b - 1} \right)}}{4};1,\frac{{b\left( {b - 1} \right)}}{4},\frac{{b{{\left( {b - 1} \right)}^2}}}{2}} \right\}$$
If Γ is a Q-polynomial Shilla graph with b2 = c2 and b = 2r, then the graph Γ has intersection array
$$\left\{ {2tr\left( {2r + 1} \right),\left( {2r + 1} \right)\left( {2rt + t + 1} \right),r\left( {r + t} \right);1,r\left( {r + t} \right),t\left( {4{r^2} - 1} \right)} \right\}$$
and, for any vertex u in Γ, the subgraph Γ3(u) is an antipodal distance-regular graph with intersection array
$$\left\{ {t\left( {2r + 1} \right),\left( {2r - 1} \right)\left( {t + 1} \right),1;1,t + 1,t\left( {2r + 1} \right)} \right\}$$
The Shilla graphs with b2 = c2 and b = 4 are also classified in the paper.
  相似文献   

15.
Let λK m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K p,q -factorization of λK m,n is a set of edge-disjoint K p,q -factors of λK m,n which partition the set of edges of λK m,n . When p = 1 and q is a prime number, Wang, in his paper [On K 1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K 1,q -factorization of K m,n and gave a sufficient condition for such a factorization to exist. In papers [K 1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK m,n to have a K p,q -factorization. As a special case, it is shown that the necessary condition for the K p,q -factorization of λK m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.  相似文献   

16.
Novikov superalgebras are related to quadratic conformal superalgebras which correspond to the Hamiltonian pairs and play a fundamental role in completely integrable systems. In this note we show that the Novikov superalgebras with A 0 = A 1 A 1 and dim A 1 = 2 are of type N and give a class of Novikov superalgebras of type S with A 0 = A 1 A 1.  相似文献   

17.
Given a unilateral forward shift S acting on a complex, separable, innite dimensional Hilbert space H, an asymptotically S-Toeplitz operator is a bounded linear operator T on H satisfying that {S* n TS n } is convergent with respect to one of the topologies commonly used in the algebra of bounded linear operators on H. In this paper, we study the asymptotic T u -Toeplitzness of weighted composition operators on the Hardy space H2, where u is a nonconstant inner function.  相似文献   

18.
The lattice vertex operator algebra VL associated to a positive definite even lattice L has an automorphism of order 2 lifted from –1-isometry of L. The fixed point set VL+ of VL for the automorphism is naturally a vertex operator algebra. We prove that any 0-graded weak VL+-module is completely reducible.Supported by JSPS Research Fellowships for Young Scientists.  相似文献   

19.
We study the structure of the semigroup OT n , which is a unique (up to an isomorphism) R-section of the semigroup T n . For this semigroup, we describe Green relations, determine regular and nilpotent elements, describe maximal nilpotent subsemigroups, and determine the unique irreducible system of generatrices and maximal subsemigroups.  相似文献   

20.
Cyclic codes over an infinite family of rings are defined. The general properties of cyclic codes over these rings are studied, in particular nontrivial one-generator cyclic codes are characterized. It is also proved that the binary images of cyclic codes over these rings under the natural Gray map are binary quasi-cyclic codes of index 2 k . Further, several optimal or near optimal binary codes are obtained from cyclic codes over R k via this map.  相似文献   

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

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