Doc fForte
Project Description
Projektleitung: Loredana Tec
Forschungsprogramm: ÖAW
Project Lead
Project Duration
01/01/2010 - 31/12/2010Publications
2025
[Hoxhaj]
How to reconstruct a planar map from its branching curve
E. Hoxhaj, J. Schicho
Math. Comp. 94, pp. 935-952. 2025. ISSN 1088-6842. [doi]@article{RISC7121,
author = {E. Hoxhaj and J. Schicho},
title = {{How to reconstruct a planar map from its branching curve}},
language = {english},
journal = {Math. Comp.},
volume = {94},
pages = {935--952},
isbn_issn = {ISSN 1088-6842},
year = {2025},
refereed = {yes},
length = {18},
url = {https://doi.org/10.1090/mcom/3988}
}
author = {E. Hoxhaj and J. Schicho},
title = {{How to reconstruct a planar map from its branching curve}},
language = {english},
journal = {Math. Comp.},
volume = {94},
pages = {935--952},
isbn_issn = {ISSN 1088-6842},
year = {2025},
refereed = {yes},
length = {18},
url = {https://doi.org/10.1090/mcom/3988}
}
[Schneider]
Creative Telescoping for Hypergeometric Double Sums
P. Paule, C. Schneider
J. Symb. Comput. 128(102394), pp. 1-30. 2025. ISSN: 0747-7171. Symbolic Computation and Combinatorics: A special issue in memory and honor of Marko Petkovšek, edited by Shaoshi Chen, Sergei Abramov, Manuel Kauers, Eugene Zima. [doi]@article{RISC7068,
author = {P. Paule and C. Schneider},
title = {{Creative Telescoping for Hypergeometric Double Sums}},
language = {english},
abstract = {We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which guarantees the applicability of our method for many input sums. In addition, we elaborate new techniques to optimize the underlying key task of our method to compute rational solutions of parameterized linear recurrences.},
journal = {J. Symb. Comput.},
volume = {128},
number = {102394},
pages = {1--30},
isbn_issn = {ISSN: 0747-7171},
year = {2025},
note = {Symbolic Computation and Combinatorics: A special issue in memory and honor of Marko Petkovšek, edited by Shaoshi Chen, Sergei Abramov, Manuel Kauers, Eugene Zima},
refereed = {yes},
keywords = {creative telescoping; symbolic summation, hypergeometric multi-sums, contiguous relations, parameterized recurrences, rational solutions},
length = {30},
url = {https://doi.org/10.1016/j.jsc.2024.102394}
}
author = {P. Paule and C. Schneider},
title = {{Creative Telescoping for Hypergeometric Double Sums}},
language = {english},
abstract = {We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which guarantees the applicability of our method for many input sums. In addition, we elaborate new techniques to optimize the underlying key task of our method to compute rational solutions of parameterized linear recurrences.},
journal = {J. Symb. Comput.},
volume = {128},
number = {102394},
pages = {1--30},
isbn_issn = {ISSN: 0747-7171},
year = {2025},
note = {Symbolic Computation and Combinatorics: A special issue in memory and honor of Marko Petkovšek, edited by Shaoshi Chen, Sergei Abramov, Manuel Kauers, Eugene Zima},
refereed = {yes},
keywords = {creative telescoping; symbolic summation, hypergeometric multi-sums, contiguous relations, parameterized recurrences, rational solutions},
length = {30},
url = {https://doi.org/10.1016/j.jsc.2024.102394}
}
2024
[AUTHOR]
Proximity-based matching with arbitrary T-norms
Maximilian Donnermair
RISC, Johannes Kepler University Linz. Bachelor Thesis. 2024. [pdf]@misc{RISC7061,
author = {Maximilian Donnermair},
title = {{Proximity-based matching with arbitrary T-norms}},
language = {english},
year = {2024},
translation = {0},
institution = {RISC, Johannes Kepler University Linz},
length = {38}
}
author = {Maximilian Donnermair},
title = {{Proximity-based matching with arbitrary T-norms}},
language = {english},
year = {2024},
translation = {0},
institution = {RISC, Johannes Kepler University Linz},
length = {38}
}
[AUTHOR]
A Formalization of the General Theory of Quaternions
Thaynara Arielly de Lima, André Luiz Galdino, Bruno Berto de Oliveira Ribeiro, and Mauricio Ayala-Rincón
In: Leibniz International Proceedings in Informatics (LIPIcs), Yves Bertot, Temur Kutsia, and Michael Norrish (ed.), pp. 11:1-11:18. 2024. ISSN 1868-8969.@inproceedings{RISC7108,
author = {Thaynara Arielly de Lima and André Luiz Galdino and Bruno Berto de Oliveira Ribeiro and and Mauricio Ayala-Rincón},
title = {{A Formalization of the General Theory of Quaternions}},
booktitle = {{Leibniz International Proceedings in Informatics (LIPIcs)}},
language = {english},
pages = {11:1--11:18},
isbn_issn = {ISSN 1868-8969},
year = {2024},
editor = {Yves Bertot and Temur Kutsia and and Michael Norrish},
refereed = {yes},
length = {18}
}
author = {Thaynara Arielly de Lima and André Luiz Galdino and Bruno Berto de Oliveira Ribeiro and and Mauricio Ayala-Rincón},
title = {{A Formalization of the General Theory of Quaternions}},
booktitle = {{Leibniz International Proceedings in Informatics (LIPIcs)}},
language = {english},
pages = {11:1--11:18},
isbn_issn = {ISSN 1868-8969},
year = {2024},
editor = {Yves Bertot and Temur Kutsia and and Michael Norrish},
refereed = {yes},
length = {18}
}
[AUTHOR]
Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms
de Lima Thaynara Arielly, Borges Avelar Andréia, Galdino André Luiz, Ayala-Rincón Mauricio
In: Electronic Proceedings in Theoretical Computer Science, Temur Kutsia, Daniel Ventura, David Monniaux & José F. Morales (ed.)402, pp. 18–33-18–33. 2024. Open Publishing Association, ISSN 2075-2180. [doi]@inproceedings{RISC7114,
author = {de Lima Thaynara Arielly and Borges Avelar Andréia and Galdino André Luiz and Ayala-Rincón Mauricio},
title = {{Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms}},
booktitle = {{Electronic Proceedings in Theoretical Computer Science}},
language = {english},
volume = {402},
pages = {18–33--18–33},
publisher = {Open Publishing Association},
isbn_issn = { ISSN 2075-2180},
year = {2024},
editor = {Temur Kutsia and Daniel Ventura and David Monniaux & José F. Morales},
refereed = {yes},
length = {0},
url = {http://dx.doi.org/10.4204/EPTCS.402.5}
}
author = {de Lima Thaynara Arielly and Borges Avelar Andréia and Galdino André Luiz and Ayala-Rincón Mauricio},
title = {{Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms}},
booktitle = {{Electronic Proceedings in Theoretical Computer Science}},
language = {english},
volume = {402},
pages = {18–33--18–33},
publisher = {Open Publishing Association},
isbn_issn = { ISSN 2075-2180},
year = {2024},
editor = {Temur Kutsia and Daniel Ventura and David Monniaux & José F. Morales},
refereed = {yes},
length = {0},
url = {http://dx.doi.org/10.4204/EPTCS.402.5}
}
[AUTHOR]
Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms
de Lima Thaynara Arielly, Borges Avelar Andréia, Galdino André Luiz, Ayala-Rincón Mauricio
In: Electronic Proceedings in Theoretical Computer Science, Temur Kutsia, Daniel Ventura, David Monniaux and José F. Morales (ed.)402, pp. 18–33-18–33. 2024. Open Publishing Association, ISSN 2075-2180. [doi]@inproceedings{RISC7115,
author = {de Lima Thaynara Arielly and Borges Avelar Andréia and Galdino André Luiz and Ayala-Rincón Mauricio},
title = {{Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms}},
booktitle = {{Electronic Proceedings in Theoretical Computer Science}},
language = {english},
volume = {402},
pages = {18–33--18–33},
publisher = {Open Publishing Association},
isbn_issn = { ISSN 2075-2180},
year = {2024},
editor = {Temur Kutsia and Daniel Ventura and David Monniaux and José F. Morales },
refereed = {yes},
length = {0},
url = {http://dx.doi.org/10.4204/EPTCS.402.5}
}
author = {de Lima Thaynara Arielly and Borges Avelar Andréia and Galdino André Luiz and Ayala-Rincón Mauricio},
title = {{Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms}},
booktitle = {{Electronic Proceedings in Theoretical Computer Science}},
language = {english},
volume = {402},
pages = {18–33--18–33},
publisher = {Open Publishing Association},
isbn_issn = { ISSN 2075-2180},
year = {2024},
editor = {Temur Kutsia and Daniel Ventura and David Monniaux and José F. Morales },
refereed = {yes},
length = {0},
url = {http://dx.doi.org/10.4204/EPTCS.402.5}
}
[Buchberger]
Science and Meditation: Creating the Future (English Translation of "Wissenschaft und Meditation")
Bruno Buchberger
1st edition, 2024. Amazon, 979-8332230837.@book{RISC7102,
author = {Bruno Buchberger},
title = {{Science and Meditation: Creating the Future (English Translation of "Wissenschaft und Meditation")}},
language = {english},
publisher = {Amazon},
isbn_issn = { 979-8332230837},
year = {2024},
edition = {1st},
translation = {0},
length = {153}
}
author = {Bruno Buchberger},
title = {{Science and Meditation: Creating the Future (English Translation of "Wissenschaft und Meditation")}},
language = {english},
publisher = {Amazon},
isbn_issn = { 979-8332230837},
year = {2024},
edition = {1st},
translation = {0},
length = {153}
}
[Cerna]
Equational Anti-unification over Absorption Theories
Mauricio Ayala-Rincón, David M. Cerna, Andres Felipe Gonzalez Barragan, Temur Kutsia
In: Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Christoph Benzmüller, Marijn J. H. Heule, Renate A. Schmidt (ed.), Lecture Notes in Artificial Intelligence 14740, pp. 317-337. 2024. Springer, ISBN 978-3-031-63500-7. [doi]@inproceedings{RISC7064,
author = {Mauricio Ayala-Rincón and David M. Cerna and Andres Felipe Gonzalez Barragan and Temur Kutsia},
title = {{Equational Anti-unification over Absorption Theories}},
booktitle = {{Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings}},
language = {english},
series = {Lecture Notes in Artificial Intelligence},
volume = {14740},
pages = {317--337},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-63500-7},
year = {2024},
editor = {Christoph Benzmüller and Marijn J. H. Heule and Renate A. Schmidt},
refereed = {yes},
length = {21},
url = {https://doi.org/10.1007/978-3-031-63501-4_17}
}
author = {Mauricio Ayala-Rincón and David M. Cerna and Andres Felipe Gonzalez Barragan and Temur Kutsia},
title = {{Equational Anti-unification over Absorption Theories}},
booktitle = {{Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings}},
language = {english},
series = {Lecture Notes in Artificial Intelligence},
volume = {14740},
pages = {317--337},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-63500-7},
year = {2024},
editor = {Christoph Benzmüller and Marijn J. H. Heule and Renate A. Schmidt},
refereed = {yes},
length = {21},
url = {https://doi.org/10.1007/978-3-031-63501-4_17}
}
[de Freitas]
The first-order factorizable contributions to the three-loop massive operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$
J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schoenwald
Nuclear Physics B 999(116427), pp. 1-42. 2024. ISSN 0550-3213. arXiv:2311.00644 [hep-ph]. [doi]@article{RISC6755,
author = {J. Ablinger and A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The first--order factorizable contributions to the three--loop massive operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$}},
language = {english},
abstract = {The unpolarized and polarized massive operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$contain first--order factorizable and non--first--order factorizable contributions in the determining difference or differential equations of their master integrals. We compute their first--order factorizable contributions in the single heavy mass case for all contributing Feynman diagrams. Moreover, we present the complete color--$zeta$ factors for the cases in which also non--first--order factorizable contributions emerge in the master integrals, but cancel in the final result as found by using the method of arbitrary high Mellin moments. Individual contributions depend also on generalized harmonic sums and on nested finite binomial and inverse binomial sums in Mellin $N$--space, and correspondingly, on Kummer--Poincar'e and square--root valued alphabets in Bjorken--$x$ space. We present a complete discussion of the possibilities of solving the present problem in $N$--space analytically and we also discuss the limitations in the present case to analytically continue the given $N$--space expressions to $N in mathbb{C}$ by strict methods. The representation through generating functions allows a well synchronized representation of the first--order factorizable results over a 17--letter alphabet. We finally obtain representations in terms of iterated integrals over the corresponding alphabet in $x$--space, also containing up to weight {sf w = 5} special constants, which can be rationalized to Kummer--Poincar'e iterated integrals at special arguments. The analytic $x$--space representation requires separate analyses for the intervals $x in [0,1/4], [1/4,1/2], [1/2,1]$ and $x > 1$. We also derive the small and large $x$ limits of the first--order factorizable contributions. Furthermore, we perform comparisons to a number of known Mellin moments, calculated by a different method for the corresponding subset of Feynman diagrams, and an independent high--precision numerical solution of the problems.},
journal = {Nuclear Physics B},
volume = {999},
number = {116427},
pages = {1--42},
isbn_issn = {ISSN 0550-3213},
year = {2024},
note = {arXiv:2311.00644 [hep-ph]},
refereed = {yes},
keywords = {Feynman diagram, massive operator matrix elements, computer algebra, differential equations, difference equations, coupled systems, nested integrals, nested sums},
length = {42},
url = {https://doi.org/10.1016/j.nuclphysb.2023.116427}
}
author = {J. Ablinger and A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The first--order factorizable contributions to the three--loop massive operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$}},
language = {english},
abstract = {The unpolarized and polarized massive operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$contain first--order factorizable and non--first--order factorizable contributions in the determining difference or differential equations of their master integrals. We compute their first--order factorizable contributions in the single heavy mass case for all contributing Feynman diagrams. Moreover, we present the complete color--$zeta$ factors for the cases in which also non--first--order factorizable contributions emerge in the master integrals, but cancel in the final result as found by using the method of arbitrary high Mellin moments. Individual contributions depend also on generalized harmonic sums and on nested finite binomial and inverse binomial sums in Mellin $N$--space, and correspondingly, on Kummer--Poincar'e and square--root valued alphabets in Bjorken--$x$ space. We present a complete discussion of the possibilities of solving the present problem in $N$--space analytically and we also discuss the limitations in the present case to analytically continue the given $N$--space expressions to $N in mathbb{C}$ by strict methods. The representation through generating functions allows a well synchronized representation of the first--order factorizable results over a 17--letter alphabet. We finally obtain representations in terms of iterated integrals over the corresponding alphabet in $x$--space, also containing up to weight {sf w = 5} special constants, which can be rationalized to Kummer--Poincar'e iterated integrals at special arguments. The analytic $x$--space representation requires separate analyses for the intervals $x in [0,1/4], [1/4,1/2], [1/2,1]$ and $x > 1$. We also derive the small and large $x$ limits of the first--order factorizable contributions. Furthermore, we perform comparisons to a number of known Mellin moments, calculated by a different method for the corresponding subset of Feynman diagrams, and an independent high--precision numerical solution of the problems.},
journal = {Nuclear Physics B},
volume = {999},
number = {116427},
pages = {1--42},
isbn_issn = {ISSN 0550-3213},
year = {2024},
note = {arXiv:2311.00644 [hep-ph]},
refereed = {yes},
keywords = {Feynman diagram, massive operator matrix elements, computer algebra, differential equations, difference equations, coupled systems, nested integrals, nested sums},
length = {42},
url = {https://doi.org/10.1016/j.nuclphysb.2023.116427}
}
[de Freitas]
The non-first-order-factorizable contributions to the three-loop single-mass operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$
J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schoenwald
Physics Letter B 854(138713), pp. 1-8. 2024. ISSN 0370-2693. arXiv:2403.00513 [[hep-ph]. [doi]@article{RISC7058,
author = {J. Ablinger and A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The non-first-order-factorizable contributions to the three-loop single-mass operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$}},
language = {english},
abstract = {The non-first-order-factorizable contributions to the unpolarized and polarized massive operator matrix elements to three-loop order, $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$, are calculated in the single-mass case. For the $_2F_1$-related master integrals of the problem, we use a semi-analytic method basedon series expansions and utilize the first-order differential equations for the master integrals whichdoes not need a special basis of the master integrals. Due to the singularity structure of this basis a part of the integrals has to be computed to $O(ep^5)$ in the dimensional parameter. The solutions have to be matched at a series of thresholds and pseudo-thresholds in the region of the Bjorken variable $x in ]0,infty[$ using highly precise series expansions to obtain the imaginary part of the physical amplitude for $x in ]0,1]$ at a high relative accuracy. We compare the present results both with previous analytic results, the results for fixed Mellin moments, and a prediction in the small-$x$ region. We also derive expansions in the region of small and large values of $x$. With this paper, all three-loop single-mass unpolarized and polarized operator matrix elements are calculated.},
journal = {Physics Letter B},
volume = {854},
number = {138713},
pages = {1--8},
isbn_issn = {ISSN 0370-2693},
year = {2024},
note = {arXiv:2403.00513 [[hep-ph]},
refereed = {yes},
keywords = {Feynman diagram, massive operator matrix elements, computer algebra, differential equations, difference equations, coupled systems, numerics},
length = {8},
url = {https://doi.org/10.1016/j.physletb.2024.138713}
}
author = {J. Ablinger and A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The non-first-order-factorizable contributions to the three-loop single-mass operator matrix elements $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$}},
language = {english},
abstract = {The non-first-order-factorizable contributions to the unpolarized and polarized massive operator matrix elements to three-loop order, $A_{Qg}^{(3)}$ and $Delta A_{Qg}^{(3)}$, are calculated in the single-mass case. For the $_2F_1$-related master integrals of the problem, we use a semi-analytic method basedon series expansions and utilize the first-order differential equations for the master integrals whichdoes not need a special basis of the master integrals. Due to the singularity structure of this basis a part of the integrals has to be computed to $O(ep^5)$ in the dimensional parameter. The solutions have to be matched at a series of thresholds and pseudo-thresholds in the region of the Bjorken variable $x in ]0,infty[$ using highly precise series expansions to obtain the imaginary part of the physical amplitude for $x in ]0,1]$ at a high relative accuracy. We compare the present results both with previous analytic results, the results for fixed Mellin moments, and a prediction in the small-$x$ region. We also derive expansions in the region of small and large values of $x$. With this paper, all three-loop single-mass unpolarized and polarized operator matrix elements are calculated.},
journal = {Physics Letter B},
volume = {854},
number = {138713},
pages = {1--8},
isbn_issn = {ISSN 0370-2693},
year = {2024},
note = {arXiv:2403.00513 [[hep-ph]},
refereed = {yes},
keywords = {Feynman diagram, massive operator matrix elements, computer algebra, differential equations, difference equations, coupled systems, numerics},
length = {8},
url = {https://doi.org/10.1016/j.physletb.2024.138713}
}
[de Freitas]
Challenges for analytic calculations of the massive three-loop form factors
J Bluemlein, A. De Freitas, P. Marquard, C. Schneider
In: Proceedings of Loops and Legs in Quantum Field Theory, P. Marquard, M. Steinhauser (ed.)PoS(LL2024)03124-05, pp. 1-18. 2024. ISSN 1824-8039. arXiv:2408.07046 [hep-ph]. [doi]@inproceedings{RISC7066,
author = {J Bluemlein and A. De Freitas and P. Marquard and C. Schneider},
title = {{Challenges for analytic calculations of the massive three-loop form factors}},
booktitle = {{Proceedings of Loops and Legs in Quantum Field Theory}},
language = {english},
abstract = {The calculation of massive three-loop QCD form factors using in particular the large moments method has been successfully applied to quarkonic contributions in [1]. We give a brief review of the different steps of the calculation and report on improvements of our methods that enabled us to push forward the calculations of the gluonic contributions to the form factors.},
volume = {PoS(LL2024)031},
number = {24-05},
pages = {1--18},
isbn_issn = {ISSN 1824-8039},
year = {2024},
note = { arXiv:2408.07046 [hep-ph]},
editor = {P. Marquard and M. Steinhauser},
refereed = {no},
keywords = {Form factor; computer algebra, coupled systems, differential equations, recurrences, analytic continuation, holonomic functions},
length = {18},
url = {https://doi.org/10.22323/1.467.0031 }
}
author = {J Bluemlein and A. De Freitas and P. Marquard and C. Schneider},
title = {{Challenges for analytic calculations of the massive three-loop form factors}},
booktitle = {{Proceedings of Loops and Legs in Quantum Field Theory}},
language = {english},
abstract = {The calculation of massive three-loop QCD form factors using in particular the large moments method has been successfully applied to quarkonic contributions in [1]. We give a brief review of the different steps of the calculation and report on improvements of our methods that enabled us to push forward the calculations of the gluonic contributions to the form factors.},
volume = {PoS(LL2024)031},
number = {24-05},
pages = {1--18},
isbn_issn = {ISSN 1824-8039},
year = {2024},
note = { arXiv:2408.07046 [hep-ph]},
editor = {P. Marquard and M. Steinhauser},
refereed = {no},
keywords = {Form factor; computer algebra, coupled systems, differential equations, recurrences, analytic continuation, holonomic functions},
length = {18},
url = {https://doi.org/10.22323/1.467.0031 }
}
[de Freitas]
The three-loop single-mass heavy flavor corrections to deep-inelastic scattering
J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. von Manteuffel, C. Schneider, K. Schoenwald
In: Proceedings of Loops and Legs in Quantum Field Theory, P. Marquard, M. Steinhauser (ed.)PoS(LL2024)047 , pp. 1-12. 2024. SSN 1824-8039. arXiv:2407.02006 [hep-ph]. [doi]@inproceedings{RISC7067,
author = {J. Ablinger and A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The three-loop single-mass heavy flavor corrections to deep-inelastic scattering}},
booktitle = {{Proceedings of Loops and Legs in Quantum Field Theory}},
language = {english},
abstract = {We report on the status of the calculation of the massive Wilson coefficients and operator matrix elements for deep-inelastic scatterung to three-loop order. We discuss both the unpolarized and the polarized case, for which all the single-mass and nearly all two-mass contributions have been calculated. Numerical results on the structure function $F_2(x,Q^2)$ are presented. In the polarized case, we work in the Larinscheme and refer to parton distribution functions in this scheme. Furthermore, results on the three-loop variable flavor number scheme are presented.},
volume = {PoS(LL2024)047 },
pages = {1--12},
isbn_issn = {SSN 1824-8039},
year = {2024},
note = {arXiv:2407.02006 [hep-ph]},
editor = {P. Marquard and M. Steinhauser},
refereed = {no},
keywords = {Feynman integrals, deep-inelastic scattering, numerical results},
length = {12},
url = {https://doi.org/10.22323/1.467.0047 }
}
author = {J. Ablinger and A. Behring and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{The three-loop single-mass heavy flavor corrections to deep-inelastic scattering}},
booktitle = {{Proceedings of Loops and Legs in Quantum Field Theory}},
language = {english},
abstract = {We report on the status of the calculation of the massive Wilson coefficients and operator matrix elements for deep-inelastic scatterung to three-loop order. We discuss both the unpolarized and the polarized case, for which all the single-mass and nearly all two-mass contributions have been calculated. Numerical results on the structure function $F_2(x,Q^2)$ are presented. In the polarized case, we work in the Larinscheme and refer to parton distribution functions in this scheme. Furthermore, results on the three-loop variable flavor number scheme are presented.},
volume = {PoS(LL2024)047 },
pages = {1--12},
isbn_issn = {SSN 1824-8039},
year = {2024},
note = {arXiv:2407.02006 [hep-ph]},
editor = {P. Marquard and M. Steinhauser},
refereed = {no},
keywords = {Feynman integrals, deep-inelastic scattering, numerical results},
length = {12},
url = {https://doi.org/10.22323/1.467.0047 }
}
[de Lima]
Compactness Theorem for Propositional Logic and Combinatorial Applications
Fabián Fernando Serrano Suárez, Thaynara Arielly de Lima, Mauricio Ayala-Rincón
Arch. Formal Proofs 2024, pp. -. 2024. ISSN 2150-914x. [url]@article{RISC7113,
author = {Fabián Fernando Serrano Suárez and Thaynara Arielly de Lima and Mauricio Ayala-Rincón},
title = {{Compactness Theorem for Propositional Logic and Combinatorial Applications}},
language = {english},
journal = {Arch. Formal Proofs},
volume = {2024},
pages = {--},
isbn_issn = { ISSN 2150-914x},
year = {2024},
refereed = {yes},
length = {0},
url = {https://www.isa-afp.org/entries/Prop_Compactness.html}
}
author = {Fabián Fernando Serrano Suárez and Thaynara Arielly de Lima and Mauricio Ayala-Rincón},
title = {{Compactness Theorem for Propositional Logic and Combinatorial Applications}},
language = {english},
journal = {Arch. Formal Proofs},
volume = {2024},
pages = {--},
isbn_issn = { ISSN 2150-914x},
year = {2024},
refereed = {yes},
length = {0},
url = {https://www.isa-afp.org/entries/Prop_Compactness.html}
}
[de Lima]
A Formalization of the General Theory of Quaternions
de Lima Thaynara Arielly, Galdino André Luiz, de Oliveira Ribeiro Bruno Berto, Ayala-Rincón Mauricio Bertot, Yves and Kutsia, Temur and Norrish, Michael
In: 15th International Conference on Interactive Theorem Proving (ITP 2024), Bertot, Yves and Kutsia, Temur and Norrish, Michael (ed.), Leibniz International Proceedings in Informatics (LIPIcs) 309, pp. 11:1-11:18. 2024. Dagstuhl, Germany, ISBN 978-3-95977-337-9 ISSN 1868-8969. [url]@inproceedings{RISC7110,
author = {de Lima Thaynara Arielly and Galdino André Luiz and de Oliveira Ribeiro Bruno Berto and Ayala-Rincón Mauricio Bertot and Yves and Kutsia and Temur and Norrish and Michael},
title = {{A Formalization of the General Theory of Quaternions}},
booktitle = {{15th International Conference on Interactive Theorem Proving (ITP 2024)}},
language = {english},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {309},
pages = {11:1--11:18},
address = {Dagstuhl, Germany},
isbn_issn = {ISBN 978-3-95977-337-9 ISSN 1868-8969},
year = {2024},
annote = {Keywords: Theory of quaternions, Hamilton’s quaternions, Algebraic formalizations, PVS},
editor = {Bertot and Yves and Kutsia and Temur and Norrish and Michael},
refereed = {yes},
length = {0},
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2024.11}
}
author = {de Lima Thaynara Arielly and Galdino André Luiz and de Oliveira Ribeiro Bruno Berto and Ayala-Rincón Mauricio Bertot and Yves and Kutsia and Temur and Norrish and Michael},
title = {{A Formalization of the General Theory of Quaternions}},
booktitle = {{15th International Conference on Interactive Theorem Proving (ITP 2024)}},
language = {english},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
volume = {309},
pages = {11:1--11:18},
address = {Dagstuhl, Germany},
isbn_issn = {ISBN 978-3-95977-337-9 ISSN 1868-8969},
year = {2024},
annote = {Keywords: Theory of quaternions, Hamilton’s quaternions, Algebraic formalizations, PVS},
editor = {Bertot and Yves and Kutsia and Temur and Norrish and Michael},
refereed = {yes},
length = {0},
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2024.11}
}
[de Lima]
On reconfiguring heterogeneous parallel island models
Lucas A. da Silveira, Thaynara A. de Lima, Mauricio Ayala-Rincón
Swarm and Evolutionary Computation 89, pp. 101624-101624. 2024. ISSN 2210-6502. [url]@article{RISC7116,
author = {Lucas A. da Silveira and Thaynara A. de Lima and Mauricio Ayala-Rincón},
title = {{On reconfiguring heterogeneous parallel island models}},
language = {english},
abstract = {This work introduces a new Parallel Island Model (PIM) that encompasses the benefits of heterogeneity and algorithmic reconfigurability. The former feature, heterogeneity, means that different islands may execute different evolutionary algorithms. The latter, reconfigurability, means that each island can change the algorithm being executed during the evolutionary process. Allowing such features increases the usual diversity obtained by the communication topologies and migration policies by homogeneous PIMs (HoPIMs). Previous (non-reconfigurable) heterogeneous PIMs (HePIMs) were able to provide competitive solutions regarding the HoPIMs. By adding the reconfiguration capability, PIMs can change dynamically from executing one evolutionary algorithm to another. In this manner, the required diversity and flexibility to outperform HoPIMs and HePIMs is achieved. This paper discusses policies to profit from the feature of reconfigurability on HePIM models and provides an innovative and successful stagnation-based reconfiguration policy. The benefits of the new reconfigurable model are verified using the unsigned reversal distance optimization problem as a case study.},
journal = {Swarm and Evolutionary Computation},
volume = {89},
pages = {101624--101624},
isbn_issn = { ISSN 2210-6502},
year = {2024},
refereed = {yes},
keywords = {Island-based bioinspired algorithms, Parallel island models, Heterogeneous models, Reconfigurability, Evolutionary algorithms, Unsigned reversal distance},
length = {0},
url = {https://www.sciencedirect.com/science/article/pii/S2210650224001627}
}
author = {Lucas A. da Silveira and Thaynara A. de Lima and Mauricio Ayala-Rincón},
title = {{On reconfiguring heterogeneous parallel island models}},
language = {english},
abstract = {This work introduces a new Parallel Island Model (PIM) that encompasses the benefits of heterogeneity and algorithmic reconfigurability. The former feature, heterogeneity, means that different islands may execute different evolutionary algorithms. The latter, reconfigurability, means that each island can change the algorithm being executed during the evolutionary process. Allowing such features increases the usual diversity obtained by the communication topologies and migration policies by homogeneous PIMs (HoPIMs). Previous (non-reconfigurable) heterogeneous PIMs (HePIMs) were able to provide competitive solutions regarding the HoPIMs. By adding the reconfiguration capability, PIMs can change dynamically from executing one evolutionary algorithm to another. In this manner, the required diversity and flexibility to outperform HoPIMs and HePIMs is achieved. This paper discusses policies to profit from the feature of reconfigurability on HePIM models and provides an innovative and successful stagnation-based reconfiguration policy. The benefits of the new reconfigurable model are verified using the unsigned reversal distance optimization problem as a case study.},
journal = {Swarm and Evolutionary Computation},
volume = {89},
pages = {101624--101624},
isbn_issn = { ISSN 2210-6502},
year = {2024},
refereed = {yes},
keywords = {Island-based bioinspired algorithms, Parallel island models, Heterogeneous models, Reconfigurability, Evolutionary algorithms, Unsigned reversal distance},
length = {0},
url = {https://www.sciencedirect.com/science/article/pii/S2210650224001627}
}
[Dominici]
Symmetrization process and truncated orthogonal polynomials
Diego Dominici, Juan Carlos García-Ardila, Francisco Marcellán
Analysis and Mathematical Physics 14, pp. 0-0. 11 2024. 1664-2368.@article{RISC7130,
author = {Diego Dominici and Juan Carlos García-Ardila and Francisco Marcellán},
title = {{Symmetrization process and truncated orthogonal polynomials}},
language = {english},
abstract = {https://doi.org/10.1007/s13324-024-00974-3},
journal = { Analysis and Mathematical Physics},
volume = {14},
pages = {0--0},
isbn_issn = { 1664-2368},
year = {2024},
month = {11},
refereed = {yes},
length = {51}
}
author = {Diego Dominici and Juan Carlos García-Ardila and Francisco Marcellán},
title = {{Symmetrization process and truncated orthogonal polynomials}},
language = {english},
abstract = {https://doi.org/10.1007/s13324-024-00974-3},
journal = { Analysis and Mathematical Physics},
volume = {14},
pages = {0--0},
isbn_issn = { 1664-2368},
year = {2024},
month = {11},
refereed = {yes},
length = {51}
}
[Dramnesc]
Certification of Tail Recursive Bubble-Sort in Theorema and Coq
I. Dramnesc, T. Jebelean, S. Stratulat
In: LPAR 2024 Complementary Volume, N. Bjørner, M. Heule, A. Voronkov (ed.), Kalpa Publications in Computing 18, pp. 53-68. 2024. EasyChair, ISSN 2515-1762. [url]@inproceedings{RISC7125,
author = {I. Dramnesc and T. Jebelean and S. Stratulat},
title = {{Certification of Tail Recursive Bubble-Sort in Theorema and Coq}},
booktitle = {{LPAR 2024 Complementary Volume}},
language = {English},
series = {Kalpa Publications in Computing},
volume = {18},
pages = {53--68},
publisher = {EasyChair},
isbn_issn = { ISSN 2515-1762},
year = {2024},
editor = {N. Bjørner and M. Heule and A. Voronkov},
refereed = {yes},
length = {16},
url = {/publications/paper/tbwq}
}
author = {I. Dramnesc and T. Jebelean and S. Stratulat},
title = {{Certification of Tail Recursive Bubble-Sort in Theorema and Coq}},
booktitle = {{LPAR 2024 Complementary Volume}},
language = {English},
series = {Kalpa Publications in Computing},
volume = {18},
pages = {53--68},
publisher = {EasyChair},
isbn_issn = { ISSN 2515-1762},
year = {2024},
editor = {N. Bjørner and M. Heule and A. Voronkov},
refereed = {yes},
length = {16},
url = {/publications/paper/tbwq}
}
[Dramnesc]
Certification of Sorting Algorithms Using Theorema and Coq
I. Dramnesc, T. Jebelean, S. Stratulat
In: SCSS 2024, Symbolic Computation in Software Science , S. M. Watt, T. Ida (ed.), Lecture Notes in Artificial Intelligence 14991, pp. 38-56. 2024. Springer, ISBN 978-3-031-69041-9.@inproceedings{RISC7127,
author = {I. Dramnesc and T. Jebelean and S. Stratulat},
title = {{Certification of Sorting Algorithms Using Theorema and Coq}},
booktitle = {{SCSS 2024, Symbolic Computation in Software Science }},
language = {English},
series = {Lecture Notes in Artificial Intelligence},
volume = {14991},
pages = {38--56},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-69041-9},
year = {2024},
editor = {S. M. Watt and T. Ida},
refereed = {yes},
length = {19}
}
author = {I. Dramnesc and T. Jebelean and S. Stratulat},
title = {{Certification of Sorting Algorithms Using Theorema and Coq}},
booktitle = {{SCSS 2024, Symbolic Computation in Software Science }},
language = {English},
series = {Lecture Notes in Artificial Intelligence},
volume = {14991},
pages = {38--56},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-69041-9},
year = {2024},
editor = {S. M. Watt and T. Ida},
refereed = {yes},
length = {19}
}
[Ehling]
Solving Quantitative Equations
G. Ehling, T. Kutsia
Technical report no. 24-03 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). April 2024. Licensed under CC BY 4.0 International. [doi] [pdf]@techreport{RISC7056,
author = {G. Ehling and T. Kutsia},
title = {{Solving Quantitative Equations}},
language = {english},
abstract = {Quantitative equational reasoning provides a framework that extends equality to an abstract notion of proximity by endowing equations with an element of a quantale. In this paper, we discuss the unification problem for a special class of shallow subterm-collapse-free quantitative equational theories. We outline rule-based algorithms for solving such equational unification problems over generic as well as idempotent Lawvereian quantales and study their properties.},
number = {24-03},
year = {2024},
month = {April},
keywords = {quantitative equational reasoning, Lawvereian quantales, equational unification},
length = {23},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
author = {G. Ehling and T. Kutsia},
title = {{Solving Quantitative Equations}},
language = {english},
abstract = {Quantitative equational reasoning provides a framework that extends equality to an abstract notion of proximity by endowing equations with an element of a quantale. In this paper, we discuss the unification problem for a special class of shallow subterm-collapse-free quantitative equational theories. We outline rule-based algorithms for solving such equational unification problems over generic as well as idempotent Lawvereian quantales and study their properties.},
number = {24-03},
year = {2024},
month = {April},
keywords = {quantitative equational reasoning, Lawvereian quantales, equational unification},
length = {23},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}
[Ehling]
Solving Quantitative Equations
Georg Ehling, Temur Kutsia
In: Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Christoph Benzmüller, Marijn J. H. Heule, Renate A. Schmidt (ed.), Lecture Notes in Artificial Intelligence 14740, pp. 381-400. 2024. Springer, ISBN 978-3-031-63500-7. [doi]@inproceedings{RISC7065,
author = {Georg Ehling and Temur Kutsia},
title = {{Solving Quantitative Equations}},
booktitle = {{Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings}},
language = {english},
series = {Lecture Notes in Artificial Intelligence},
volume = {14740},
pages = {381--400},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-63500-7},
year = {2024},
editor = {Christoph Benzmüller and Marijn J. H. Heule and Renate A. Schmidt},
refereed = {yes},
length = {20},
url = {https://doi.org/10.1007/978-3-031-63501-4_20}
}
author = {Georg Ehling and Temur Kutsia},
title = {{Solving Quantitative Equations}},
booktitle = {{Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings}},
language = {english},
series = {Lecture Notes in Artificial Intelligence},
volume = {14740},
pages = {381--400},
publisher = {Springer},
isbn_issn = {ISBN 978-3-031-63500-7},
year = {2024},
editor = {Christoph Benzmüller and Marijn J. H. Heule and Renate A. Schmidt},
refereed = {yes},
length = {20},
url = {https://doi.org/10.1007/978-3-031-63501-4_20}
}