Showing papers on "Algebraic number published in 2015"

The tropicalization of the moduli space of curves

Abstract: We show that the skeleton of the Deligne-MumfordKnudsen moduli stack of stable curves is naturally identified with the moduli space of extended tropical curves, and that this is compatible with the “naive” set-theoretic tropicalization map. The proof passes through general structure results on the skeleton of a toroidal Deligne-Mumford stack. Furthermore, we construct tautological forgetful, clutching, and gluing maps between moduli spaces of extended tropical curves and show that they are compatible with the analogous tautological maps in the algebraic setting.

Algebraic QFT in Curved Spacetime and Quasifree Hadamard States: An Introduction

Abstract: Within this chapter we introduce the overall idea of the algebraic formalism of QFT on a fixed globally hyperbolic spacetime in the framework of unital \(*\)-algebras. We point out some general features of CCR algebras, such as simplicity and the construction of symmetry-induced homomorphisms. For simplicity, we deal only with a real scalar quantum field. We discuss some known general results in curved spacetime like the existence of quasifree states enjoying symmetries induced from the background, pointing out the relevant original references. We introduce, in particular, the notion of a Hadamard quasifree algebraic quantum state, both in the geometric and microlocal formulation, and the associated notion of Wick polynomials.

Binary quartic forms having bounded invariants, and the boundedness of the average rank of elliptic curves

Abstract: We prove a theorem giving the asymptotic number of binary quartic forms having bounded invariants; this extends, to the quartic case, the classical results of Gauss and Davenport in the quadratic and cubic cases, respectively. Our techniques are quite general and may be applied to counting integral orbits in other representations of algebraic groups. We use these counting results to prove that the average rank of elliptic curves over Q, when ordered by their heights, is bounded. In particular, we show that when elliptic curves are ordered by height, the mean size of the 2-Selmer group is 3. This implies that the limsup of the average rank of elliptic curves is at most 1:5.

A Luna \'etale slice theorem for algebraic stacks

Abstract: We prove that every algebraic stack, locally of finite type over an algebraically closed field with affine stabilizers, is etale-locally a quotient stack in a neighborhood of a point with a linearly reductive stabilizer group. The proof uses an equivariant version of Artin's algebraization theorem proved in the appendix. We provide numerous applications of the main theorems.

A classical model for derived critical loci

Abstract: Let $f:U\to{\mathbb A}^1$ be a regular function on a smooth scheme $U$ over a field $\mathbb K$. Pantev, Toen, Vaquie and Vezzosi (arXiv:1111.3209, arXiv:1109.5213) define the "derived critical locus" Crit$(f)$, an example of a new class of spaces in derived algebraic geometry, which they call "$-1$-shifted symplectic derived schemes". They show that intersections of algebraic Lagrangians in a smooth symplectic $\mathbb K$-scheme, and stable moduli schemes of coherent sheaves on a Calabi-Yau 3-fold over $\mathbb K$, are also $-1$-shifted symplectic derived schemes. Thus, their theory may have applications in algebraic symplectic geometry, and in Donaldson-Thomas theory of Calabi-Yau 3-folds. This paper defines and studies a new class of spaces we call "algebraic d-critical loci", which should be regarded as classical truncations of $-1$-shifted symplectic derived schemes. They are simpler than their derived analogues. We also give a complex analytic version of the theory, "complex analytic d-critical loci", and an extension to Artin stacks, "d-critical stacks". In the sequels arXiv:1305.6302, arXiv:1211.3259, arXiv:1305.6428, arXiv:1312.0090 we will define truncation functors from $-1$-shifted symplectic derived schemes or stacks to algebraic d-critical loci or d-critical stacks, and we will apply d-critical loci to motivic and categorified Donaldson-Thomas theory, and to intersections of (derived) complex Lagrangians in complex symplectic manifolds. We will show that the important structures one wants to associate to a derived critical locus -- virtual cycles, perverse sheaves and mixed Hodge modules of vanishing cycles, and motivic Milnor fibres -- can be defined for oriented d-critical loci and oriented d-critical stacks.

An Algebraic Approach to the Analytic Bootstrap

Abstract: We develop an algebraic approach to the analytic bootstrap in CFTs. By acting with the Casimir operator on the crossing equation we map the problem of doing large spin sums to any desired order to the problem of solving a set of recursion relations. We compute corrections to the anomalous dimension of large spin operators due to the exchange of a primary and its descendants in the crossed channel and show that this leads to a Borel-summable expansion. We analyse higher order corrections to the microscopic CFT data in the direct channel and its matching to infinite towers of operators in the crossed channel. We apply this method to the critical $O(N)$ model. At large $N$ we reproduce the first few terms in the large spin expansion of the known two-loop anomalous dimensions of higher spin currents in the traceless symmetric representation of $O(N)$ and make further predictions. At small $N$ we present the results for the truncated large spin expansion series of anomalous dimensions of higher spin currents.

