Zobrazeno 1 - 10
of 165
pro vyhledávání: '"Andrew Rechnitzer"'
We give explicit upper and lower bounds for $N(T,\chi)$, the number of zeros of a Dirichlet $L$-function with character $\chi$ and height at most $T$. Suppose that $\chi$ has conductor $q>1$, and that $T\geq 5/7$. If $\ell=\log\frac{q(T+2)}{2\pi}> 1.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53bb78230217e921c2e56ec71292a677
http://arxiv.org/abs/2005.02989
http://arxiv.org/abs/2005.02989
Autor:
Yao-ban Chan, Andrew Rechnitzer
Publikováno v:
Linear Algebra and its Applications. 555:139-156
We devise an algorithm to calculate upper bounds on the growth rates of the number of independent sets on a variety of regular two-dimensional lattices, using an amalgamation of techniques from linear algebra, combinatorics, and statistical mechanics
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e04f67f9f2f7e7378c3ebfbd6db85177
https://doi.org/10.1016/j.laa.2018.06.008
https://doi.org/10.1016/j.laa.2018.06.008
Publikováno v:
Mathematics of Computation. 88:1341-1390
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7504bdc8202cc511bc78dc3d2cf6d42
https://doi.org/10.1090/mcom/3370
https://doi.org/10.1090/mcom/3370
Publikováno v:
Illinois J. Math. 62, no. 1-4 (2018), 427-532
We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $\theta(x;q,a)$ denotes the sum of the logarithms of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5f2882525ec3ed9fa674af6b617fcf0
http://arxiv.org/abs/1802.00085
http://arxiv.org/abs/1802.00085
In this paper, we enumerate two families of pattern-avoiding permutations: those avoiding the vincular pattern $2-41-3$, which we call semi-Baxter permutations, and those avoiding the vincular patterns $2-41-3$, $3-14-2$ and $3-41-2$, which we call s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2521aff65592d5e0638170e39d31fe7c
http://hdl.handle.net/11365/1066607
http://hdl.handle.net/11365/1066607
Autor:
Harrison Chapman, Andrew Rechnitzer
A plane curve is a knot diagram in which each crossing is replaced by a 4-valent vertex, and so are dual to a subset of planar quadrangulations. The aim of this paper is to introduce a new tool for sampling diagrams via sampling of plane curves. At p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dff5fce69bcfd3a0cb68640fcb6709b5
Publikováno v:
Experimental Mathematics. 24:391-409
Copyright © 2014 Taylor & Francis Group, LLC. We describe a Metropolis Monte Carlo algorithm for random sampling of freely reduced words equal to the identity in a finitely presented group. The algorithm samples from a stretched Boltzmann distributi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bc2fb62000ee5b18b32af54c05ee010
https://doi.org/10.1080/10586458.2015.1005853
https://doi.org/10.1080/10586458.2015.1005853
Autor:
Andrew Rechnitzer, Michael A. Bennett
Publikováno v:
Recent Progress and Modern Challenges in Applied Mathematics, Modeling and Computational Science ISBN: 9781493969685
We discuss a new algorithm for finding all elliptic curves over \(\mathbb{Q}\) with a given conductor. Though based on (very) classical ideas, this approach appears to be computationally quite efficient. We provide details of the output from the algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::531b018a8ec57327f59bbf4725bc63c7
https://doi.org/10.1007/978-1-4939-6969-2_13
https://doi.org/10.1007/978-1-4939-6969-2_13
Autor:
Andrew Rechnitzer, Yao-ban Chan
Publikováno v:
IEEE Transactions on Information Theory. 60:3845-3858
We analyse the capacity of several 2-D constraint families—the exclusion, coloring, parity, and charge model families. Using Baxter's corner transfer matrix formalism combined with the corner transfer matrix renormalization group method of Nishino
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72bab489ae6bd0aa5b50e30d81f93894
https://doi.org/10.1109/tit.2014.2321554
https://doi.org/10.1109/tit.2014.2321554
Publikováno v:
International Journal of Algebra and Computation. 24:171-187
We compute the cogrowth series for Baumslag–Solitar groups BS (N, N) = 〈a,b|aNb = baN〉, which we show to be D-finite. It follows that their cogrowth rates are algebraic numbers.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c7a626ad3eb7c58b4b877e1c5d7c147
https://doi.org/10.1142/s0218196714500106
https://doi.org/10.1142/s0218196714500106