On the syntomic regulator for K 1 of a surface

We consider elements of K ₁(S), where S is a proper surface over a p-adic field with good reduction, which are given by a formal sum ??(Z _i , f _i ) with Z _i curves in S and f _i rational functions on the Z _i in such a way that the sum of the divisors of the f _i is 0 on S. Assuming compatibility of pushforwards in syntomic and motivic cohomologies, our result computes the syntomic regulator of such an element, interpreted as a functional on H _dR ² (S), when evaluated on the cup product ????[??] of a holomorphic form ?? by the first cohomology class of a form of the second kind ??. The result is ?? _i ??F _?? , log(f _i ); F _?? ??_gl,Z _i , where F _?? and F _?? are Coleman integrals of ?? and ??, respectively, and the symbol in brackets is the global triple index, as defined in our previous work.     

Extremal sizes of subspace partitions

A subspace partition Π of V?= V(n, q) is a collection of subspaces of V such that each 1-dimensional subspace of V is in exactly one subspace of Π. The size of Π is the number of its subspaces. Let σ _q (n, t) denote the minimum size of a subspace partition of V in which the largest subspace has dimension t, and let ρ _q (n, t) denote the maximum size of a subspace partition of V in which the smallest subspace has dimension t. In this article, we determine the values of σ _q (n, t) and ρ _q (n, t) for all positive integers n and t. Furthermore, we prove that if n ≥?2t, then the minimum size of a maximal partial t-spread in V(n +?t ?1, q) is σ _q (n, t).     

On the global offensive alliance number of a graph

An offensive alliance in a graph Γ=(V,E) is a set of vertices S⊂V where for each vertex v in its boundary the majority of vertices in v’s closed neighborhood are in S. In the case of strong offensive alliance, strict majority is required. An alliance S is called global if it affects every vertex in V?S, that is, S is a dominating set of Γ. The global offensive alliance numberγ_o(Γ) is the minimum cardinality of a global offensive alliance in Γ. An offensive alliance is connected if its induced subgraph is connected. The global-connected offensive alliance number, γ_co(Γ), is the minimum cardinality of a global-connected offensive alliance in Γ.In this paper we obtain several tight bounds on γ_o(Γ) and γ_co(Γ) in terms of several parameters of Γ. The case of strong alliances is studied by analogy.     

On equality in an upper bound for the restrained and total domination numbers of a graph

Let G=(V,E) be a graph. A set S⊆V is a restrained dominating set (RDS) if every vertex not in S is adjacent to a vertex in S and to a vertex in V?S. The restrained domination number of G, denoted by γ_r(G), is the minimum cardinality of an RDS of G. A set S⊆V is a total dominating set (TDS) if every vertex in V is adjacent to a vertex in S. The total domination number of a graph G without isolated vertices, denoted by γ_t(G), is the minimum cardinality of a TDS of G.Let δ and Δ denote the minimum and maximum degrees, respectively, in G. If G is a graph of order n with δ?2, then it is shown that γ_r(G)?n-Δ, and we characterize the connected graphs with δ?2 achieving this bound that have no 3-cycle as well as those connected graphs with δ?2 that have neither a 3-cycle nor a 5-cycle. Cockayne et al. [Total domination in graphs, Networks 10 (1980) 211-219] showed that if G is a connected graph of order n?3 and Δ?n-2, then γ_t(G)?n-Δ. We further characterize the connected graphs G of order n?3 with Δ?n-2 that have no 3-cycle and achieve γ_t(G)=n-Δ.     

Sp(2N)-covers for self-contragredient supercuspidal representations of GL(N)

Let F be a non-archimedean local field of odd residual characteristic. Let (J,τ) be a maximal simple type in GLN(F) for the inertial class [GLN(F),π]_GLN(F) of a self-contragredient supercuspidal irreducible representation π of GLN(F). Identify GLN(F) to the standard Siegel Levi subgroup in Sp2N(F). We construct, in Sp2N(F), a type for the inertial class [GLN(F),π]_Sp2N(F), as a Sp2N(F)-cover of (J,τ), strongly related to the GL2N(F)-cover of (J×J,τ⊗τ) in GL2N(F) constructed by Bushnell and Kutzko and which induces to a simple type in GL2N(F). In the process, we show that if τ has positive level, then the maximal simple type (J,τ) may be attached to a simple stratum [A,n,0,β] where the field F[β] is a quadratic extension of F[β²], and to a simple character θ in C(A,0,β) Galois conjugate of its inverse.     

Approximations by convolutions and antiderivatives

