Related papers: The Algebraic Boundary of Graph Elliptopes

A sequence of vertices in a graph is called a \emph{(total) legal dominating sequence} if every vertex in the sequence (total) dominates at least one vertex not dominated by those ones that precede it, and at the end all vertices of the…

In this paper, we consider a family of closed planar algebraic curves $\mathcal{C}$ which are given in parametrization form via a trigonometric polynomial $p$. When $\mathcal{C}$ is the boundary of a compact convex set, the polynomial $p$…

A cycle $C$ of a graph $G$ is \emph{isolating} if every component of $G-V(C)$ is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle $C$ of length $6 \leq |E(C)| < \left…

Answering a question of Benjamini & Schramm [8], we show that the Poisson boundary of any planar, uniquely absorbing (e.g. one-ended and transient) graph with bounded degrees can be realised geometrically as a circle, namely as the boundary…

The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…

The Orlik-Solomon algebra ${\cal A}(G)$ of a matroid $G$ is the free exterior algebra on the points, modulo the ideal generated by the circuit boundaries. On one hand, this algebra is a homotopy invariant of the complement of any complex…

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

The paper investigates connections between abstract polytopes and properly edge colored graphs. Given any finite n-edge-colored n-regular graph G, we associate to G a simple abstract polytope P_G of rank n, called the colorful polytope of…

The general self-adjoint elliptic boundary value problems are considered in a domain $G\subset \Bbb R^{n+1}$ with finitely many cylindrical ends. The coefficients are stabilizing (as $x\to\infty$, $x\in G$) so slowly that we can only…

In the framework of algebraic topology the closed sequence of 4-dimensional polyhedra(algebraic polytopes) was defined. These polytopes were determined by the second coordination sphere of 8-dimensional lattice E8. The ordered…

The edges surrounding a face of a map $M$ form a cycle $C$, called the boundary cycle of the face, and $C$ is often not a simple cycle. If the map $M$ is arc-transitive, then there is a cyclic subgroup of automorphisms of $M$ which leaves…

This paper investigates the relation between the boundary geometric properties and the boundary regularity of the solutions of elliptic equations. We prove by a new unified method the pointwise boundary H\"{o}lder regularity under proper…

Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G) \subset S$ the edge ideal of a finite graph $G$ on $n$ vertices. Given a vector $\mathfrak{c}\in\mathbb{N}^n$ and an integer $q\geq 1$, we…

Let $P \in \mathbb{Z} [X, Y]$ be a given square-free polynomial of total degree $d$ with integer coefficients of bitsize less than $\tau$, and let $V_{\mathbb{R}} (P) := \{ (x,y) \in \mathbb{R}^2, P (x,y) = 0 \}$ be the real planar…

Let f be a hypersurface surface local singularity whose zero set has 1-dimensional singular locus. We develop an explicit procedure that provides the boundary of the Milnor fibre of f as an oriented plumbed 3-manifold. The method provides…

A waveguide coincides with a three-dimensional domain G having finitely many cylindrical outlets to infinity; the boundary of G is smooth. In G, we consider the stationary Maxwell system with real spectral parameter k and identity matrices…

We study the boundary theory of a connected weighted graph $G$ from the viewpoint of stochastic integration. For the Hilbert space \HE of Dirichlet-finite functions on $G$, we construct a Gel'fand triple $S \ci {\mathcal H}_{\mathcal E} \ci…

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V (G)[E(G) is called the mixed metric dimension of G. In this paper we first establish the exact value of the mixed metric dimension…