Related papers: An L(1/3) algorithm for ideal class group and regu…

This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…

In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this article we present a modified greedy algorithm of…

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

We construct representations of the Heisenberg algebra by pushing the perturbation expansion to high orders. If the multiplication operators $B_{1,2}$ tend to differential operators of order $l_{2,1}$, respectively, the singularity is…

L-Infinity structures have been a subject of recent interest in physics, where they occur in closed string theory and in gauge theory. This paper provides a class of easily constructible examples of $L_n$ and $L_{\infty}$ structures on…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

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}$…

We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…

We revisit the classical Unit Distance Problem posed by Erd\H{o}s in 1946. While the upper bound of $O(n^{4/3})$ established by Spencer, Szemer'edi, and Trotter (1984) is tight for systems of pseudo-circles, it fails to account for the…

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…

We revisit Munshi's proof of the $t$-aspect subconvex bound for $\rm GL(3)$ $L$-functions, and we are able to remove the `conductor lowering' trick. This simplification along with a more careful stationary phase analysis allows us to…

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

This is a common introduction to math.RT/0101170, math.RT/0306333, math.RT/0506043, math.RT/0601028. Compared to these references there are new results including (i) a description of a separable closure of an extension of transcendence…

This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…

Let F be the cubic field of discriminant -23 and let O be its ring of integers. By explicitly computing cohomology of congruence subgroups of GL(2,O), we computationally investigate modularity of elliptic curves over F.

Recently, Ambainis gave an O(N^(2/3))-query quantum walk algorithm for element distinctness, and more generally, an O(N^(L/(L+1)))-query algorithm for finding L equal numbers. We point out that this algorithm actually solves a much more…

The average-case complexity of a branch-and-bound algorithms for Minimum Dominating Set problem in random graphs in the G(n,p) model is studied. We identify phase transitions between subexponential and exponential average-case complexities,…

One important goal of black-box complexity theory is the development of complexity models allowing to derive meaningful lower bounds for whole classes of randomized search heuristics. Complementing classical runtime analysis, black-box…