For stochastic matrices of order $n$, the Karpelevi\v{c} region is the set of all possible eigenvalues. We study matrices whose first and last $m$ rows are arbitrary probability vectors, while the remaining rows have a Toeplitz pattern. As $m$ increases, their eigenvalue regions expand, first reaching the full Karpelev...
In the Steiner Tree problem, the goal is to find a minimum-weight tree containing a given set of terminals in an edge-weighted graph. Given a multiway cut of size $s$, we propose a deterministic algorithm running in $2^{O(s)}\operatorname{poly}(n,b)$ time and polynomial space ($n$ vertices, non-negative $b$-bit integer...
Lukas Van de Voorde, Brecht F. Verbeken, V. Ginis· 0 citations
Let $r>1$ with $\gcd(r,30)=1$. We construct a finite group $G_r=(C_5\times C_3\times C_r)\rtimes W$, where $|W|=32$ and $G_r'\cong C_{60r}$, together with an augmentation-preserving automorphism $\alpha_r\in\operatorname{Aut}(\mathbb{Z}G_r)$ having no Zassenhaus factorization. The image $Y_r=\alpha_r(G_r)$ is a normali...
It is found that LLMs systematically reinforce the Matthew effect by favoring highly cited papers, with field-specific variation in the rate at which generated references match real papers in bibliometric databases.
Andres Algaba, Vincent Holst, Floriano Tori et al.· Quantitative Science Studies· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.