Related papers: Rationality is decidable for nearly Euclidean Thur…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…
Most work on computational complexity is concerned with time. However this course will try to show that program-size complexity, which measures algorithmic information, is of much greater philosophical significance. I'll discuss how one can…
We propose an approach for showing rationality of an algebraic variety $X$. We try to cover $X$ by rational curves of certain type and count how many curves pass through a generic point. If the answer is $1$, then we can sometimes reduce…
The traditional view in numerical conformal mapping is that once the boundary correspondence function has been found, the map and its inverse can be evaluated by contour integrals. We propose that it is much simpler, and 10-1000 times…
This paper examines fields of rationality in families of cuspidal automorphic representations of unitary groups. Specifically, for a fixed $A$ and a sufficiently large family $\mathcal{F}$, a small proportion of representations $\pi\in…
Rational functions of total degree $l$ in n variables have a representation in the Bernstein form defined over $n$ dimensional simplex. The range of a rational function is bounded by the smallest and the largest rational Bernstein…
Let $Rat_d$ denote the space of holomorphic self-maps of ${\bf P}^1$ of degree $d\geq 2$, and $\mu_f$ the measure of maximal entropy for $f\in Rat_d$. The map of measures $f\mapsto\mu_f$ is known to be continuous on $Rat_d$, and it is shown…
We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
Consider a function f which is defined on the integers from 1 to N and takes the values -1 and +1. The parity of f is the product over all x from 1 to N of f(x). With no further information about f, to classically determine the parity of f…
The computational power of quantum computers poses major challenges to new design tools since representing pure quantum states typically requires exponentially large memory. As shown previously, decision diagrams can reduce these memory…
Rationality has been an intriguing topic for several decades. Even the scope of definition of rationality across different subjects varies. Several theories (e.g., game theory) initially evolved on the basis that agents (e.g., humans) are…
We investigate unitary and state $t$-designs from a computational complexity perspective. First, we address the problems of computing frame potentials that characterize (approximate) $t$-designs. We present a quantum algorithm for computing…
In this note we give an algorithm to determine the rational homotopy type of the free and pointed mapping spaces $ map(F(\mathbb R^m,k), S^n)$ and $ map^*(F(\mathbb R^m,k), S^n)$. An explicit description of these spaces is given for $k=3$.…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
There is both theoretical and numerical evidence that the set of irreducible representations of a reductive group over local or finite fields is naturally partitioned into families according to analytic properties of representations.…
Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this…
We show the resolution of indeterminacy of rational maps from a regular surface to a tame stack locally of finite type over an excellent scheme. The proof uses the valuative criterion for proper tame morphisms, which was proved by Bresciani…