Related papers: On hyperplanes and semispaces in max-min convex ge…
We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…
A non-commutative differential calculus on the $h$-superplane is presented via a contraction of the $q$-superplane. An R-matrix which satisfies both ungraded and graded Yang-Baxter equations is obtained and a new deformation of the $(1+1)$…
This paper is devoted to the classification problems concerning extended deformations of convex polyhedra and real hyperplane arrangements in the following senses: combinatorial equivalence of face posets, normal equivalence on normal fans…
A complete characterization of proper holomorphic mappings between domains from the class of all pseudoconvex Reinhardt domains in $\C^2$ with the logarithmic image equal to a strip or a half-plane is given.
Weak similarities form a special class of mappings between semimetric spaces. Two semimetric spaces $X$ and $Y$ are weakly similar if there exists a weak similarity $\Phi\colon X\to Y$. We find a structural characteristic of finite…
We introduce the separating semigroup of a real algebraic curve of dividing type. The elements of this semigroup record the possible degrees of the covering maps obtained by restricting separating morphisms to the real part of the curve. We…
Within the framework of finite element systems, we show how spaces of differential forms may be constructed, in such a way that they are equipped with commuting interpolators and contain prescribed functions, and are minimal under these…
We discuss some key results from convex analysis in the setting of topological groups and monoids. These include separation theorems, Krein-Milman type theorems, and minimax theorems.
Given a bichromatic point set $P=\textbf{R} \cup \textbf{B}$ of red and blue points, a separator is an object of a certain type that separates $\textbf{R}$ and $\textbf{B}$. We study the geometric separability problem when the separator is…
We illustrate the limitations of the hyperplane separation bound, a non-combinatorial lower bound on the extension complexity of a polytope. Most notably, this bounding technique is used by Rothvo{\ss} (J ACM 64.6:41, 2017) to establish an…
We formulated a mirror-free approach to the mirror conjecture, namely, quantum hyperplane section conjecture, and proved it in the case of nonnegative complete intersections in homogeneous manifolds. For the proof we followed the scheme of…
The theory of geometric structures on a surface with nonempty boundary can be developed by using a decomposition of such a surface into hexagons, in the same way as the theory of geometric structures on a surface without boundary is…
In this survey article we provide an introduction to submanifold geometry in symmetric spaces of noncompact type. We focus on the construction of examples and the classification problems of homogeneous and isoparametric hypersurfaces, polar…
An elegant procedure which characterizes a decomposition of some class of binomial configurations into two other, resembling a definition of Pascal's Triangle, was given in \cite{gevay}. In essence, this construction was already presented…
We introduce a conjecture that we call the {\it Two Hyperplane Conjecture}, saying that an isoperimetric surface that divides a convex body in half by volume is trapped between parallel hyperplanes. The conjecture is motivated by an…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
We describe the canonical correspondence between set of all finite metric spaces and set of special symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those…
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about $t \log t$…
Known results about hypercyclic subspaces concern either Fr\'echet spaces with a continuous norm or the space \omega. We fill the gap between these spaces by investigating Fr\'echet spaces without continuous norm. To this end, we divide…
We study the dual variants of the Erd\H{o}s's distinct distances and unit distance problems. Instead of considering distances determined by points, we consider simplex volumes determined by hyperplanes. We investigate: (1) the maximum…