4,378+ open-access research outputs.
We consider the modular action of the symmetric group $S_n$ on $R = k[x_1,\ldots,x_n]$ when $\mathrm{char}(k) = p \leq n$. We show that the image of the transfer map $R\to R^{S_n}$ is an elimination iโฆ
Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph โฆ
We develop a geometric procedure for finding the Ap\'ery set of any numerical semigroup with embedding dimension four. We use this method to find the Frobenius numbers, genera, Betti elements, minimalโฆ
We consider a Ziegler pair of plane arrangements, that is two plane arrangements $\mathcal{A}:f=0$ and $\mathcal{A}':f'=0$ in the projective space $\mathbb{P}^3$, such that the intersection lattices $โฆ
Dimensionality reduction methods such as UMAP and t-SNE are central tools for visualising high-dimensional data, but their local-neighborhood objectives can preserve sampling noise while distorting glโฆ
In this paper, we improve on Fouvry and Radziwi{\l}{\l}'s results on unbalanced convolutions. In particular, we find that if $(\alpha_m)$ and $(\beta_n)$ are sequences supported on $m\sim M$ and $n\siโฆ
Explicit formulas determining the dimension and the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$ are given in terms of the graded Betti numbers of the minimal free resolution oโฆ
Recent research has focused on developing GPU-accelerated first-order solvers for linear programming (LP). This line of work, however, has largely overlooked the role of presolving, and thus prior resโฆ
Gorenstein toric contact manifolds are good toric contact manifolds with zero first Chern class that are completely determined by certain integral convex polytopes called toric diagrams. The Ehrhart pโฆ
We prove that any closed, convex hypersurface in an $(n+1)$-dimensional Riemannian manifold with $\lceil \frac{n}{2} \rceil$-positive curvature operator is a rational homology sphere with finite fundaโฆ
Let $X_t = B_t + \mu t$, $t \geq 0$, be planar Brownian motion with nonzero drift, and let $K_t^r = \{x \in \mathbb{R}^2 : {\rm dist}(x, X[0,t]) \leq r\}$ be the radius-$r$ Wiener sausage up to time $โฆ
We study dynamic multi-battle contests and examine how the contest structure shapes dynamic incentives and determines the extent of rent dissipation. A discouragement effect often arises -- such as inโฆ
We present the second paper in our program characterizing the impact of massive neutrinos on the multiscale cosmic web using global topology and persistent homology. Building on the methodology establโฆ
The spectral kernel field equation R[k] = T[k] lacks a conservation-law analog. We prove (i) the fixed-point flow is strictly volume-expanding (tr DF > 0), precluding automatic conservation, and (ii) โฆ
We introduce and study small covers that are pullbacks from the simplex, extending pullbacks from the linear model. Our main result gives several equivalent characterizations of this class, including โฆ
Many of the most interesting scientific subjects are also the hardest to study with neutrons. Metal-organic frameworks, organic superconductors, quantum magnets, pressure-tuned materials, are systems โฆ
The almost Golomb equation of order $r$ is the implicit functional equation $$a\Bigl(\sum_{j=0}^{r-1} a(n{-}j)\Bigr) = n$$ for nondecreasing sequences of positive integers with $a(1)=1$. Its earliest โฆ
Pokemon Red is a long-horizon JRPG with sparse rewards, partial observability, and quirky control mechanics that make it a challenging benchmark for reinforcement learning. While recent work has shownโฆ
We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexpโฆ
This work is a follow up on the newly proposed clustering algorithm called The Inverse Square Mean Shift Algorithm. In this paper a special case of algorithm for dealing with non-homogenous data is foโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