Complete solutions to the Oberwolfach problem for an infinite set of orders

Let n3 and let F be a 2-regular graph of order n. The Oberwolfach problem OP(F) asks for a 2-factorisation of K_n if n is odd, or of K_n−I if n is even, in which each 2-factor is isomorphic to F. We show that there is an infinite set of primes congruent to such that OP(F) has a solution for any 2-regular graph F of order . We also show that for each of the infinitely many with prime, OP(F) has a solution for any 2-regular graph F of order n.     

Discrepancies between metric dimension and partition dimension of a connected graph

Let and be graphs where the set of vertices is the set of points of the integer lattice and the set of edges consists of all pairs of vertices whose city block and chessboard distances, respectively, are 1.In this paper it is shown that the partition dimensions of these graphs are 3 and 4, respectively, while their metric dimensions are not finite. Also, for every n3 there exists an induced subgraph of of order 3n-1 with metric dimension n and partition dimension 3. These examples will answer a question raised by Chartrand, Salehi and Zhang. Furthermore, graphs of order n9 having partition dimension n-2 are characterized, thus completing the characterization of graphs of order n having partition dimension 2, n, or n-1 given by Chartrand, Salehi and Zhang. The list of these graphs includes 23 members.     

Intersection graphs of ideals of rings

In this paper, we consider the intersection graph G(R) of nontrivial left ideals of a ring R. We characterize the rings R for which the graph G(R) is connected and obtain several necessary and sufficient conditions on a ring R such that G(R) is complete. For a commutative ring R with identity, we show that G(R) is complete if and only if G(R[x]) is also so. In particular, we determine the values of n for which is connected, complete, bipartite, planar or has a cycle. Next, we characterize finite graphs which arise as the intersection graphs of and determine the set of all non-isomorphic graphs of for a given number of vertices. We also determine the values of n for which the graph of is Eulerian and Hamiltonian.     

A characterization of Q-polynomial distance-regular graphs

Let Γ denote a distance-regular graph with diameter D3. Let θ denote a nontrivial eigenvalue of Γ and let denote the corresponding dual eigenvalue sequence. In this paper we prove that Γ is Q-polynomial with respect to θ if and only if the following (i)–(iii) hold:

(i) There exist such that

(1)

(ii) There exist such that the intersection numbers a_i satisfy

for 0iD, where and are the scalars which satisfy Eq. (1) for i=0, i=D, respectively.

(iii) for 1iD.

Weakly sequentially continuous differentiable mappings

It is well known that a (linear) operator between Banach spaces is completely continuous if and only if its adjoint takes bounded subsets of Y^* into uniformly completely continuous subsets, often called (L)-subsets, of X^*. We give similar results for differentiable mappings. More precisely, if UX is an open convex subset, let be a differentiable mapping whose derivative is uniformly continuous on U-bounded subsets. We prove that f takes weak Cauchy U-bounded sequences into convergent sequences if and only if f^′ takes Rosenthal U-bounded subsets of U into uniformly completely continuous subsets of . As a consequence, we extend a result of P. Hájek and answer a question raised by R. Deville and E. Matheron. We derive differentiable characterizations of Banach spaces not containing ℓ₁ and of Banach spaces without the Schur property containing a copy of ℓ₁. Analogous results are given for differentiable mappings taking weakly convergent U-bounded sequences into convergent sequences. Finally, we show that if X has the hereditary Dunford–Pettis property, then every differentiable function as above is locally weakly sequentially continuous.     

Constructing arithmetic subgroups of unipotent groups

Let G be a unipotent algebraic subgroup of some defined over . We describe an algorithm for finding a finite set of generators of the subgroup . This is based on a new proof of the result (in more general form due to Borel and Harish-Chandra) that such a finite generating set exists.     

Finite automata presentable abelian groups

We give new examples of FA presentable torsion-free abelian groups. Namely, for every n2, we construct a rank n indecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group in which every nontrivial cyclic subgroup is not FA recognizable.     

The maximum edit distance from hereditary graph properties

For a graph property , the edit distance of a graph G from , denoted , is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying . What is the largest possible edit distance of a graph on n vertices from ? Denote this distance by .A graph property is hereditary if it is closed under removal of vertices. In a previous work, the authors show that for any hereditary property, a random graph essentially achieves the maximal distance from , proving: with high probability. The proof implicitly asserts the existence of such , but it does not supply a general tool for determining its value or the edit distance.In this paper, we determine the values of and for some subfamilies of hereditary properties including sparse hereditary properties, complement invariant properties, (r,s)-colorability and more. We provide methods for analyzing the maximum edit distance from the graph properties of being induced H-free for some graphs H, and use it to show that in some natural cases G(n,1/2) is not the furthest graph. Throughout the paper, the various tools let us deduce the asymptotic maximum edit distance from some well studied hereditary graph properties, such as being Perfect, Chordal, Interval, Permutation, Claw-Free, Cograph and more. We also determine the edit distance of G(n,1/2) from any hereditary property, and investigate the behavior of as a function of p.The proofs combine several tools in Extremal Graph Theory, including strengthened versions of the Szemerédi Regularity Lemma, Ramsey Theory and properties of random graphs.     

Biderivations of triangular algebras

