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

We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…

Any representational enterprise must omit variation in order to function. NASA still uses Newtonian mechanics, though Einstein superseded Newton, and the standard picture of scientific progress cannot explain how. A description that omitted…

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

This paper, following (Dymetman:1998), presents an approach to grammar description and processing based on the geometry of cancellation diagrams, a concept which plays a central role in combinatorial group theory (Lyndon-Schuppe:1977). The…

One of the key problems in dealing with color in rendering, shading, compositing, or image manipulation is that we do not have algebraic structures that support operations over colors. In this paper, we present an all-encompassing framework…

We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…

Let $G$ be a finite group, and let $H$ be a subgroup of $G$. We compute the probability, denoted by $P_G(H)$, that a left transversal of $H$ in $G$ is also a right transversal, thus a two-sided one. Moreover, we define, and denote by…

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class $\exists \mathbb{R}$ plays a crucial role in the study of geometric problems. Sometimes $\exists \mathbb{R}$ is referred to as the 'real…

In the current debate referring to the construction of a tenable background independent theory of Quantum Gravity we introduce the notion of topos-theoretic relativization of physical representability and demonstrate its relevance…

This survey contains a selection of topics unified by the concept of positive semi-definiteness (of matrices or kernels), reflecting natural constraints imposed on discrete data (graphs or networks) or continuous objects (probability or…

We study an open question at the interplay between the classical and the dynamical Mordell-Lang conjectures in positive characteristic. Let $K$ be an algebraically closed field of positive characteristic, let $G$ be a finitely generated…

Artin Presentation Theory, (AP Theory), is a new, direct infusion, via pure braid theory, of discrete group theory, (i.e., symmetry in its purest form), into the theory of {\it smooth} 4-manifolds, (i.e.,$(3+1)$-Quantum Gravity in its…

In traditional quantum computing, it has been established that real quantum computation augmented with non-Clifford gates is as powerful as universal quantum computation. Here we investigate this phenomenon in the non-Hermitian setting. We…

Let G be a reductive group over an algebraically closed field k of separably good characteristic p>0 for G. Under these assumptions a Springer isomorphism from the reduced nilpotent scheme of the Lie algebra of G to the reduced unipotent…

Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…

The basic (and traditional) crossing number problem is to determine the minimum number of crossings in a topological drawing of an input graph in the plane. We develop a unified framework yielding fixed-parameter tractable (FPT) algorithms…

We prove that many of the results of the LMMP hold for $3$-folds over fields of characteristic $p>5$ which are not necessarily perfect. In particular, the existence of flips, the cone theorem, the contraction theorem for birational extremal…

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

Geometry constitutes a core set of intuitions present in all humans, regardless of their language or schooling [1]. Could brain's built in machinery for processing geometric information take part in uncertainty representation? For decades…