Related papers: Algebraic realization of stable Poincar\'e-Reeb gr…
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
We study the geometry of algebraic numbers in the complex plane, and their Diophantine approximation, aided by extensive computer visualization. Motivated by these images, called algebraic starscapes, we describe the geometry of the map…
We consider the Dirichlet-Neumann operator for a nearly spherical domain in R^n, and prove sharp analytic and tame estimates in Sobolev class. The novelty of this paper concerns technical improvements, the most important of which are the…
In this first work dedicated to the generalisation of classic algebraic geometry to non algebraically closed fields and axiomatisable classes of fields, we develop the foundations for equiresidual algebraic geometry (EQAG), i.e. algebraic…
It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…
We introduce the notion of extremal basis of tangent vector fields at a boundary point of finite type of a pseudo-convex domain in $\mathbb{C}^n$. Then we define the class of geometrically separated domains at a boundary point, and give a…
We present a geometric proof of the Poincar\'e-Dulac Normalization Theorem for analytic vector fields with singularities of Poincar\'e type. Our approach allows us to relate the size of the convergence domain of the linearizing…
Let $K$ be the function field of a smooth projective geometrically integral curve over a finite extension of $\mathbb{Q}_p$. Following the works of Harari, Scheiderer, Szamuely, Izquierdo, and Tian, we study the local-global and weak…
The problem of classifying off-shell representations of the $N$ -extended one-dimensional super Poincar\'e algebra is closely related to the study of a class of decorated $N$-regular, $N$-edge colored bipartite graphs known as Adinkras. In…
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…
In this article we obtain new irrationality measures for values of functions which belong to a certain class of hypergeometric functions including shifted logarithmic functions, binomial functions and shifted exponential functions. We…
Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…
We define the total curvature of a semialgebraic embedding of a graph in the 3-dimensional Euclidean space. We prove that it satisfies a Chern-Lashof type inequality and we describe when the equality holds. We also prove a generalization of…
In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to…
We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
The inductive dimension dim(G) of a finite undirected graph G=(V,E) is a rational number defined inductively as 1 plus the arithmetic mean of the dimensions of the unit spheres dim(S(x)) at vertices x primed by the requirement that the…
The phase space of general relativity in a finite subregion is characterized by edge modes localized at the codimension-2 boundary, transforming under an infinite-dimensional group of symmetries. The quantization of this symmetry algebra is…
Belk and Connelly introduced the realizable dimension $\textrm{rd}(G)$ of a finite graph $G$, which is the minimum nonnegative integer $d$ such that every framework $(G,p)$ in any dimension admits a framework in $\mathbb{R}^d$ with the same…