Intersection theory of algebraic obstructions

Let A be a noetherian commutative ring of dimension d and L be a rank one projectiveA-module. For 1≤r≤d, we define obstruction groups E^r(A,L). This extends the original definition due to Nori, in the case r=d. These groups would be called Euler class groups. In analogy to intersection theory in algebraic geometry, we define a product (intersection) E^r(A,A)×E^s(A,A)→E^r+s(A,A). For a projective A-module Q of rank n≤d, with an orientation , we define a Chern class like homomorphism

w(Q,χ):E^d−n(A,L^′)→E^d(A,LL^′),     

A sufficient condition for pancyclability of graphs

Let G be a graph of order n and S be a vertex set of q vertices. We call G,S-pancyclable, if for every integer i with 3≤i≤q there exists a cycle C in G such that |V(C)∩S|=i. For any two nonadjacent vertices u,v of S, we say that u,v are of distance two in S, denoted by d_S(u,v)=2, if there is a path P in G connecting u and v such that |V(P)∩S|≤3. In this paper, we will prove that if G is 2-connected and for all pairs of vertices u,v of S with d_S(u,v)=2, , then there is a cycle in G containing all the vertices of S. Furthermore, if for all pairs of vertices u,v of S with d_S(u,v)=2, , then G is S-pancyclable unless the subgraph induced by S is in a class of special graphs. This generalizes a result of Fan [G. Fan, New sufficient conditions for cycles in graphs, J. Combin. Theory B 37 (1984) 221-227] for the case when S=V(G).     

On the varieties of special divisors

Based on a relation between the varieties W_d^r(C) of special divisors on a curve C and subloci of effective divisors on C imposing a suitable number of conditions on a certain linear series we develop a tool for the construction of irreducible components of W_d^r(C). Using this we discover new irreducible components of W_d^r(C), for a general k-gonal curve C of genus g, and in some cases we can identify the duals of these components in K_C − W_d^r(C) = W_d′^r′(C)(d′ = 2g − 2 − d, r′ = g − 1 − d + r).     

非双倍测度的Marcinkiewicz积分交换子的加权估计

设μ是R~d上的非负Radon测度,且满足增长性条件:存在一正常数C_0,使得对任意的x∈R~d和r0,有μ(B(x,r))≤C_0r~n,其中0n≤d.该文研究了相关于非双倍测度μ的Marcinkiewicz积分与RBMO函数生成的交换子,得到了这类交换子的加A_p~p(μ)权的弱型估计.     

Schur-class multipliers on the Arveson space: De Branges-Rovnyak reproducing kernel spaces and commutative transfer-function realizations

An interesting and recently much studied generalization of the classical Schur class is the class of contractive operator-valued multipliers S(λ) for the reproducing kernel Hilbert space H(kd) on the unit ball Bd⊂Cd, where kd is the positive kernel kd(λ,ζ)=1/(1−〈λ,ζ〉) on Bd. The reproducing kernel space H(KS) associated with the positive kernel KS(λ,ζ)=(I−S(λ)S^∗(ζ))⋅kd(λ,ζ) is a natural multivariable generalization of the classical de Branges-Rovnyak canonical model space. A special feature appearing in the multivariable case is that the space H(KS) in general may not be invariant under the adjoints of the multiplication operators on H(kd). We show that invariance of H(KS) under for each j=1,…,d is equivalent to the existence of a realization for S(λ) of the form S(λ)=D+C⁻¹(I−λ₁A₁−?−λdAd)(λ₁B₁+?+λdBd) such that connecting operator has adjoint U^∗ which is isometric on a certain natural subspace (U is “weakly coisometric”) and has the additional property that the state operators A₁,…,Ad pairwise commute; in this case one can take the state space to be the functional-model space H(KS) and the state operators A₁,…,Ad to be given by (a de Branges-Rovnyak functional-model realization). We show that this special situation always occurs for the case of inner functions S (where the associated multiplication operator MS is a partial isometry), and that inner multipliers are characterized by the existence of such a realization such that the state operators A₁,…,Ad satisfy an additional stability property.     

Slight improvements of the Singleton bound

The problem of determining A_q(n,d), the maximum cardinality of a q-ary code of length n with minimum distance at least d, is considered in some cases where corresponding MDS codes do not exist. Slight improvements of the Singleton bound are given, including A_q(q+2,q)?q³-3 if q is odd, A₅(7,5)?5³-4 and A₁₆(18,15)?18⁴-4.     

Brill-Gordan loci, transvectants and an analogue of the Foulkes conjecture

The hypersurfaces of degree d in the projective space Pn correspond to points of PN, where . Now assume d=2e is even, and let X(n,d)⊆PN denote the subvariety of two e-fold hyperplanes. We exhibit an upper bound on the Castelnuovo regularity of the ideal of X(n,d), and show that this variety is r-normal for r?2. The latter result is representation-theoretic, and says that a certain GLn+1-equivariant morphism

