English
Related papers

Related papers: Exploring Continuous Tensegrities

200 papers

We attempt to shed new light on the notion of 'tree-like' metric spaces by focusing on an approach that does not use the four-point condition. Our key question is: Given metric space $M$ on $n$ points, when does a fully labelled…

Combinatorics · Mathematics 2015-12-08 Momoko Hayamizu , Kenji Fukumizu

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

Differential Geometry · Mathematics 2016-03-22 Roberto Frigerio , Jean-Francois Lafont , Alessandro Sisto

One of Erdos's conjectures states that every triangle-free graph on $n$ vertices has an induced subgraph on $n/2$ vertices with at most $n^2/50$ edges. We report several partial results towards this conjecture. In particular, we establish…

Combinatorics · Mathematics 2022-04-06 Alexander Razborov

We will address the existence of a new symmetry for an imperfect fluid by introducing local four-velocity gauge-like transformations for the case when there is vorticity. A similar tetrad formulation as to the Einstein-Maxwell spacetimes…

General Relativity and Quantum Cosmology · Physics 2026-03-05 Alcides Garat

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…

Combinatorics · Mathematics 2023-10-31 Martin Milanič , Nicolas Trotignon

A d-dimensional framework is an embedding of the vertices and edges of a graph in Euclidean space. A d-dimensional framework is globally rigid if every other d-dimensional framework with the same edge lengths has the same pairwise distances…

Metric Geometry · Mathematics 2010-12-30 Matthew Jacobs

This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in…

Optimization and Control · Mathematics 2015-03-03 Daniel Zelazo , Mathias Bürger

In 2005, Bob Connelly showed that a generic framework in $\bR^d$ is globally rigid if it has a stress matrix of maximum possible rank, and that this sufficient condition for generic global rigidity is preserved by the 1-extension operation.…

Metric Geometry · Mathematics 2015-06-22 Bill Jackson , Anthony Nixon

This monograph resolves - in a dense class of cases - several open problems concerning geodesics in i.i.d. first-passage percolation on $\mathbb{Z}^d$. Our primary interest is in the empirical measures of edge-weights observed along…

Probability · Mathematics 2021-10-04 Erik Bates

This paper presents a formal definition of stability for node centrality measures in weighted graphs. It is shown that the commonly used measures of degree, closeness and eigenvector centrality are stable whereas betweenness centrality is…

Social and Information Networks · Computer Science 2014-10-21 Santiago Segarra , Alejandro Ribeiro

We show that if two 4-dimensional metrics of arbitrary signature on one manifold are geodesically equivalent (i.e., have the same geodesics considered as unparameterized curves) and are solutions of the Einstein field equation with the same…

Differential Geometry · Mathematics 2015-10-02 Volodymir Kiosak , Vladimir S. Matveev

In this Thesis we investigate properties of stability, rigidity and unitarity of the string landscape in ten and lower dimensions. The dissertation explores these aspects by intertwining a detailed analysis of string vacua, with and without…

High Energy Physics - Theory · Physics 2024-08-02 Giorgio Leone

This work analyzes the convergence properties of signed networks with nonlinear edge functions. We consider diffusively coupled networks comprised of maximal equilibrium-independent passive (MEIP) dynamics on the nodes, and a general class…

Systems and Control · Computer Science 2019-03-28 Hao Chen , Daniel Zelazo , Xiangke Wang , Lincheng Shen

It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…

Differential Geometry · Mathematics 2025-05-05 Rafael López

Holographic tensor networks model AdS/CFT, but so far they have been limited by involving only systems that are very different from gravity. Unfortunately, we cannot straightforwardly discretize gravity to incorporate it, because that would…

High Energy Physics - Theory · Physics 2024-11-12 Chris Akers , Ronak M. Soni , Annie Y. Wei

If we take a (bar-joint) framework, prepare an identical copy of this framework, translate it by some vector $\tau$, and finally join corresponding points of the two copies, then we obtain a framework with `extrusion' symmetry in the…

Metric Geometry · Mathematics 2024-07-22 John Owen , Bernd Schulze

We study the dynamics of an inclined tensioned, heavy cable traveling with a constant speed in the vertical plane. The cable is modeled as a beam resisting bending and shear. The governing equation for the transverse in-plane vibrations of…

Classical Physics · Physics 2019-07-09 Abhinav R. Dehadrai , Ishan Sharma , Shakti S. Gupta

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

Metric Geometry · Mathematics 2013-10-08 D. Kitson , S. C. Power

We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…

Combinatorics · Mathematics 2016-05-31 David Jekel

Combinatorial characterisations of minimal rigidity are obtained for symmetric 2-dimensional bar-joint frameworks with either $\ell^1$ or $\ell^\infty$ distance constraints. The characterisations are expressed in terms of symmetric tree…

Combinatorics · Mathematics 2016-04-01 Derek Kitson , Bernd Schulze
‹ Prev 1 4 5 6 7 8 10 Next ›