Related papers: Computing The Extension Complexities of All 4-Dime…
We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…
We show that any bounded integral function $f : A \times B \mapsto \{0,1, \dots, \Delta\}$ with rank $r$ has deterministic communication complexity $\Delta^{O(\Delta)} \cdot \sqrt{r} \cdot \log r$, where the rank of $f$ is defined to be the…
In this paper, we describe restricted one-dimensional central extensions of all finite dimensional simple restricted Lie algebras defined over fields of characteristic $p\ge 5$.
We prove that if the linear-time and polynomial-time hierarchies coincide, then every model of $\Pi_1(\mathbb{N}) + \neg \Omega_1$ has a proper end-extension to a model of $\Pi_1(\mathbb{N})$, and so $\Pi_1(\mathbb{N}) + \neg \Omega_1…
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…
We show that a totally geodesic submanifold of a symmetric space satisfying certain conditions admits an extension to a minimal submanifold of dimension one higher, and we apply this result to construct new examples of complete embedded…
Quasi-onedimensional stereoregular polymers as for example polyacetylene are currently of considerable interest. There are basically two different approaches for doing electronic structure calculations: One method is essentially based on…
The notion of entropy dimension has been introduced to measure the subexponential complexity of zero entropy systems. In this work we present a general construction of a strictly ergodic subshift of topological entropy dimension $\alpha$…
The minimal Kolmogorov complexity of a total computable function that exceeds everywhere all total computable functions of complexity at most $n$, is $2^{n+O(1)}$. If we replace "everywhere" by "for all sufficiently large inputs", the…
In the frame of a classification of general square systems of polynomial equations solvable by radicals, Esterov and Gusev succeeded in classifying all spanning lattice polytopes whose normalized volumes are at most $4$. In the present…
The paper is devoted to the study of annihilator extensions of evolution algebras and suggests an approach to classify finite-dimensional nilpotent evolution algebras. Subsequently nilpotent evolution algebras of dimension up to four are…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
We improve the estimates in the restriction problem in dimension $n \ge 4$. To do so, we establish a weak version of a $k$-linear restriction estimate for any $k$. The exponents in this weak $k$-linear estimate are sharp for all $k$ and…
Four-dimensional spacetime, together with a natural generalisation to extra dimensions, is obtained through an analysis of the structures and symmetries deriving from possible arithmetic expressions for one-dimensional time. On taking the…
A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We improve both dimension compression and expansion bounds for homeomorphisms with $p$-exponentially integrable distortion. To the first direction we also introduce estimates for the compression multifractal spectra, which will be used to…
The (combinatorial) diameter of a polytope $P \subseteq \mathbb R^d$ is the maximum value of a shortest path between a pair of vertices on the 1-skeleton of $P$, that is the graph where the nodes are given by the $0$-dimensional faces of…
We derive a sharp lower bound for the scalar curvature of non-flat and non-compact expanding gradient Ricci soliton provided that the scalar curvature is non-negative and the potential function is proper. We also give an upper bound for the…
We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…