English
Related papers

Related papers: Geometric Complexity Theory VI: the flip via satur…

200 papers

We study the geometry of equivariant, proper maps from homogeneous bundles $G\times_P V$ over flag varieties $G/P$ to representations of $G$, called collapsing maps. Kempf showed that, provided the bundle is completely reducible, the image…

Algebraic Geometry · Mathematics 2021-10-06 András Cristian Lőrincz

The problem of optimizing over random structures emerges in many areas of science and engineering, ranging from statistical physics to machine learning and artificial intelligence. For many such structures finding optimal solutions by means…

Computational Complexity · Computer Science 2022-10-12 David Gamarnik

Previously, the authors proved that the presentation complex of a one-relator group $G$ satisfies a geometric condition called negative immersions if every two-generator, one-relator subgroup of $G$ is free. Here, we prove that one-relator…

Group Theory · Mathematics 2024-02-09 Larsen Louder , Henry Wilton

We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity.…

Logic in Computer Science · Computer Science 2012-10-26 Ugo Dal Lago , Barbara Petit

Let $\mathfrak{g}_{\mathbb{R}}$ be a split real, simple Lie algebra with complexification $\mathfrak{g}$. Let $G_{\mathbb{C}}$ be the connected, simply connected Lie group with Lie algebra $\mathfrak{g}$, $G_{\mathbb{R}}$ the connected…

Representation Theory · Mathematics 2013-05-07 Seung Won Lee

We formulate a quantization commutes with reduction principle in the setting where the Lie group $G$, the symplectic manifold it acts on, and the orbit space of the action may all be noncompact. It is assumed that the action is proper, and…

Differential Geometry · Mathematics 2015-07-28 Peter Hochs , Varghese Mathai

We investigate the representation theory of domestic group schemes $\mathcal{G}$ over an algebraically closed field of characteristic $p > 2$. We present results about filtrations of induced modules, actions on support varieties, Clifford…

Representation Theory · Mathematics 2016-04-04 Dirk Kirchhoff

Pipage rounding is a dependent random sampling technique that has several interesting properties and diverse applications. One property that has been particularly useful is negative correlation of the resulting vector. Unfortunately…

Data Structures and Algorithms · Computer Science 2013-07-10 Nicholas J. A. Harvey , Neil Olver

Basic properties of symplectic reflection algebras over an algebraically closed field k of positive characteristic are laid out. These algebras are always finite modules over their centres, in contrast to the situation in characteristic 0.…

Rings and Algebras · Mathematics 2007-09-17 Kenneth A. Brown , Kanokporn Changtong

A new procedure for the construction of higher-dimensional Lie-Hamilton systems is proposed. This method is based on techniques belonging to the representation theory of Lie algebras and their realization by vector fields. The notion of…

Mathematical Physics · Physics 2024-11-26 Rutwig Campoamor-Stursberg , Oscar Carballal , Francisco J. Herranz

Negation operation is important in intelligent information processing. Different with existing arithmetic negation, an exponential negation is presented in this paper. The new negation can be seen as a kind of geometry negation. Some basic…

Artificial Intelligence · Computer Science 2021-04-02 Qinyuan Wu , Yong Deng , Neal Xiong

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…

Logic in Computer Science · Computer Science 2018-12-11 Akitoshi Kawamura , Donghyun Lim , Svetlana Selivanova , Martin Ziegler

Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…

Computational Complexity · Computer Science 2025-10-28 Markus Bläser , Sagnik Dutta , Gorav Jindal

In this paper, we give a new generalization of positive sectional curvature called positive weighted sectional curvature. It depends on a choice of Riemannian metric and a smooth vector field. We give several simple examples of Riemannian…

Differential Geometry · Mathematics 2014-10-08 Lee Kennard , William Wylie

A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…

Group Theory · Mathematics 2019-02-08 Andre Nies

Let $G$ be a simple, simply connected algebraic group over an algebraically closed field of prime characteristic $p>0$. Recent work of Kildetoft and Nakano and of Sobaje has shown close connections between two long-standing conjectures of…

Representation Theory · Mathematics 2018-07-13 Christopher P. Bendel , Daniel K. Nakano , Cornelius Pillen , Paul Sobaje

We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…

Computational Complexity · Computer Science 2026-03-24 M. Alasli

The finite-dimensional restricted simple Lie algebras of characteristic p > 5 are classical or of Cartan type. The classical algebras are analogues of the simple complex Lie algebras and have a well-advanced representation theory with…

Representation Theory · Mathematics 2015-09-23 Georgia Benkart , Jörg Feldvoss

We develop an approach to the character theory of certain classes of finite and profinite groups based on the construction of a Lie algebra associated to such a group, but without making use of the notion of a polarization which is central…

Representation Theory · Mathematics 2007-05-23 Mitya Boyarchenko , Maria Sabitova

This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…

Computational Complexity · Computer Science 2025-11-19 Milan Rosko