Sr(S2e(Cn+1))→S₂(Sre(Cn+1))     

A Generalisation of Tverberg’s Theorem

We will prove the following generalisation of Tverberg’s Theorem: given a set S⊂ℝ ^d of (r+1)(k−1)(d+1)+1 points, there is a partition of S in k sets A ₁,A ₂,…,A _k such that for any C⊂S of at most r points, the convex hulls of A ₁\C,A ₂\C,…,A _k \C are intersecting. This was conjectured first by Natalia García-Colín (Ph.D. thesis, University College of London, 2007).     

Quantum complexity of the approximation for the classes B(Wp ([0, 1])) and B(Hp ([0, 1]))

We study the approximation of functions from anisotropic Sobolev classes B(W^r_p([0,1]d)) and Hölder-Nikolskii classes B(H^r_p([0,1]d)) in the L_q([0,1]d) norm with q ≤ p in the quantum model of computation. We determine the quantum query complexity of this problem up to logarithmic factors. It shows that the quantum algorithms are significantly better than the classical deterministic or randomized algorithms.     

Normally generated line bundles on general curves, II

Let C be a general curve of genus g≥3. Here we prove that there is a normally generated L∈Pic^d(C) such that h⁰(C,L)=r+1≥4 (i.e. a very ample line bundle which embeds C in P^r as a projectively normal curve) if and only if (r+1)h¹≤g≤r(r−1)/2+2h¹, where h¹?g+r−d=h¹(C,L).     

Connected hyperplanes in binary matroids

For a 3-connected binary matroid M, let dim_A(M) be the dimension of the subspace of the cocycle space spanned by the non-separating cocircuits of M avoiding A, where A⊆E(M). When A=∅, Bixby and Cunningham, in 1979, showed that dim_A(M)=r(M). In 2004, when |A|=1, Lemos proved that dim_A(M)=r(M)-1. In this paper, we characterize the 3-connected binary matroids having a pair of elements that meets every non-separating cocircuit. Using this result, we show that 2dim_A(M)?r(M)-3, when M is regular and |A|=2. For |A|=3, we exhibit a family of cographic matroids with a 3-element set intersecting every non-separating cocircuit. We also construct the matroids that attains McNulty and Wu’s bound for the number of non-separating cocircuits of a simple and cosimple connected binary matroid.     

The packing problem for projective geometries over GF(3) with dimension greater than five

An (n, d) set in the projective geometry PG(r, q) is a set of n points, no d of which are dependent. The packing problem is that of finding n(r, q, d), the largest size of an (n, d) set in PG(r, q). The packing problem for PG(r, 3) is considered. All of the values of n(r, 3, d) for r ? 5 are known. New results for r = 6 are n(6, 3, 5) = 14 and 20 ? n(6, 3, 4) ? 31. In general, upper bounds on n(r, q, d) are determined using a slightly improved sphere-packing bound, the linear programming approach of coding theory, and an orthogonal (n, d) set with the known extremal values of n(r, q, d)—values when r and d are close to each other. The BCH constructions and computer searches are used to give lower bounds. The current situation for the packing problem for PG(r, 3) with r ? 15 is summarized in a final table.     

On tricyclic graphs of a given diameter with minimal energy

The energy of a graph is defined as the sum of the absolute values of all the eigenvalues of the graph. Let G(n,d) be the class of tricyclic graphs G on n vertices with diameter d and containing no vertex disjoint odd cycles C_p,C_q of lengths p and q with p+q≡2(mod4). In this paper, we characterize the graphs with minimal energy in G(n,d).     

Non-linear Approximations Using Sets of Finite Cardinality or Finite Pseudo-dimension

We investigate optimal non-linear approximations of multivariate periodic functions with mixed smoothness. In particular, we study optimal approximation using sets of finite cardinality (as measured by the classical entropy number), as well as sets of finite pseudo-dimension (as measured by the non-linear widths introduced by Ratsaby and Maiorov). Approximation error is measured in the L_q(T^d)-sense, where T^d is the d-dimensional torus. The functions to be approximated are in the unit ball SB^r_p, θ of the mixed smoothness Besov space or in the unit ball SW^r_p of the mixed smoothness Sobolev space. For 1<p, q<∞, 0<θ⩽∞ and r>0 satisfying some restrictions, we establish asymptotic orders of these quantities, as well as construct asymptotically optimal approximation algorithms. We particularly prove that for either r>1/p and θ⩾p or r>(1/p−1/q)₊ and θ⩾min{q, 2}, the asymptotic orders of these quantities for the Besov class SB^r_p, θ are both n^−r(log n)^{(d−1)(r+1/2−1/θ)}.     

