Related papers: Vertex Structure of Master Corner Polyhedra
Let $P$ be a set of $n$ points in general position in the plane. Given a convex geometric shape $S$, a geometric graph $G_S(P)$ on $P$ is defined to have an edge between two points if and only if there exists an empty homothet of $S$ having…
We define certain natural finite sums of $n$'th roots of unity, called $G_P(n)$, that are associated to each convex integer polytope $P$, and which generalize the classical $1$-dimensional Gauss sum $G(n)$ defined over $\mathbb Z/ {n…
The aim of this paper is to use the framework of incidence geometry to develop a theory that permits to model both the inner and outer automorphisms of a group G simultaneously. More precisely, to any group G, we attempt to associate an…
Let $P(N,V)$ denote the vector space of polynomials of maximal degree less than or equal to $N$ in $V$ independent variables. This space is preserved by the enveloping algebra generated by a set of linear, differential operators…
The orbit polytope for a finite group G acting linearly and freely on a sphere S is used to construct a cellularized fundamental domain for the action. A resolution of the integers over G results from the associated G-equivariant…
A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…
The power graph $\mathcal{P}(G)$ of a group $G$ is the graph whose vertex set is $G$, having an edge between two distinct vertices if one is the power of the other. The directed power graph $\vec{\mathcal{P}}(G)$ of a group $G$ is the…
A polyhedron is box-integer if its intersection with any integer box $\{\ell\leq x \leq u\}$ is integer. We define principally box-integer polyhedra to be the polyhedra $P$ such that $kP$ is box-integer whenever $kP$ is integer. We…
We describe a fully faithful embedding of the category of (reflexive) globular sets into the category of counital cosymmetric $R$-coalgebras when $R$ is an integral domain. This embedding is a lift of the usual functor of $R$-chains and the…
We introduce group crosscoders, an extension of crosscoders that systematically discover and analyse symmetrical features in neural networks. While neural networks often develop equivariant representations without explicit architectural…
Let $G=(V,E)$ be a directed graph. A $2$-edge-twinless block in $G$ is a maximal vertex set $C^{t}\subseteq V$ with $|C^{t}|>1$ such that for any distinct vertices $v,w \in C^{t}$, and for every edge $e\in E$, the vertices $v,w$ are in the…
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…
The K-partitioning problem consists of partitioning the vertices of a graph in K sets so as to minimize a function of the edge weights. We introduce a linear mixed integer formulation with edge variables and representative variables. We…
Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the…
Given a Lie group G whose Lie algebra is endowed with a nondegenerate invariant symmetric bilinear form, we construct a Poisson algebra of continuous functions on a certain open subspace R of the space of representations in G of the…
We analyze the space of differentiable functions on a quad-mesh $\cM$, which are composed of 4-split spline macro-patch elements on each quadrangular face. We describe explicit transition maps across shared edges, that satisfy conditions…
These notes survey the theory of (twisted) conformal blocks from an algebro-geometric perspective and have two main goals. The first one is to summarize the construction of conformal blocks from vertex operator algebras, and to describe…
A graph associahedron is a polytope dual to a simplicial complex whose elements are induced connected subgraphs called tubes. Graph associahedra generalize permutahedra, associahedra, and cyclohedra, and therefore are of great interest to…
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…
In this note, we work out a simple inductive proof showing that every polyhedral cone K is the conic hull of a finite set X of vectors. The base cases of the induction are linear subspaces and linear halfspaces of linear subspaces. The…