English
Related papers

Related papers: No occurrence obstructions in geometric complexity…

200 papers

In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial. Then, more generally, we also…

Computational Complexity · Computer Science 2009-10-26 V. Arvind , Srikanth Srinivasan

Let $G$ be a real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an arithmetic subgroup of $G$, and $T$ be a maximal $\mathbb{R}$-split torus. A trajectory in $G/\Gamma$ is divergent if eventually it leaves every compact subset. In…

Dynamical Systems · Mathematics 2019-08-14 Nattalie Tamam

In this paper, we treat an open problem related to the number of periodic orbits of Hamiltonian diffeomorphisms on closed symplectic manifolds, so-called generic Conley conjecture. Generic Conley conjecture states that generically…

Symplectic Geometry · Mathematics 2023-08-15 Yoshihiro Sugimoto

we consider a system with homoclinic orbit, We decompose the corresponding variational equation on the space of solutions and provide sufficient conditions for the permanency of homoclinic in the space of $C^1$ vector fields. We also…

Classical Analysis and ODEs · Mathematics 2020-05-12 L. Soleimani , O. RabieiMotlagh , H. M. Mohammadinejad

The higher-dimensional version of Kannan and Lipton's Orbit Problem asks whether it is decidable if a target subspace can be reached from a starting point under repeated application of a linear transformation. Similarly, the continuous…

Logic in Computer Science · Computer Science 2025-08-06 Samuel Everett

We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…

Computational Complexity · Computer Science 2013-03-19 Peter Bürgisser , Christian Ikenmeyer

When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer…

Computational Complexity · Computer Science 2025-10-14 Peter Bürgisser , Mahmut Levent Doğan , Visu Makam , Michael Walter , Avi Wigderson

In this note we introduce the concept of reflective projective varieties. These are stratified projective varieties with certain dimension constraints on their dual varieties. We prove that for such varieties, the Chern-Schwartz-MacPherson…

Algebraic Geometry · Mathematics 2021-03-12 Xiping Zhang

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

Operator Algebras · Mathematics 2018-12-31 Greg Friedman , Efton Park

Recently, the covariant formulation of the geometric bifurcation theory, developed in a previous paper, has been applied to two elementary problems: the study of limit cycles of dynamical systems and the second part of Hilbert's sixteenth…

Dynamical Systems · Mathematics 2024-12-04 Vinícius Barros da Silva , João Peres Vieira , Edson Denis Leonel

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…

Discrete Mathematics · Computer Science 2015-10-02 Jarkko Kari , Michal Szabados

Consider the Wronskians of the classical Hermite polynomials $$H_{\lambda, l}(x):=\mathrm{Wr}(H_l(x),H_{k_1}(x),\ldots, H_{k_n}(x)), \quad l \in \mathbb Z_{\geq 0},$$ where $k_i=\lambda_i+n-i, \,\, i=1,\dots, n$ and $\lambda=(\lambda_1,…

Mathematical Physics · Physics 2016-04-20 William A. Haese-Hill , Martin A. Hallnäs , Alexander P. Veselov

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…

Logic in Computer Science · Computer Science 2025-09-30 Jonas Bayer , Marco David

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

Combinatorics · Mathematics 2021-10-29 C P Anil Kumar

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

Combinatorics · Mathematics 2023-09-12 Bernd S. W. Schröder

In this article we explain the theory of rigid residue complexes in commutative algebra and algebraic geometry, summarizing the background, recent results and anticipated future results. Unlike all previous approaches to Grothendiec…

Algebraic Geometry · Mathematics 2021-02-02 Amnon Yekutieli

For some monoids, we give a method of composing invertibility preserving maps associated to "partial involutions." Also, we define the notion of "determinants for finite dimensional algebras over a field." As examples, we give invertibility…

Rings and Algebras · Mathematics 2023-03-03 Naoya Yamaguchi , Yuka Yamaguchi

We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…

Data Structures and Algorithms · Computer Science 2025-11-04 Oscar Defrain , Arthur Ohana , Simon Vilmin

In 1985, Levy used a theorem of Berstein to prove that all hyperbolic topological polynomials are equivalent to complex polynomials. We prove a partial converse to the Berstein-Levy Theorem: given post-critical dynamics that are in a sense…

Dynamical Systems · Mathematics 2015-03-17 Gregory A. Kelsey