English
Related papers

Related papers: Complexity of linear circuits and geometry

200 papers

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Optimization and Control · Mathematics 2010-04-08 Didier Henrion

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Optimization and Control · Mathematics 2008-12-10 Didier Henrion

Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…

Computational Complexity · Computer Science 2026-04-24 Piotr Kawałek , Jacek Krzaczkowski

We prove metric rigidity for complete manifolds supporting solutions of certain second order differential systems, thus extending classical works on a characterization of space-forms. In the route, we also discover new characterizations of…

Differential Geometry · Mathematics 2009-03-06 Stefano Pigola , Michele Rimoldi

We use reproducing kernel methods to study various rigidity problems. The methods and setting allow us to also consider the non-positive case.

Complex Variables · Mathematics 2007-09-18 Daniel Alpay , Simeon Reich , David Shoikhet

In this paper we focus on algebraic aspects of contractions of Lie and Leibniz algebras. The rigidity of algebras plays an important role in the study of their varieties. The rigid algebras generate the irreducible components of this…

Rings and Algebras · Mathematics 2017-08-02 A. O. Abdulkareem , I. S. Rakhimov , SH. K. Said Hussain

We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…

Combinatorics · Mathematics 2024-02-28 Sean Dewar , Georg Grasegger , Eleftherios Kastis , Anthony Nixon , Brigitte Servatius

An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…

Logic in Computer Science · Computer Science 2024-04-24 Ivo Düntsch , Ian Pratt-Hartmann

The purpose of this article is to produce effective versions of some rigidity results in algebra and geometry. On the geometric side, we focus on the spectrum of primitive geodesic lengths (resp., complex lengths) for arithmetic hyperbolic…

Geometric Topology · Mathematics 2018-11-21 Benjamin Linowitz , D. B. McReynolds , Paul Pollack , Lola Thompson

We consider ruled surfaces with finite multiplicity. We study behaviors of the striction curves and the singularities of the ruled surfaces. We also give geometric meanings of invariants related to the ruled surfaces.

Differential Geometry · Mathematics 2025-05-21 Hiroyuki Hayashi

A ring is rigid if there is no nonzero locally nilpotent derivation on it. In terms of algebraic geometry, a rigid coordinate ring corresponds to an algebraic affine variety which does not allow any nontrivial algebraic additive group…

Algebraic Geometry · Mathematics 2010-05-28 Anthony J. Crachiola , Stefan Maubach

A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…

History and Overview · Mathematics 2025-08-19 James Cruickshank , Bill Jackson , Tibor Jordán , Shin-ichi Tanigawa

Recently, Dvir, Golovnev, and Weinstein have shown that sufficiently strong lower bounds for linear data structures would imply new bounds for rigid matrices. However, their result utilizes an algorithm that requires an $NP$ oracle, and…

Computational Complexity · Computer Science 2019-10-29 Sivaramakrishnan Natarajan Ramamoorthy , Cyrus Rashtchian

This is a survey primarily about determining the border rank of tensors, especially those relevant for the study of the complexity of matrix multiplication. This is a subject that on the one hand is of great significance in theoretical…

Algebraic Geometry · Mathematics 2022-08-02 J. M. Landsberg

In the first section we recall some basic notions on Lie algebras. In a second time we study the algebraic variety of complex $n$-dimensional Lie algebras. We present different notions of deformations : Gerstenhaber deformations,…

Rings and Algebras · Mathematics 2007-05-23 Michel Goze

We prove a super-rigidity result for algebraic representations over complete fields of irreducible lattices in product of groups and lattices with dense commensurator groups. We derive some criteria for non-linearity of such groups.

Group Theory · Mathematics 2019-12-04 Uri Bader , Alex Furman

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

This thesis studies arithmetic of linear algebraic groups. It involves studying the properties of linear algebraic groups defined over global fields, local fields and finite fields, or more generally the study of the linear algebraic groups…

Group Theory · Mathematics 2007-05-23 Shripad M. Garge

An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…

Representation Theory · Mathematics 2023-12-04 Anjali , Fahed Zulfeqarr , Akhil Prakash , Prabhat Kumar

This article is concerned with the rigidity properties of geometric realizations of incidence geometries of rank two as points and lines in the Euclidean plane; we care about the distance being preserved among collinear points. We discuss…

Combinatorics · Mathematics 2022-04-28 Signe Lundqvist , Klara Stokes , Lars-Daniel Öhman