Related papers: On the Uniqueness of Simultaneous Rational Functio…
Reinforcement learning with verifiable rewards (RLVR) succeeds in reasoning tasks (e.g., math and code) by checking the final verifiable answer (i.e., a verifiable dot signal). However, extending this paradigm to open-ended generation is…
Short-time Fourier transform (STFT) phase retrieval refers to the reconstruction of a function $f$ from its spectrogram, i.e., the magnitudes of its short-time Fourier transform $V_gf$ with window function $g$. While it is known that for…
Simple function classes have emerged as toy problems to better understand in-context-learning in transformer-based architectures used for large language models. But previously proposed simple function classes like linear regression or…
In this paper, we discuss the simple current orbifold of a rational Narain CFT (Narain RCFT). This is a method of constructing other rational CFTs from a given rational CFT, by ``orbifolding'' the global symmetry formed by a particular…
We study the boundary behavior of rational inner functions (RIFs) in dimensions three and higher from both analytic and geometric viewpoints. On the analytic side, we use the critical integrability of the derivative of a rational inner…
We propose rectified factor networks (RFNs) to efficiently construct very sparse, non-linear, high-dimensional representations of the input. RFN models identify rare and small events in the input, have a low interference between code units,…
We treat shared value problems for rational functions $R(z)$ and their derivative $R'(z)$ in the plane and on the sphere. We also consider shared values for the pair $R(w)$ and $\partial_{z} R = \lambda w \cdot R'(w)$ on ${\mathbb C}…
Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…
Cognitive Architectures are the forefront of the research into developing an artificial cognition. However, they approach the problem from a separated memory and program model of computation. This model of computation poses a fundamental…
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied…
We present two algorithms for constructing orthonormal bases of rational function vectors with respect to a discrete inner product, and discuss how to use them for a rational approximation problem. Building on the pencil-based formulation…
Let $F$ be a rational function of one complex variable of degree $m\geq 2$. The function $F$ is called simple if for every $z\in \mathbb C\mathbb P^1$ the preimage $F^{-1}\{z\}$ contains at least $m-1$ points. We show that if $F$ is a…
We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and…
Studies of modular linear differential equations (MLDE) for the classification of rational CFT characters have been limited to the case where the coefficient functions (in monic form) have no poles, or poles at special points of moduli…
The reconstruction of an unknown function $f$ from its line sums is the aim of discrete tomography. However, two main aspects prevent reconstruction from being an easy task. In general, many solutions are allowed due to the presence of the…
We consider the generalized Radon transform (defined in terms of smooth weight functions) on hyperplanes in $\mathbb{R}^n$. We analyze general filtered backprojection type reconstruction methods for limited data with filters given by…
Symbolic summation as an active research topic of symbolic computation provides efficient algorithmic tools for evaluating and simplifying different types of sums arising from mathematics, computer science, physics and other areas. Most of…
A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…
We consider the problem of reconstruction of an $n\times n$ matrix with coefficients depending rationally on $x\in \mathbb P^1$ from the data of: (a) its characteristic polynomial and (b) a line bundle of degree $g+n-1$, with $g$ the…
In this paper, we consider the challenge of reconstructing jointly sparse vectors from linear measurements. Firstly, we show that by utilizing the rank of the output data matrix we can reduce the problem to a full column rank case. This…