Tootfinder

This https://arxiv.org/abs/2105.04334 has been replaced.
link: https://scholar.google.com/scholar?q=a

Asymptotic Analysis of q-Recursive Sequences
For an integer $q\ge2$, a $q$-recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of~$q$. In this article, $q$-recursive sequences are studied and the asymptotic behavior of their summatory functions is analyzed. It is shown that every $q$-recursive sequence is $q$-regular in the sense of Allouche and Shallit and that a $q$-linear representation of the sequence can be computed easily by using the coefficients from the recurrence relations. Detaile…

Recursive GNNs for Learning Precoding Policies with Size-Generalizability
Jia Guo, Chenyang Yang
https://arxiv.org/abs/2402.18332 https://

Recursive GNNs for Learning Precoding Policies with Size-Generalizability
Graph neural networks (GNNs) have been shown promising in optimizing power allocation and link scheduling with good size generalizability and low training complexity. These merits are important for learning wireless policies under dynamic environments, which partially come from the matched permutation equivariance (PE) properties of the GNNs to the policies to be learned. Nonetheless, it has been noticed in literature that only satisfying the PE property of a precoding policy in multi-antenna s…

Algorithmically Expressive, Always-Terminating Model for Reversible Computation
Matteo PalazzoUniversit\`a di Torino, Luca RoversiUniversit\`a di Torino
https://arxiv.org/abs/2402.19012

Algorithmically Expressive, Always-Terminating Model for Reversible Computation
Concerning classical computational models able to express all the Primitive Recursive Functions (PRF), there are interesting results regarding limits on their algorithmic expressiveness or, equivalently, efficiency, namely the ability to express algorithms with minimal computational cost. By introducing the reversible programming model Forest, at our knowledge, we provide a first study of analogous properties, adapted to the context of reversible computational models that can represent all the …

Kontsevich's Formula for Rational Curves from Classical and Quantum Perspectives
Greg Weiler
https://arxiv.org/abs/2403.19663 https://

Kontsevich's Formula for Rational Curves from Classical and Quantum Perspectives
Kontsevich's formula for rational plane curves is a recursive relation for the number $N_d$ of degree $d$ rational curves in $\mathbb{P}^2$ passing through $3d-1$ general points. We provide two proofs of this recursion: the first more direct and combinatoric, the second more abstract. In order to achieve this, we introduce several moduli spaces, such as the Deligne-Mumford-Knudsen spaces and the Kontsevich spaces, and exploit their properties. In particular, the boundary structure of these …

This https://arxiv.org/abs/2105.04334 has been replaced.
link: https://scholar.google.com/scholar?q=a

Asymptotic Analysis of q-Recursive Sequences
For an integer $q\ge2$, a $q$-recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of~$q$. In this article, $q$-recursive sequences are studied and the asymptotic behavior of their summatory functions is analyzed. It is shown that every $q$-recursive sequence is $q$-regular in the sense of Allouche and Shallit and that a $q$-linear representation of the sequence can be computed easily by using the coefficients from the recurrence relations. Detaile…

This https://arxiv.org/abs/2310.14882 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On a Markov chain related to the individual lengths in the recursive construction of Kingman's coalescent
Kingman's coalescent is a widely used process to model sample genealogies in population genetics. Recently there have been studies on the inference of quantities related to the genealogy of additional individuals given a known sample. This paper explores the recursive (or sequential) construction which is a natural way of enlarging the sample size by adding individuals one after another to the sample genealogy via individual lineages to construct the Kingman's coalescent. Although the process o…

Addressing Myopic Constrained POMDP Planning with Recursive Dual Ascent
Paula Stocco, Suhas Chundi, Arec Jamgochian, Mykel J. Kochenderfer
https://arxiv.org/abs/2403.17358

Addressing Myopic Constrained POMDP Planning with Recursive Dual Ascent
Lagrangian-guided Monte Carlo tree search with global dual ascent has been applied to solve large constrained partially observable Markov decision processes (CPOMDPs) online. In this work, we demonstrate that these global dual parameters can lead to myopic action selection during exploration, ultimately leading to suboptimal decision making. To address this, we introduce history-dependent dual variables that guide local action selection and are optimized with recursive dual ascent. We empirical…

This https://arxiv.org/abs/2404.06895 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIR_…

CaDRec: Contextualized and Debiased Recommender Model
Recommender models aimed at mining users' behavioral patterns have raised great attention as one of the essential applications in daily life. Recent work on graph neural networks (GNNs) or debiasing methods has attained remarkable gains. However, they still suffer from (1) over-smoothing node embeddings caused by recursive convolutions with GNNs, and (2) the skewed distribution of interactions due to popularity and user-individual biases. This paper proposes a contextualized and debiased recomm…

Leading terms of generalized Pl\"ucker formulas
Andr\'as P. Juh\'asz
https://arxiv.org/abs/2404.18859 https://arxiv.org/…

Leading terms of generalized Plücker formulas
Generalized Plücker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of certain invariant subspaces, the so-called coincident root strata, of the vector space of homogeneous degree $d$ complex polynomials in two variables. In an earlier paper László M. Fehér and the author gave a new, recursive method for calculating these classe…

This https://arxiv.org/abs/2307.02180 has been replaced.
link: https://scholar.google.com/scholar?q=a

Runtime Repeated Recursion Unfolding in CHR: A Just-In-Time Online Program Optimization Strategy That Can Achieve Super-Linear Speedup
We introduce a just-in-time runtime program transformation strategy based on repeated recursion unfolding. Our online program optimization generates several versions of a recursion differentiated by the minimal number of recursive steps covered. The base case of the recursion is ignored in our technique. Our method is introduced here on the basis of single linear direct recursive rules. When a recursive call is encountered at runtime, first an unfolder creates specializations of the associate…