Algebraic twists of modular forms and Hecke orbits

Abstract: We consider the question of the correlation of Fourier coefficients of modular forms with functions of algebraic origin. We establish the absence of correlation in considerable generality (with a power saving of Burgess type) and a corresponding equidistribution property for twisted Hecke orbits. This is done by exploiting the amplification method and the Riemann Hypothesis over finite fields, relying in particular on the l-adic Fourier transform introduced by Deligne and studied by Katz and Laumon.

Homoclinic groups, IE groups, and expansive algebraic actions

Abstract: We give algebraic characterizations for expansiveness of algebraic actions of countable groups. The notion of $$p$$ -expansiveness is introduced for algebraic actions, and we show that for countable amenable groups, a finitely presented algebraic action is $$1$$ -expansive exactly when it has finite entropy. We also study the local entropy theory for actions of countable amenable groups on compact groups by automorphisms, and show that the IE group determines the Pinsker factor for such actions. For an expansive algebraic action of a polycyclic-by-finite group on $$X$$ , it is shown that the entropy of the action is equal to the entropy of the induced action on the Pontryagin dual of the homoclinic group, the homoclinic group is a dense subgroup of the IE group, the homoclinic group is nontrivial exactly when the action has positive entropy, and the homoclinic group is dense in $$X$$ exactly when the action has completely positive entropy.

Asymptotic laws for the spatial distribution and the number of connected components of zero sets of Gaussian random functions

Abstract: We study the asymptotic laws for the spatial distribution and the number of connected components of zero sets of smooth Gaussian random functions of several real variables. The primary examples are various Gaussian ensembles of real-valued polynomials (algebraic or trigonometric) of large degree on the sphere or torus, and translation-invariant smooth Gaussian functions on the Euclidean space restricted to large domains.

The algebraic combinatorial approach for low-rank matrix completion

Abstract: We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the treatment of single entries in a closed theoretical and practical framework. More specifically, apart from introducing an algebraic combinatorial theory of low-rank matrix completion, we present probability-one algorithms to decide whether a particular entry of the matrix can be completed. We also describe methods to complete that entry from a few others, and to estimate the error which is incurred by any method completing that entry. Furthermore, we show how known results on matrix completion and their sampling assumptions can be related to our new perspective and interpreted in terms of a completability phase transition.

Dynamical degrees of birational transformations of projective surfaces

Abstract: The dynamical degree lambda( f ) of a birational transformation f measures the exponential growth rate of the degree of the formulae that define the n -th iterate of f . We study the set of all dynamical degrees of all birational transformations of projective surfaces, and the relationship between the value of lambda( f ) and the structure of the conjugacy class of f . For instance, the set of all dynamical degrees of birational transformations of the complex projective plane is a closed and well ordered set of algebraic numbers.

A Groebner Bases Theory-Based Method for Selective Harmonic Elimination

Abstract: An algebraic method is proposed for selective harmonic elimination PWM (SHEPWM). By computing its Groebner bases under the pure lexicographic monomial order, the nonlinear high-order SHE equations are converted to an equivalent triangular form, and then a recursive algorithm is used to solve the triangular equations one by one. Based on the proposed method, a user-friendly software package has been developed and some computation results are given. Unlike the commonly used numerical and intelligent methods, this method does not need to choose the initial values and can find all the solutions. Also, this method can give a definite answer to the question of whether the SHE equations have solutions or not, and the accuracy of the solved switching angles are much higher than that of the reference method. Compared with the existing algebraic methods, such as the resultant elimination method, the calculation efficiency is improved. Experimental verification is also shown in this paper.

Algebraic Methods in the Congested Clique

Abstract: In this work, we use algebraic methods for studying distance computation and subgraph detection tasks in the congested clique model. Specifically, we adapt parallel matrix multiplication implementations to the congested clique, obtaining an $O(n^{1-2/\omega})$ round matrix multiplication algorithm, where $\omega < 2.3728639$ is the exponent of matrix multiplication. In conjunction with known techniques from centralised algorithmics, this gives significant improvements over previous best upper bounds in the congested clique model. The highlight results include: -- triangle and 4-cycle counting in $O(n^{0.158})$ rounds, improving upon the $O(n^{1/3})$ triangle detection algorithm of Dolev et al. [DISC 2012], -- a $(1 + o(1))$-approximation of all-pairs shortest paths in $O(n^{0.158})$ rounds, improving upon the $\tilde{O} (n^{1/2})$-round $(2 + o(1))$-approximation algorithm of Nanongkai [STOC 2014], and -- computing the girth in $O(n^{0.158})$ rounds, which is the first non-trivial solution in this model. In addition, we present a novel constant-round combinatorial algorithm for detecting 4-cycles.