Let g be a given function in L ¹ = L ¹(0, 1), and let B be one of the spaces L ^p (0, 1), 1 ≤ p < ∞, or C ₀[0, 1]. We prove that the set of all convolutions f * g, f ∈ B, is dense in B if and only if g is nontrivial in an arbitrary right neighborhood of zero. Under an additional restriction on g, we prove the equivalence in B of the systems f _n * g and I f _n , where f _n ∈ L ¹, n ∈ ?, and I f = f * 1 is the antiderivative of f. As a consequence, we obtain criteria for the completeness and basis property in B of subsystems of antiderivatives of g.     

Some Schroeder-Bernstein type theorems for Banach spaces

We first introduce the notion of (p,q,r)-complemented subspaces in Banach spaces, where p,q,r∈N. Then, given a couple of triples {(p,q,r),(s,t,u)} in N and putting Λ=(q+r−p)(t+u−s)−ru, we prove partially the following conjecture: For every pair of Banach spaces X and Y such that X is (p,q,r)-complemented in Y and Y is (s,t,u)-complemented in X, we have that X is isomorphic Y if and only if one of the following conditions holds:

(a)

Λ≠0, Λ divides p−q and s−t, p=1 or q=1 or s=1 or t=1.

(b)

p=q=s=t=1 and gcd(r,u)=1.

The case {(2,1,1),(2,1,1)} is the well-known Pe?czyński's decomposition method. Our result leads naturally to some generalizations of the Schroeder-Bernstein problem for Banach spaces solved by W.T. Gowers in 1996.     

Type-B generalized triangulations and determinantal ideals

For n≥3, let Ω_n be the set of line segments between the vertices of a convex n-gon. For j≥2, a j-crossing is a set of j line segments pairwise intersecting in the relative interior of the n-gon. For k≥1, let Δ_n,k be the simplicial complex of (type-A) generalized triangulations, i.e. the simplicial complex of subsets of Ω_n not containing any (k+1)-crossing.The complex Δ_n,k has been the central object of many papers. Here we continue this work by considering the complex of type-B generalized triangulations. For this we identify line segments in Ω_2n which can be transformed into each other by a 180^°-rotation of the 2n-gon. Let F_n be the set Ω_2n after identification, then the complex D_n,k of type-B generalized triangulations is the simplicial complex of subsets of F_n not containing any (k+1)-crossing in the above sense. For k=1, we have that D_n,1 is the simplicial complex of type-B triangulations of the 2n-gon as defined in [R. Simion, A type-B associahedron, Adv. Appl. Math. 30 (2003) 2-25] and decomposes into a join of an (n−1)-simplex and the boundary of the n-dimensional cyclohedron. We demonstrate that D_n,k is a pure, k(n−k)−1+kn dimensional complex that decomposes into a kn−1-simplex and a k(n−k)−1 dimensional homology-sphere. For k=n−2 we show that this homology-sphere is in fact the boundary of a cyclic polytope. We provide a lower and an upper bound for the number of maximal faces of D_n,k.On the algebraical side we give a term order on the monomials in the variables X_ij,1≤i,j≤n, such that the corresponding initial ideal of the determinantal ideal generated by the (k+1) times (k+1) minors of the generic n×n matrix contains the Stanley-Reisner ideal of D_n,k. We show that the minors form a Gröbner-Basis whenever k∈{1,n−2,n−1} thereby proving the equality of both ideals and the unimodality of the h-vector of the determinantal ideal in these cases. We conjecture this result to be true for all values of k<n.     

Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances

Let Ω^Ω be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups of Ω^Ω, then we write U≈V if there exists a finite subset F of Ω^Ω such that the subsemigroup generated by U and F equals that generated by V and F. The relative rank of U in Ω^Ω is the least cardinality of a subset A of Ω^Ω such that the union of U and A generates Ω^Ω. In this paper we study the notions of relative rank and the equivalence ≈ for semigroups of endomorphisms of binary relations on Ω.The semigroups of endomorphisms of preorders, bipartite graphs, and tolerances on Ω are shown to lie in two equivalence classes under ≈. Moreover such semigroups have relative rank 0, 1, 2, or d in Ω^Ω where d is the minimum cardinality of a dominating family for N^N. We give examples of preorders, bipartite graphs, and tolerances on Ω where the relative ranks of their endomorphism semigroups in Ω^Ω are 0, 1, 2, and d.We show that the endomorphism semigroups of graphs, in general, fall into at least four classes under ≈ and that there exist graphs where the relative rank of the endomorphism semigroup is 2^ℵ₀.     

Existence and uniqueness of positive solution for nonhomogeneous sublinear elliptic equations

In this paper, we study the existence and the uniqueness of positive solution for the sublinear elliptic equation, −Δu+u=p|u|sgn(u)+f in RN, N?3, 0<p<1, f∈L²(RN), f>0 a.e. in RN. We show by applying a minimizing method on the Nehari manifold that this problem has a unique positive solution in H¹(RN)∩Lp+1(RN). We study its continuity in the perturbation parameter f at 0.