On the Mordell–Weil rank of a surface fibration

Abstract

In this article, we give a new upper bound for the Mordell–Weil rank of a surface fibration and we prove an analog result in positive characteristic.     

Example of the matrix of size 6 × 6 with different tropical rank and Kapranov rank

We present an example of a 6 × 6 matrix A such that rk _t (A) = 4, rk _K (A) = 5. This disproves the conjecture formulated by M. Chan, A. Jensen, and E. Rubei.     

On a minimal set of generators for the invariants of 3 × 3 matrices

Let K be a field of characteristic p > 0, let L be a restricted Lie algebra and let R be an associative K-algebra. It is shown that the various constructions in the literature of crossed product of R with u(L) are equivalent. We calculate explicit formulae relating the parameters involved and obtain a formula which hints at a noncommutative version of the Bell polynomials.     

On the hyperdeterminant for 2×2×3 arrays

We use the representation theory of Lie algebras and computational linear algebra to determine the simplest non-constant invariant polynomial in the entries of a general 2?×?2?×?3 array. This polynomial is homogeneous of degree 6 and has 66 terms with coefficients ±1, ±2 in the 12 indeterminates x _ijk where i, j?=?1,?2 and k?=?1,?2,?3. This invariant can be regarded as a natural generalization of Cayley's hyperdeterminant for 2?×?2?×?2 arrays.     

On the Yamabe constants of S2×R3 and S3×R2

We compare the isoperimetric profiles of $S^2\times {\mathbb{R}}^3$ and of $S^3\times {\mathbb{R}}^2$ with that of a round 5-sphere (of appropriate radius). Then we use this comparison to obtain lower bounds for the Yamabe constants of $S^2\times {\mathbb{R}}^3$ and $S^3\times {\mathbb{R}}^2$. Explicitly we show that $Y(S^3\times {\mathbb{R}}^2,[g_0^3+d{x}^2])>(3/4)Y(S^5)$ and $Y(S^2\times {\mathbb{R}}^3,[g_0^2+d{x}^2])>0.63Y(S^5)$. We also obtain explicit lower bounds in higher dimensions and for products of Euclidean space with a closed manifold of positive Ricci curvature. The techniques are a more general version of those used by the same authors in Petean and Ruiz (2011) [15] and the results are a complement to the work developed by B. Ammann, M. Dahl and E. Humbert to obtain explicit gap theorems for the Yamabe invariants in low dimensions.     

On the Erd?s-Ginzburg-Ziv constant of finite abelian groups of high rank

Let G be a finite abelian group. The Erd?s-Ginzburg-Ziv constant s(G) of G is defined as the smallest integer l∈N such that every sequence S over G of length |S|?l has a zero-sum subsequence T of length |T|=exp(G). If G has rank at most two, then the precise value of s(G) is known (for cyclic groups this is the theorem of Erd?s-Ginzburg-Ziv). Only very little is known for groups of higher rank. In the present paper, we focus on groups of the form , with n,r∈N and n?2, and we tackle the study of s(G) with a new approach, combining the direct problem with the associated inverse problem.     

The rank of a 2 × 2 × 2 tensor

As computing power increases, many more problems in engineering and data analysis involve computation with tensors, or multi-way data arrays. Most applications involve computing a decomposition of a tensor into a linear combination of rank-1 tensors. Ideally, the decomposition involves a minimal number of terms, i.e. computation of the rank of the tensor. Tensor rank is not a straight-forward extension of matrix rank. A constructive proof based on an eigenvalue criterion is provided that shows when a 2?×?2?×?2 tensor over ? is rank-3 and when it is rank-2. The results are extended to show that n?×?n?×?2 tensors over ? have maximum possible rank n?+?k where k is the number of complex conjugate eigenvalue pairs of the matrices forming the two faces of the tensor cube.     

On the classification of nonsingular 2×2×2×2 hypercubes

As a first step in the classification of nonsingular 2×2×2×2 hypercubes up to equivalence, we resolve the case where the base field is finite and the hypercubes can be written as a product of two 2×2×2 hypercubes. (Nonsingular hypercubes were introduced by D. Knuth in the context of semifields. Where semifields are related to hypercubes of dimension 3, this paper considers the next case, i.e., hypercubes of dimension 4.) We define the notion of ij-rank (with 1 ≤ i < j ≤ 4) and prove that a hypercube is the product of two 2×2×2 hypercubes if and only if its 12-rank is at most 2. We derive a ‘standard form’ for nonsingular 2×2×2×2 hypercubes of 12-rank less than 4 as a first step in the classification of such hypercubes up to equivalence. Our main result states that the equivalence class of a nonsingular 2×2×2×2 hypercube M of 12-rank 2 depends only on the value of an invariant δ ₀(M) which derives in a natural way from the Cayley hyperdeterminant det₀ M and another polynomial invariant det M of degree 4. As a corollary we prove that the number of equivalence classes is (q + 1)/2 or q/2 depending on whether the order q of the field is odd or even.     

On the classification of certain real rank zero C*-algebras

In this paper,we give a classification of real rank zero C^*-algebras that can be expressed as inductive limits of a sequence of a subclass of Elliott-Thomsen algebras C.     

On the coincidence of the factor and Gondran–Minoux rank functions of matrices over a semiring

We consider the rank functions of matrices over semirings, functions that generalize the classical notion of the rank of a matrix over a field. We study semirings over which the factor and Gondran–Minoux ranks of any matrix coincide. It is shown that every semiring satisfying that condition is a subsemiring of a field. We provide an example of an integral domain over which the factor and Gondran–Minoux ranks are different.     

On the “log rank”-conjecture in communication complexity

We show the existence of a non-constant gap between the communication complexity of a function and the logarithm of the rank of its input matrix. We consider the following problem: each of two players gets a perfect matching between twon-element sets of vertices. Their goal is to decide whether or not the union of the two matcliings forms a Hamiltonian cycle. We prove:

1. The rank of the input matrix over the reals for this problem is 2 ^O(n) .
2. The non-deterministic communication complexity of the problem is Ω(nloglogn).

Our result also supplies a superpolynomial gap between the chromatic number of a graph and the rank of its adjacency matrix. Another conclusion from the second result is an Ω(nloglogn) lower bound for the graph connectivity problem in the non-deterministic case. We make use of the theory of group representations for the first result. The second result is proved by an information theoretic argument.     

Border rank of m×n×(mn−q) tensors

The border rank of a nondegenerate m×n×(mn−q) tensor over the complex field is mn−q provided that q⩽max(m,n).     

On the extreme eigenvalues of block 2 × 2 Hermitian matrices

The lower bound