Distributing vertices along a Hamiltonian cycle in Dirac graphs

A graph G on n vertices is called a Dirac graph if it has a minimum degree of at least n/2. The distance is defined as the number of edges in a shortest path of G joining u and v. In this paper we show that in a Dirac graph G, for every small enough subset S of the vertices, we can distribute the vertices of S along a Hamiltonian cycle C of G in such a way that all but two pairs of subsequent vertices of S have prescribed distances (apart from a difference of at most 1) along C. More precisely we show the following. There are ω,n₀>0 such that if G is a Dirac graph on n≥n₀ vertices, d is an arbitrary integer with 3≤d≤ωn/2 and S is an arbitrary subset of the vertices of G with 2≤|S|=k≤ωn/d, then for every sequence d_i of integers with 3≤d_i≤d,1≤i≤k−1, there is a Hamiltonian cycle C of G and an ordering of the vertices of S, a₁,a₂,…,a_k, such that the vertices of S are visited in this order on C and we have

     

Quotients of the congruence kernels of SL2 over arithmetic dedekind domains

LetC=C(C, P, k) be the coordinate ring of the affine curve obtained by removing a closed pointP from a (suitable) projective curveC over afinite fieldk. Let SL₂ (C,q) be the principal congruence subgroup of SL₂(C) andU ₂(C,q) be the subgroup generated by the all unipotent matrices in SL₂(C,q), whereq is aC-ideal. In this paper we prove that, for all but finitely manyq, the quotient SL₂(C,q)/U ₂(C,q) is a free group of finite,unbounded rank. LetC(SL₂(A)) be the congruence kernel of SL₂(A), whereA is an arithmetic Dedekind domain with only finitely many units. (e.g.A=C or ℤ) and letG be any finitely generated group. From the above (and previous results) we deduce that the profinite completion ofG,Ĝ, is a homonorphic image ofC(SL₂(A)). This is related to previous results of Lubotzky and Mel'nikov.     

Arithmetic structure in sparse difference sets

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any configuration {v₁,…,v?} of vectors in Zd, we show that if A⊂d[1,N] with |A|/Nd?CN−1/?, then there necessarily exists r≠0 such that {rv₁,…,rv?}⊆A−A.     

Viability for a class of semilinear differential equations of retarded type

Let X be a Banach space, A ： D（A） X → X the generator of a compact C0- semigroup S（t） ： X → X, t ≥ 0, D a locally closed subset in X, and f ： （a, b） × X →X a function of Caratheodory type. The main result of this paper is that a necessary and sufficient condition in order to make D a viable domain of the semilinear differential equation of retarded type u＇（t） = Au（t） ＋ f（t, u（t - q））, t ∈ [to, to ＋ T], with initial condition uto = φ ∈C（[-q, 0]; X）, is the tangency condition lim infh10 h^-1d（S（h）v（O）＋hf（t, v（-q））; D） = 0 for almost every t ∈ （a, b） and every v ∈ C（[-q, 0]; X） with v（0）, v（-q）∈ D.     

Kolmogorov Width of Classes of Smooth Functions on the Sphere

Let ^d−1{(x₁,…,x_d) ^d:x²₁+···+x²_d=1} be the unit sphere of the d-dimensional Euclidean space ^d. For r>0, we denote by B^r_p (1p∞) the class of functions f on ^d−1 representable in the formwhere dσ(y) denotes the usual Lebesgue measure on ^d−1, and P^λ_k(t) is the ultraspherical polynomial.For 1p,q∞, the Kolmogorov N-width of B^r_p in L^q( ^d−1) is given bythe left-most infimum being taken over all N-dimensional subspaces X_N of L^q( ^d−1).The main result in this paper is that for r2(d−1)²,where A_NB_N means that there exists a positive constant C, independent of N, such that C⁻¹A_NB_NCA_N.This extends the well-known Kashin theorem on the asymptotic order of the Kolmogorov widths of the Sobolev class of the periodic functions.     

q-Partition algebra combinatorics

We study a q-analog Qr(n,q) of the partition algebra Pr(n). The algebra Qr(n,q) arises as the centralizer algebra of the finite general linear group GLn(Fq) acting on a vector space coming from r-iterations of Harish-Chandra restriction and induction. For n?2r, we show that Qr(n,q) has the same semisimple matrix structure as Pr(n). We compute the dimension to be a q-polynomial that specializes as dn,r(1)=nr and dn,r(0)=B(r), the rth Bell number. Our method is to write dn,r(q) as a sum over integer sequences which are q-weighted by inverse major index. We then find a basis of indexed by n-restricted q-set partitions of {1,…,r} and show that there are dn,r(q) of these.