Cayley’s hyperdeterminant: A combinatorial approach via representation theory

Cayley’s hyperdeterminant is a homogeneous polynomial of degree 4 in the 8 entries of a $2\times 2\times 2$ array. It is the simplest (nonconstant) polynomial which is invariant under changes of basis in three directions. We use elementary facts about representations of the 3-dimensional simple Lie algebra $\mathfrak{s}{l}_2(\mathbb{C})$ to reduce the problem of finding the invariant polynomials for a $2\times 2\times 2$ array to a combinatorial problem on the enumeration of $2\times 2\times 2$ arrays with non-negative integer entries. We then apply results from linear algebra to obtain a new proof that Cayley’s hyperdeterminant generates all the invariants. In the last section we discuss the application of our methods to general multidimensional arrays.     

Regular Hadamard matrices constructed from Hadamard 2-designs and conference graphs

Suppose there exists a Hadamard 2-$(m,\frac{m?1}{2},\frac{m?3}{4})$ design having skew incidence matrix. If there exists a conference graph on $2m?1$ vertices, then there exists a regular Hadamard matrix of order $4m^2$. A conference graph on $2m+3$ vertices yields a regular Hadamard matrix of order $4{(m+1)}^2$.     

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.     

The Carroll and Chang conjecture of equal Indscal components when Candecomp/Parafac gives perfect fit

The Candecomp/Parafac algorithm approximates a set of matrices ${\mathbf{X}}_1\text{,}\dots \text{,}{\mathbf{X}}_I$ by products of the form ${\mathbf{AC}}_i{\mathbf{B}}^{\prime }$, with ${\mathbf{C}}_i$ diagonal, $i=1\text{,}\dots \text{,}I$. Carroll and Chang have conjectured that, when the matrices are symmetric, the resulting $\mathbf{A}$ and $\mathbf{B}$ will be column wise proportional. For cases of perfect fit, Ten Berge et al. have shown that the conjecture holds true in a variety of cases, but may fail when there is no unique solution. In such cases, obtaining proportionality by changing (part of) the solution seems possible. The present paper extends and further clarifies their results. In particular, where Ten Berge et al. solved all $I\times 2\times 2$ cases, now all $I\times 3\times 3$ cases, and also the $I\times 4\times 4$ cases for $I=2\text{,}8$, and 9 are clarified. In a number of cases, $\mathbf{A}$ and $\mathbf{B}$ necessarily have column wise proportionality when Candecomp/Parafac is run to convergence. In other cases, proportionality can be obtained by using specific methods. No cases were found that seem to resist proportionality.     

The pentavalent three-geodesic-transitive graphs

A complete classification is given of pentavalent 3-geodesic-transitive graphs which are not 3-arc-transitive, which shows that a pentavalent 3-geodesic-transitive but not 3-arc-transitive graph is one of the following graphs: $\overline{(2\times 6)\text{-}\mathsf{grid}}$, $\mathrm{H}(5,2)$, the icosahedron, the incidence graph of the 2-$(11,5,2)$-design, the Wells graph and the Sylvester graph.     

On Birman's sequence of Hardy–Rellich-type inequalities

In 1961, Birman proved a sequence of inequalities $\{I_n\}$, for $n\in \mathbb{N}$, valid for functions in $C_0^n((0,\infty ))?L^2((0,\infty ))$. In particular, $I_1$ is the classical (integral) Hardy inequality and $I_2$ is the well-known Rellich inequality. In this paper, we give a proof of this sequence of inequalities valid on a certain Hilbert space $H_n([0,\infty ))$ of functions defined on $[0,\infty )$. Moreover, $f\in H_n([0,\infty ))$ implies $f^{\prime }\in H_{n?1}([0,\infty ))$; as a consequence of this inclusion, we see that the classical Hardy inequality implies each of the inequalities in Birman's sequence. We also show that for any finite $b>0$, these inequalities hold on the standard Sobolev space $H_0^n((0,b))$. Furthermore, in all cases, the Birman constants ${[(2n?1)!!]}^2/2^{2n}$ in these inequalities are sharp and the only function that gives equality in any of these inequalities is the trivial function in $L^2((0,\infty ))$ (resp., $L^2((0,b))$). We also show that these Birman constants are related to the norm of a generalized continuous Cesàro averaging operator whose spectral properties we determine in detail.     

On packing of rectangles in a rectangle

It is known that ${\sum }_{i=1}^{\infty }1∕\left(i(i+1)\right)=1$. In 1968, Meir and Moser (1968) asked for finding the smallest $?$ such that all the rectangles of sizes $1∕i\times 1∕(i+1)$, $i\in \{1,2,\dots \}$, can be packed into a square or a rectangle of area $1+?$. First we show that in Paulhus (1997), the key lemma, as a statement, in the proof of the smallest published upper bound of the minimum area is false, then we prove a different new upper bound. We show that $?\le 1.26?10^{?9}$ if the rectangles are packed into a square and $?\le 6.878?10^{?10}$ if the rectangles are packed into a rectangle.     

4-labelings and grid embeddings of plane quadrangulations

A straight-line drawing of a planar graph $G$ is a closed rectangle-of-influence drawing if for each edge $uv$, the closed axis-parallel rectangle with opposite corners $u$ and $v$ contains no other vertices. We show that each quadrangulation on $n$ vertices has a closed rectangle-of-influence drawing on the $(n?3)\times (n?3)$ grid.The algorithm is based on angle labeling and simple face counting in regions. This answers the question of what would be a grid embedding of quadrangulations analogous to Schnyder’s classical algorithm for embedding triangulations and extends previous results on book embeddings for quadrangulations from Felsner, Huemer, Kappes, and Orden.A further compaction step yields a straight-line drawing of a quadrangulation on the $(?\frac{n}{2}??1)\times (?\frac{3n}{4}??1)$ grid. The advantage over other existing algorithms is that it is not necessary to add edges to the quadrangulation to make it $4$-connected.     

An extension of an inequality for ratios of gamma functions

In this paper, we prove that for $x+y>0$ and $y+1>0$ the inequality $\frac{{[\Gamma (x+y+1)/\Gamma (y+1)]}^{1/x}}{{[\Gamma (x+y+2)/\Gamma (y+1)]}^{1/(x+1)}}<{\left(\frac{x+y}{x+y+1}\right)}^{1/2}$ is valid if $x>1$ and reversed if $x<1$ and that the power $\frac{1}{2}$ is the best possible, where $\Gamma \left(x\right)$ is the Euler gamma function. This extends the result of [Y. Yu, An inequality for ratios of gamma functions, J. Math. Anal. Appl. 352 (2) (2009) 967–970] and resolves an open problem posed in [B.-N. Guo, F. Qi, Inequalities and monotonicity for the ratio of gamma functions, Taiwanese J. Math. 7 (2) (2003) 239–247].