Lifting harmonic morphisms II: Tropical curves and metrized complexes

Abstract: We prove several lifting theorems for morphisms of tropical curves. We interpret the obstruction to lifting a finite harmonic morphism of augmented metric graphs to a morphism of algebraic curves as the nonvanishing of certain Hurwitz numbers, and we give various conditions under which this obstruction does vanish. In particular, we show that any finite harmonic morphism of (nonaugmented) metric graphs lifts. We also give various applications of these results. For example, we show that linear equivalence of divisors on a tropical curve C coincides with the equivalence relation generated by declaring that the fibers of every finite harmonic morphism from C to the tropical projective line are equivalent. We study liftability of metrized complexes equipped with a finite group action, and use this to classify all augmented metric graphs arising as the tropicalization of a hyperelliptic curve. We prove that there exists a d-gonal tropical curve that does not lift to a d-gonal algebraic curve.This article is the second in a series of two.

Irreducible representations of Leavitt path algebras

Abstract: We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic branching systems, to which irreducible representations of the Leavitt path algebra are associated. For a certain quiver, we obtain a faithful completely reducible representation of the Leavitt path algebra. The twisted representations of the constructed ones under the scaling action are studied.

Local-global principles for torsors over arithmetic curves

Abstract: We consider local-global principles for torsors under linear algebraic groups, over function fields of curves over complete discretely valued fields. The obstruction to such a principle is a version of the Tate-Shafarevich group; and for groups with rational components, we compute it explicitly and show that it is finite. This yields necessary and sufficient conditions for local-global principles to hold. Our results rely on first obtaining a Mayer-Vietoris sequence for Galois cohomology and then showing that torsors can be patched. We also give new applications to quadratic forms and central simple algebras.

Toric varieties, monoid schemes and cdh descent

Abstract: We give conditions for the Mayer-Vietoris property to hold for the algebraic K-theory of blow-up squares of toric varieties and schemes, using the theory of monoid schemes. These conditions are used to relate algebraic K-theory to topological cyclic homology in characteristic p. To achieve our goals, we develop many notions for monoid schemes based on classical algebraic geometry, such as separated and proper maps and resolution of singularities.

Growth in groups: ideas and perspectives

Abstract: This is a survey of methods developed in the last few years to prove results on growth in non-commutative groups. These techniques have their roots in both additive combinatorics and group theory, as well as other fields. We discuss linear algebraic groups, with SL_2(Z/pZ) as the basic example, as well as permutation groups. The emphasis lies on the ideas behind the methods.

Evolution algebras and graphs

Abstract: A digraph is attached to any evolution algebra. This graph leads to some new purely algebraic results on this class of algebras and allows for some new natural proofs of known results. Nilpotency of an evolution algebra will be proved to be equivalent to the nonexistence of oriented cycles in the graph. Besides, the automorphism group of any evolution algebra ℰ with ℰ = ℰ2 will be shown to be always finite.

Formulae and Asymptotics for Coefficients of Algebraic Functions

Abstract: We study the coefficients of algebraic functions ∑ n≥0 f n z n . First, we recall the too-little-known fact that these coefficients f n always admit a closed form. Then we study their asymptotics, known to be of the type f n ~ CA n n α. When the function is a power series associated to a context-free grammar, we solve a folklore conjecture: the critical exponents α cannot be 1/3 or −5/2; they in fact belong to a proper subset of the dyadic numbers. We initiate the study of the set of possible values for A. We extend what Philippe Flajolet called the Drmota–Lalley–Woods theorem (which states that α=−3/2 when the dependency graph associated to the algebraic system defining the function is strongly connected). We fully characterize the possible singular behaviours in the non-strongly connected case. As a corollary, the generating functions of certain lattice paths and planar maps are not determined by a context-free grammar (i.e., their generating functions are not ℕ-algebraic). We give examples of Gaussian limit laws (beyond the case of the Drmota–Lalley–Woods theorem), and examples of non-Gaussian limit laws. We then extend our work to systems involving non-polynomial entire functions (non-strongly connected systems, fixed points of entire functions with positive coefficients). We give several closure properties for ℕ-algebraic functions. We end by discussing a few extensions of our results (infinite systems of equations, algorithmic aspects).