Let be a triangular algebra. A bilinear map is called a biderivation if it is a derivation with respect to both arguments. In this paper we define the concept of an extremal biderivation, and prove that under certain conditions a biderivation of a triangular algebra is a sum of an extremal and an inner biderivation. The main result is then applied to (block) upper triangular matrix algebras and nest algebras. We also consider the question when a derivation of a triangular algebra is an inner derivation.     

Projective change between two classes of -metrics

In this paper, we find equations to characterize projective change between (α,β)-metric and Randers metric on a manifold with dimension n3, where α and are two Riemannian metrics, β and are two nonzero one forms. Moreover, we consider this projective change when F has some special curvature properties.     

Tensor-product approximation to operators and functions in high dimensions

In recent papers tensor-product structured Nyström and Galerkin-type approximations of certain multi-dimensional integral operators have been introduced and analysed. In the present paper, we focus on the analysis of the collocation-type schemes with respect to the tensor-product basis in a high spatial dimension d. Approximations up to an accuracy are proven to have the storage complexity with q independent of d, where N is the discrete problem size. In particular, we apply the theory to a collocation discretisation of the Newton potential with the kernel , , d3. Numerical illustrations are given in the case of d=3.     

Cohomology and deformations of the infinite-dimensional filiform Lie algebra

Denote the infinite-dimensional -graded Lie algebra defined by basis e_i, i1, and relations [e₁,e_i]=e_i+1 for all i2. We compute in this article the bracket structure on , and in relation to this, we establish that there are only finitely many true deformations of in each non-positive weight by constructing them explicitly. It turns out that in weight 0 one gets exactly the other two filiform Lie algebras.     

Sur le groupe d'automorphismes des géométries paraboliques de rang 1

The aim of this article is to prove the following result, which generalizes the Ferrand–Obata theorem, concerning the conformal group of a Riemannian manifold, and the Schoen–Webster theorem about the automorphism group of a strictly pseudo-convex CR structure: let M be a connected manifold endowed with a regular Cartan geometry, modelled on the boundary of the hyperbolic space of dimension d2 over , being , , or the octonions . If the automorphism group of M does not act properly on M, then M is isomorphic, as a Cartan geometry, to X, or X minus a point.     

disjoint cycles containing specified independent vertices

Let k1 be an integer and G be a graph of order n3k satisfying the condition that σ₂(G)n+k-1. Let v₁,…,v_k be k independent vertices of G, and suppose that G has k vertex-disjoint triangles C₁,…,C_k with v_iV(C_i) for all 1ik.Then G has k vertex-disjoint cycles such that

(i) for all 1ik.

(ii) , and

(iii) At least k-1 of the k cycles are triangles.

The condition of degree sum σ₂(G)n+k-1 is sharp.

Lattices compatible with regular polytopes

In a recent paper, Karpenkov has classified the lattice polytopes (that is, with vertices in the integer lattice ) which are regular with respect to those affinities which preserve the lattice. An alternative approach is adopted in this paper. For each regular polytope P in euclidean space , those lattices Λ are classified which are compatible with P, in the sense that some translate of Λ contains the vertices of P, and this translate is preserved by the symmetries of P.     

Global well-posedness and scattering for the energy-critical, defocusing Hartree equation for radial data

We consider the defocusing, -critical Hartree equation for the radial data in all dimensions (n5). We show the global well-posedness and scattering results in the energy space. The new ingredient in this paper is that we first take advantage of the term in the localized Morawetz identity to rule out the possibility of energy concentration, instead of the classical Morawetz estimate dependent of the nonlinearity.     

Some graphs determined by their spectra

Let denote the graph obtained by attaching m pendent edges to a vertex of complete graph K_n-m, and U_n,p the graph obtained by attaching n-p pendent edges to a vertex of C_p. In this paper, we first prove that the graph and its complement are determined by their adjacency spectra, and by their Laplacian spectra. Then we prove that U_n,p is determined by its Laplacian spectrum, as well as its adjacency spectrum if p is odd, and find all its cospectral graphs for U_n,4.     

On the chromatic number of an oriented matroid

We prove that the chromatic number of an oriented matroid of rank r3 is at most r+1 with equality if and only if is the oriented matroid of an orientation of K_r+1, the complete graph on r+1 vertices.     

Lattices generated by subspaces in d-bounded distance-regular graphs

Let Γ denote a d-bounded distance-regular graph with diameter d2. A regular strongly closed subgraph of Γ is said to be a subspace of Γ. Define the empty set to be the subspace with diameter -1 in Γ. For 0ii+sd-1, let denote the set of all subspaces in Γ with diameters i,i+1,…,i+s including Γ and . If we define the partial order on by ordinary inclusion (resp. reverse inclusion), then is a poset, denoted by (resp. ). In the present paper we show that both and are atomic lattices, and classify their geometricity.     

An optimal symbolic calculus on Besov algebras

In this paper we consider Besov algebras on , that is Besov spaces for s>1/p. For s>1+(1/p), p>4/3, and qp we prove that the above algebras have a maximal symbolic calculus in the following sense: for any function f belonging locally to and such that f(0)=0, the associated superposition operator T_f(g):=f○g takes to itself.