Motivated by the study of Killing forms on compact Riemannian manifolds of negative sectional curvature, we introduce the notion of generalized vector cross products on $\mathbb{R}^n$ and give their classification. Using ...

We provide a means to compute Herbrand disjunctions directly from sequent calculus proofs with cuts. Our approach associates to a first-order classical proof $\pi \vdash \exists v F$, where $F$ is quantifier free, an ...

We show how Coxeter’s work implies a bijection between complex reflection groups of rank two and real reflection groups in 0(3). We also consider this magic square of reflections and rotations in the framework of Clifford ...

We extend previous work of max-linear models on finite directed acyclic graphs to infinite graphs, and investigate their relations to classical percolation theory. We formulate results for the oriented square lattice graph ...

A geometry with parallel skew-symmetric torsion is a Riemannian manifold carrying a metric connection with parallel skew-symmetric torsion. Besides the trivial case of the Levi-Civita connection, geometries with non-vanishing ...

Let $A$ be a $K$-subalgebra of the polynomial ring $S=K[x_1,\ldots,x_d]$ of dimension $d$, generated by finitely many monomials of degree $r$. Then the Gauss algebra $\mathbb{G}(A)$ of $A$ is generated by monomials of ...

We provide a lower bound for the ratio between the ordinary and uniform exponents of both simultaneous Diophantine approximation to n real numbers and Diophantine approximation for one linear form in n variables. This ...

We consider the following semilinear overdetermined problem on a two dimensional bounded or unbounded domain $\Omega$ with analytic boundary $\partial\Omega$ having at least one bounded connected component \begin{eqnarray*} ...

The Brjuno function attains a strict global minimum at the golden section.

The Tutte polynomial is originally a bivariate polynomial enumerating the colorings of a graph and of its dual graph. But it reveals more of the internal structure of the graph like its number of forests, of spanning ...