scholarly journals NC algorithms for real algebraic numbers

1992 ◽  
Vol 3 (2) ◽  
pp. 79-98 ◽  
Author(s):  
F. Cucker ◽  
H. Lanneau ◽  
B. Mishra ◽  
P. Pedersen ◽  
M. -F. Roy
2010 ◽  
Vol 06 (01) ◽  
pp. 69-87 ◽  
Author(s):  
ALISON MILLER ◽  
AARON PIXTON

We extend results of Bringmann and Ono that relate certain generalized traces of Maass–Poincaré series to Fourier coefficients of modular forms of half-integral weight. By specializing to cases in which these traces are usual traces of algebraic numbers, we generalize results of Zagier describing arithmetic traces associated to modular forms. We define correspondences [Formula: see text] and [Formula: see text]. We show that if f is a modular form of non-positive weight 2 - 2 λ and odd level N, holomorphic away from the cusp at infinity, then the traces of values at Heegner points of a certain iterated non-holomorphic derivative of f are equal to Fourier coefficients of the half-integral weight modular forms [Formula: see text].


2019 ◽  
Vol 9 (4) ◽  
pp. 1026-1041
Author(s):  
K. Avrachenkov ◽  
V. Ejov ◽  
J. A. Filar ◽  
A. Moghaddam

2008 ◽  
Vol 144 (1) ◽  
pp. 119-144 ◽  
Author(s):  
ARNAUD DURAND

AbstractA central problem motivated by Diophantine approximation is to determine the size properties of subsets of$\R^d$ ($d\in\N$)of the formwhere ‖⋅‖ denotes an arbitrary norm,Ia denumerable set, (xi,ri)i∈ Ia family of elements of$\R^d\$× (0, ∞) and ϕ a nonnegative nondecreasing function defined on [0, ∞). We show that ifFId, where Id denotes the identity function, has full Lebesgue measure in a given nonempty open subsetVof$\R^d\$, the setFϕbelongs to a class Gh(V) of sets with large intersection inVwith respect to a given gauge functionh. We establish that this class is closed under countable intersections and that each of its members has infinite Hausdorffg-measure for every gauge functiongwhich increases faster thanhnear zero. In particular, this yields a sufficient condition on a gauge functiongsuch that a given countable intersection of sets of the formFϕhas infinite Hausdorffg-measure. In addition, we supply several applications of our results to Diophantine approximation. For any nonincreasing sequenceψof positive real numbers converging to zero, we investigate the size and large intersection properties of the sets of all points that areψ-approximable by rationals, by rationals with restricted numerator and denominator and by real algebraic numbers. This enables us to refine the analogs of Jarník's theorem for these sets. We also study the approximation of zero by values of integer polynomials and deduce several new results concerning Mahler's and Koksma's classifications of real transcendental numbers.


2015 ◽  
Vol 07 (02) ◽  
pp. 1550019
Author(s):  
Jinyu Huang

A maximum linear matroid parity set is called a basic matroid parity set, if its size is the rank of the matroid. We show that determining the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity) is in NC2, provided that there are polynomial number of common bases (basic matroid parity sets). For graphic matroids, we show that finding a common base for matroid intersection is in NC2, if the number of common bases is polynomial bounded. To our knowledge, these algorithms are the first deterministic NC algorithms for matroid intersection and matroid parity. We also give a new RNC2 algorithm that finds a common base for graphic matroid intersection. We prove that if there is a black-box NC algorithm for Polynomial Identity Testing (PIT), then there is an NC algorithm to determine the existence of a common base (basic matroid parity set) for linear matroid intersection (linear matroid parity).


Sign in / Sign up

Export Citation Format

Share Document