Related papers: Arithmetic complexity revisited

By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$…

We study infinite families of quadratic and cubic twists of the elliptic curve $E = X_0(27)$. For the family of quadratic twists, we establish a lower bound for the $2$-adic valuation of the algebraic part of the value of the complex…

We study the computational complexity of deciding whether a given set of term equalities and inequalities has a solution in an $\omega$-categorical algebra $\mathfrak{A}$. There are $\omega$-categorical groups where this problem is…

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

We formalize the quantum arithmetic, i.e. a relationship between number theory and operator algebras. Namely, it is proved that rational projective varieties are dual to the $C^*$-algebras with real multiplication. Our construction fits all…

We investigate the class of Kazhdan-Lusztig varieties, and its subclass of matrix Schubert varieties, endowed with a naturally defined torus action. Writing a matrix Schubert variety $\overline{X_w}$ as $\overline{X_w}=Y_w\times…

The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…

Let $X$ be an arithmetic variety over the ring of integers of a number field $K$, with smooth generic fiber $X_K$. We give a formula that relates the dimension of the first Arakelov-Chow vector space of $X$ with the Mordell-Weil rank of the…

Let $\mathbb{F}_q$ denote a finite field of order $q$. A rational function $r(x)\in \mathbb{Q}(x)$ is said to be arithmetically exceptional if it induces a permutation on $\mathbb{P}^1(\mathbb{F}_p)$ for infinitely many primes $p$. Based on…

We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of evaluating each of these polynomials at each fixed rational…

The parity of the analytic rank of an elliptic curve is given by the root number in the functional equation L(E,s). Fixing an elliptic curve over any number field and considering the family of its quadratic twists, it is natural to ask what…

Many iterative algorithms in optimization, computational geometry, computer algebra, and other areas of computer science require repeated computation of some algebraic expression whose input changes slightly from one iteration to the next.…

The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…

We show that the category O for a rational Cherednik algebra of type A is equivalent to modules over a q-Schur algebra (parameter not a half integer), providing thus character formulas for simple modules. We give some generalization to…

In this paper we refine a conjecture relating the time-dependent size of an Einstein-Rosen bridge to the computational complexity of the of the dual quantum state. Our refinement states that the complexity is proportional to the spatial…

In a recent work [Das et al., Bull. Sci. Math. 199 (2025), 103580], the structure of characterized subgroups corresponding to arithmetic-type sequences was investigated. Building upon this work, we further show that a characterized subgroup…

This master thesis describes how Selmer groups can be used to determine the Mordell-Weil group of elliptic curves over a number field K. The Mordell-Weil Theorem states that $E(K) = E(K)_{tors} \times Z^r$, where $r$ is the rank of $E$, and…

Arithmetic groups are groups of matrices with integral entries. We shall first discuss their origin in number theory (Gauss, Minkowski) and their role in the "reduction theory of quadratic forms". Then we shall describe these groups by…

Let $E$ be an elliptic curve over $\mathbb{Q}$ described by $y^2= x^3+ Kx+ L$ where $K, L \in \mathbb{Q}$. A set of rational points $(x_i,y_i) \in E(\mathbb{Q})$ for $i=1, 2, \cdots, k$, is said to be a sequence of consecutive cubes on $E$…

We prove a polynomial bound in the "true complexity" problem of Gowers and Wolf. The proof uses only repeated applications of the Cauchy--Schwarz inequality, answering negatively a question posed by Gowers and Wolf. To choose and reason…