Badly approximable points on manifolds

Abstract: This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport’s problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt’s problem regarding the intersections of the sets of weighted badly approximable points. The problems have been recently settled in dimension two but remain open in higher dimensions. In this paper we develop new techniques that allow us to tackle them in full generality. The techniques rest on lattice points counting and a powerful quantitative result of Bernik, Kleinbock and Margulis. The main theorem of this paper implies that any finite intersection of the sets of weighted badly approximable points on any analytic nondegenerate submanifold of $$\mathbb {R}^n$$ has full dimension. One of the consequences of this result is the existence of transcendental real numbers badly approximable by algebraic numbers of any bounded degree.

Group theoretic, lie algebraic and Jordan algebraic formulations of the sic existence problem

Abstract: Although symmetric informationally complete positive operator valued measures (SIC POVMs, or SICs for short) have been constructed in every dimension up to 67, a general existence proof remains elusive. The purpose of this paper is to show that the SIC existence problem is equivalent to three other, on the face of it quite different problems. Although it is still not clear whether these reformulations of the problem will make it more tractable, we believe that the fact that SICs have these connections to other areas of mathematics is of some intrinsic interest. Specifically, we reformulate the SIC problem in terms of (1) Lie groups, (2) Lie algebras and (3) Jordan algebras (the second result being a greatly strengthened version of one previously obtained by Appleby, Flammia and Fuchs). The connection between these three reformulations is non-trivial: It is not easy to demonstrate their equivalence directly, without appealing to their common equivalence to SIC existence. In the course of our analysis we obtain a number of other results which may be of some independent interest.

String Reconstruction from Substring Compositions

Abstract: Motivated by mass-spectrometry protein sequencing, we consider the problem of reconstructing a string from the multisets of its substring composition. We show that all strings of length 7, one less than a prime and one less than twice a prime, can be reconstructed uniquely up to reversal. For all other lengths, we show that unique reconstruction is not always possible and provide sometimes-tight bounds on the largest number of strings with given substring compositions. The lower bounds are derived by combinatorial arguments, while the upper bounds follow from algebraic approaches that lead to precise characterizations of the sets of strings with the same substring compositions in terms of the factorization properties of bivariate polynomials. Using results on the transience of multidimensional random walks, we also provide a reconstruction algorithm that recovers random strings over alphabets of size $\ge4$ from their substring compositions in optimal near-quadratic time. The problem considered is related...

Algebraic Effects, Linearity, and Quantum Programming Languages

Abstract: We develop a new framework of algebraic theories with linear parameters, and use it to analyze the equational reasoning principles of quantum computing and quantum programming languages. We use the framework as follows: we present a new elementary algebraic theory of quantum computation, built from unitary gates and measurement; we provide a completeness theorem or the elementary algebraic theory by relating it with a model from operator algebra; we extract an equational theory for a quantum programming language from the algebraic theory; we compare quantum computation with other local notions of computation by investigating variations on the algebraic theory.

A small frame and a certificate of its injectivity

Abstract: We present a complex frame of eleven vectors in 4-space and prove that it defines injective measurements. That is, any rank-one 4 × 4 Hermitian matrix is uniquely determined by its values as a Hermitian form on this collection of eleven vectors. This disproves a recent conjecture of Bandeira, Cahill, Mixon, and Nelson. We use algebraic computations and certificates in order to prove injectivity.

Algebraic Groups and Compact Generation of their Derived Categories of Representations

Abstract: Let k be a field. We characterize the group schemes G over k, not necessarily affine, such that D-qc (B(k)G) is compactly generated. We also describe the algebraic stacks that have finite cohomological dimension in terms of their stabilizer groups.

Automatic congruences for diagonals of rational functions

Abstract: In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of Denef and Lipshitz, for computing a finite automaton for the sequence modulo pα, for all but finitely many primes p. This method gives completely automatic proofs of known results, establishes a number of new theorems for well-known sequences, and allows us to resolve some conjectures regarding the Apery numbers. We also give a second method, which applies to an algebraic sequence modulo pα for all primes p, but is significantly slower. Finally, we show that a broad range of multidimensional sequences possess Lucas products modulo p.

Random algebraic construction of extremal graphs

Abstract: We present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions. MSC classes: 05C35, 05D99

The implicit function theorem and free algebraic sets

Abstract: We prove an implicit function theorem for non-commutative functions. We use this to show that if p(X, Y ) is a generic non-commuting polynomial in two variables, and X is a generic matrix, then all solutions Y of p(X, Y ) = 0 will commute with X.