|
In Forthcoming Issues
Effective simultaneous rational approximation to pairs of real quadratic numbers [in In honor of Feldman]
Yann Bugeaud
|
On the roots of the Poupard and Kreweras polynomials
Frédéric Chapoton, Guo-Niu Han
|
On defining linear orders by automata [in Complexity]
Bruno Courcelle, Irène Durand, Michael Raskin
|
Can polylogarithms at algebraic points be linearly independent? [in In honor of Feldman]
Sinnou David, Noriko Hirata-Kohno, Makoto Kawashima
|
Generalizations of k-dimensional Weisfeiler-Leman stabilization [in Complexity]
Anuj Dawar, Danny Vagnozzi
|
Algebraic integers close to the unit circle [in In honor of Feldman]
Artūras Dubickas
|
On approximations of solutions of the equation P(z, ln z)=0 by algebraic numbers [in In honor of Feldman]
Alexander Galochkin, Anastasia Godunova
|
Provenance analysis for logic and games [in Complexity]
Erich Graedel, Val Tannen
|
First order definitions of subgraph isomorphism through the adjacency and order relations [in Complexity]
Oleg Grigoryan, Mikhail Makarov, Maksim Zhukovskii
|
Generalized colored circular palindromic compositions
Petros Hadjicostas
|
Exact modularity of line graphs of complete graphs
Mikhail Ipatov
|
New lower bound on the modularity of Johnson graphs
Mikhail Koshelev
|
Square-full primitive roots in arithmetic progressions
Vichian Laohakosol, Teerapat Srichan, Pinthira Tangsupphathawat
|
Weakly distinguishing graph polynomials on addable properties [in Complexity]
Johann Makowsky, Vsevolod Rakita
|
Two integral transformations related to $\zeta(2)$ [in In honor of Feldman]
Raffaele Marcovecchio
|
On transcendental entire functions with infinitely many derivatives taking integer values at several points [in In honor of Feldman]
Michel Waldschmidt
|
On limit points of spectra of first order sentences with quantifier depth 4 [in Complexity]
Yury Yarovikov
|
The irrationality measure of $\pi$ is at most 7.103205334137... [in In honor of Feldman]
Wadim Zudilin, Doron Zeilberger
|
|
