English
Related papers

Related papers: Arithmetic complexity revisited

200 papers

In this project, we will study the Brauer group that was first defined by R. Brauer. The elements of the Brauer group are the equivalence classes of finite dimensional central simple algebra. Therefore understanding the structure of the…

Rings and Algebras · Mathematics 2019-11-07 Haiyu Chen

Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…

Computational Complexity · Computer Science 2019-01-16 Julian Dörfler , Christian Ikenmeyer , Greta Panova

We study the algebraic complexity of Euclidean distance minimization from a generic tensor to a variety of rank-one tensors. The Euclidean Distance (ED) degree of the Segre-Veronese variety counts the number of complex critical points of…

Algebraic Geometry · Mathematics 2026-01-22 Khazhgali Kozhasov , Alan Muniz , Yang Qi , Luca Sodomaco

We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…

Combinatorics · Mathematics 2011-07-26 Michele D'Adderio , Luca Moci

This contribution investigates the computational complexity of simulating linear ordinary differential equations (ODEs) on digital computers. We provide an exact characterization of the complexity blowup for a class of ODEs of arbitrary…

Computational Complexity · Computer Science 2026-04-14 Adalbert Fono , Noah Wedlich , Holger Boche , Gitta Kutyniok

Algebraic injectivity was introduced to capture homotopical structures like algebraic Kan complexes. But at a much simpler level, it allows one to describe sets with operations subject to no equations. If one wishes to add equations (or…

Category Theory · Mathematics 2022-01-31 John Bourke

We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem…

Formal Languages and Automata Theory · Computer Science 2016-06-29 Julien Cassaigne , Gabriele Fici , Marinella Sciortino , Luca Q. Zamboni

In this paper we generalize an argument of Neukirch from birational anabelian geometry to the case of arithmetic curves. In contrast to the function field case, it seems to be more complicate to describe the position of decomposition groups…

Number Theory · Mathematics 2013-09-12 Alexander Ivanov

Given an oriented $2$-manifold $M$, a locally constant sheaf of lattices $\Lambda$ over $M$, and a pointed morphism $q : \textsf B^2\Lambda \rightarrow \textsf B^4\mathbf C^{\times}$, we define an $\mathbb E_M$-category…

Representation Theory · Mathematics 2025-11-25 Lin Chen , Yifei Zhao

Let $\cC$ be a smooth absolutely irreducible curve of genus $g \ge 1$ defined over $\F_q$, the finite field of $q$ elements. Let $# \cC(\F_{q^n})$ be the number of $\F_{q^n}$-rational points on $\cC$. Under a certain multiplicative…

Number Theory · Mathematics 2010-03-15 Omran Ahmadi , Igor E. Shparlinski

We give an algorithm to explicitly determine all elements of the $q$-torsion (for $q$ an odd prime) of the Brauer group of an elliptic curve over any base field of characteristic different from $q$, containing a primitive $q$-th root of…

Algebraic Geometry · Mathematics 2022-11-23 Charlotte Ure

Let $E$ be an elliptic curve defined over a number field $K$. We say that a prime number $p$ is exceptional for $(E,K)$ if $E$ admits a $p$-isogeny defined over $K$. The so-called exceptional set of all such prime numbers is finite if and…

Number Theory · Mathematics 2010-04-28 Nicolas Billerey

We get three basic results in algebraic dynamics: (1). We give the first algorithm to compute the dynamical degrees to arbitrary precision. (2). We prove that for a family of dominant rational self-maps, the dynamical degrees are lower…

Dynamical Systems · Mathematics 2025-04-01 Junyi Xie

Exact solution to many problems in mathematical physics and quantum field theory often can be expressed in terms of an algebraic curve equipped with a meromorphic differential. Typically, the geometry of the curve can be seen most clearly…

High Energy Physics - Theory · Physics 2012-06-13 Sergei Gukov , Piotr Sułkowski

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…

Computational Complexity · Computer Science 2009-12-31 Marco Pedicini , Mario Piazza

We examine the moduli space E=T* of complex tori T(t)=C/L(t) where L(t)=cost.n(t)Lt. We find that the Dedekind eta function furnishes a bridge between the euclidean and hyperbolic structures on T*=C-L/L as well as between the doubly…

Rings and Algebras · Mathematics 2010-12-14 K. Bugajska

We prove, for an arbitrary finite root system, the periodicity conjecture of Al.B.Zamolodchikov concerning Y-systems, a particular class of functional relations arising in the theory of thermodynamic Bethe ansatz. Algebraically, Y-systems…

High Energy Physics - Theory · Physics 2007-05-23 Sergey Fomin , Andrei Zelevinsky

Given a family $\mathcal{F}=\{A_1,\dots,A_s\}$ of subsets of $\mathbb{Z}_n$, define $\Delta \mathcal{F}$ to be the multiset of all (cyclic) distances dist$(x,y)$, where $\{x,y\} \subset A_i$, $x \neq y$, for some $i=1,\dots,s$. Taking…

Combinatorics · Mathematics 2022-08-12 Peter J Dukes , Tao Gaede

Let $\mathbb{Q}_\infty$ be the cyclotomic $\mathbb{Z}_2$-extension over $\mathbb{Q}$. For each integer $n\geq1$, let $\mathbb{Q}_n$ denote the unique subfield in $\mathbb{Q}_\infty$ such that $[\mathbb{Q}_\infty:\mathbb{Q}]=2^n$. Denote by…

Number Theory · Mathematics 2026-03-17 Li-Tong Deng , Yong-Xiong Li

We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored linear orderings and constructing models of Peano arithmetic…

Logic · Mathematics 2025-07-17 David Gonzalez , Mateusz Łełyk , Dino Rossegger , Patryk Szlufik
‹ Prev 1 8 9 10 Next ›