Related papers: Problems on geometric structures of projective emb…
We study higher-degree generalizations of symplectic groupoids, referred to as {\em multisymplectic groupoids}. Recalling that Poisson structures may be viewed as infinitesimal counterparts of symplectic groupoids, we describe "higher''…
Geometric problems are usually formulated by means of (exterior) differential systems. In this theory, one enriches the system by adding algebraic and differential constraints, and then looks for regular solutions. Here we adopt a dual…
Some of the well known Fefferman like constructions of parabolic geometries end up with a new structure on the same manifold. In this paper, we classify all such cases with the help of the classical Onishchik's lists \cite{onish1} and we…
Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous…
Any procedure applied to data, and any quantity derived from data, is required to respect the nature and symmetries of the data. This axiom applies to refinement procedures and multiresolution transforms as well as to more basic operations…
We describe a procedure, called regularisation, that allows us to study geometric structures on Lie algebroids via foliated geometric structures on a manifold of higher dimension. This procedure applies to various classes of Lie algebroids;…
We build two embedded resolution procedures of a quasi-ordinary singularity of complex analytic hypersurface, by using toric morphisms which depend only on the characteristic monomials associated to a quasi-ordinary projection of the…
We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…
A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…
We introduce and discuss (local) symmetries of geometric structures. These symmetries generalize the classical (locally) symmetric spaces to various other geometries. Our main tools are homogeneous Cartan geometries and their explicit…
In this paper, we study the counterpart of Grothendieck's projectivization construction in the context of derived algebraic geometry. Our main results are as follows: First, we define the derived projectivization of a connective complex,…
Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…
The main goal of this paper is to present the application of structural sums, mathematical objects originating from the computational materials science, in construction of a feature space vector of 2D random composites simulated by…
We present a framework for constructing examples of smooth projective curves over number fields with explicitly given elements in their second K-group using elementary algebraic geometry. This leads to new examples for hyperelliptic curves…
In this paper, we show how one can view certain models in regularity structures as some form of geometric rough paths. This is performed by identifying the deformed Butcher-Connes-Kreimer Hopf algebra with a quotient of the shuffle Hopf…
We survey connections between the theory of bi-Lipschitz embeddings and the Sparsest Cut Problem in combinatorial optimization. The story of the Sparsest Cut Problem is a striking example of the deep interplay between analysis, geometry,…
We define and investigate a geometric object, called an associative geometry, corresponding to an associative algebra (and, more generally, to an associative pair). Associative geometries combine aspects of Lie groups and of generalized…
We define and investigate a geometric object, called an associative geometry, corresponding to an associative algebra (and, more generally, to an associative pair). Associative geometries combine aspects of Lie groups and of generalized…