English
Related papers

Related papers: The Edge Geometry of Regular Polygons -- Part 1

200 papers

We characterize the geometry and topology of the set of all weight vectors for which a linear neural network computes the same linear transformation $W$. This set of weight vectors is called the fiber of $W$ (under the matrix multiplication…

Machine Learning · Computer Science 2024-04-24 Jonathan Richard Shewchuk , Sagnik Bhattacharya

For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…

Algebraic Topology · Mathematics 2011-06-29 R. N. Karasev

The family of the complex Grassmann manifolds $G_{n,k}$ with a canonical action of the torus $T^n=\mathbb{T}^{n}$ and the analogue of the moment map $\mu : G_{n,k}\to \Delta _{n,k}$ for the hypersimplex $\Delta _{n,k}$, is well known. In…

Algebraic Topology · Mathematics 2019-07-16 Victor M. Buchstaber , Svjetlana Terzic

We use normal sections to relate the curvature locus of regular (resp. singular corank 1) 3-manifolds in $\mathbb{R}^6$ (resp. $\mathbb R^5$) with regular (resp. singular corank 1) surfaces in $\mathbb R^5$ (resp. $\mathbb R^4$). For…

Differential Geometry · Mathematics 2019-09-17 Pedro Benedini Riul , Raúl Oset Sinha

Following a review of related results in rigidity theory, we provide a construction to obtain generically universally rigid frameworks with the minimum number of edges, for any given set of n nodes in two or three dimensions. When a set of…

Metric Geometry · Mathematics 2014-12-11 Scott D. Kelly , Andrea Micheletti

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Metric Geometry · Mathematics 2020-02-20 Lyle Ramshaw , James B. Saxe

There has been an explosion of interest in statistical models for analyzing network data, and considerable interest in the class of exponential random graph (ERG) models, especially in connection with difficulties in computing maximum…

Machine Learning · Statistics 2009-01-05 Stephen E. Fienberg , Alessandro Rinaldo , Yi Zhou

We study the Teichm\"uller space $\mathcal{T}(S,\underline{p})$ of hyperbolic cone-surfaces of fixed topological type with marked cone singularities. Fix a combinatorial triangulation $G$, and let $\mathcal{T}(G)\subset…

Geometric Topology · Mathematics 2025-12-25 Qiyu Chen , Youliang Zhong

For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…

Combinatorics · Mathematics 2010-06-30 Francis Oger

To a directed graph without loops and 2-cycles, we can associate a skew-symmetric matrix with integer entries. Mutations of such skew-symmetric matrices, and more generally skew-symmetrizable matrices, have been defined in the context of…

Combinatorics · Mathematics 2008-04-07 Harm Derksen , Theodore Owen

A PhD thesis written under supervision of Pawel Nurowski and defended at the Faculty of Physics of the University of Warsaw. We adress the problems of local equivalence and geometry of third order ODEs modulo contact, point and…

Differential Geometry · Mathematics 2008-10-14 Michal Godlinski

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Combinatorics · Mathematics 2018-05-22 A. Iosevich , J. Passant

In this paper we initiate a systematic study of the Tur\'an problem for edge-ordered graphs. A simple graph is called $\textit{edge-ordered}$, if its edges are linearly ordered. An isomorphism between edge-ordered graphs must respect the…

We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by…

It is well-known that a simple $G$-arc-transitive graph can be represented as a coset graph for the group $G$. This representation is extended to a construction of $G$-arc-transitive coset graphs $\Cos(G,H,J)$ with finite valency and finite…

Combinatorics · Mathematics 2022-02-16 Cai Heng Li , Cheryl E. Praeger , Shu Jiao Song

We define two classes of topological infinite degree covering maps modeled on two families of transcendental holomorphic maps. The first, which we call exponential maps of type $(p,q)$, are branched covers and is modeled on transcendental…

Dynamical Systems · Mathematics 2016-03-01 Tao Chen , Yunping Jiang , Linda Keen

We construct natural selfmaps of compact cohomgeneity one manifolds with finite Weyl group and compute their degrees and Lefschetz numbers. On manifolds with simple cohomology rings this yields in certain cases relations between the order…

Differential Geometry · Mathematics 2011-01-27 Thomas Puettmann

We study how to construct explicit deformations of generic smooth maps from closed $n$--dimensional manifolds $M$ with $n \geq 2$ to the $2$--sphere $S^2$ and show that every smooth map $M \to S^2$ is homotopic to a $C^\infty$ stable map…

Geometric Topology · Mathematics 2025-05-30 Osamu Saeki

In an EPG-representation of a graph $G$ each vertex is represented by a path in the rectangular grid, and $(v,w)$ is an edge in $G$ if and only if the paths representing $v$ an $w$ share a grid-edge. Requiring paths representing edges to be…

Computational Geometry · Computer Science 2017-09-05 Therese Biedl , Martin Derka , Vida Dujmovic , Pat Morin

Given a graph, when can we orient the edges to satisfy local constraints at the vertices, where each vertex specifies which local orientations of its incident edges are allowed? This family of graph orientation problems is a special kind of…

Computational Complexity · Computer Science 2026-03-05 MIT Hardness Group , Zachary Abel , Erik D. Demaine , Jenny Diomidova , Jeffery Li , Zixiang Zhou
‹ Prev 1 4 5 6 7 8 10 Next ›