1,635+ open-access research outputs.
Upon the introduction of the Metropolis algorithm, the question of how many steps in the Markov chain were needed to achieve convergence to stationarity became apparent. The convergence was rather sloโฆ
In this paper we develop a novel inferential approach based on geometric records for estimating the tail index of heavy-tailed distributions. We construct a maximum likelihood estimator for the Paretoโฆ
A finite set $S \subset \mathbb{Z}$ is a \emph{Sidon set} if its pairwise differences are distinct. A \emph{perfect difference set} (PDS) of order $n$ is a set $B \subset \mathbb{Z}_v$ ($v = n^2 - n +โฆ
Uncertainty is ubiquitous in real-world data, and the assumptions underlying classical linear regression models are often violated in practice. Inspired by the theory of sublinear expectation, we consโฆ
The Pareto distribution plays a crucial role in various disciplines, necessitating robust goodness-of-fit tests for its validation. This article introduces a novel tests based on Stein's characterizatโฆ
We construct examples of abelian categories with no non-zero injective (or projective) objects satisfying Grothendieck's AB5 condition. The procedure combines Rickard's examples of AB5 categories withโฆ
We establish a fractal transference principle for continued fraction expansions over the field of Laurent series. Let $S$ be an infinite subset of the set of all polynomials over a finite field of $q$โฆ
We investigate \emph{magnitude} as a new unary and strictly Pareto-compliant quality indicator for finite approximation sets to the Pareto front in multiobjective optimization. Magnitude originates inโฆ
We prove the semistable reduction theorem for $\mathcal{E}^{\dag}_K$-valued and $K$-valued overconvergent $F$-isocrystals over $k((t))$-varieties which were introduced by Lazda and P\'{a}l. As an applโฆ
If a finite group $G$ acts on a rational homology manifold, then the orbit space is well-known to be a rational homology manifold again. We consider here actions on spaces that may be much more singulโฆ
On a compact connected Riemann surface $C$ of genus at least $2$, we construct Lagrangian correspondences between moduli spaces of rank-$n$ Higgs bundles (respectively, holomorphic connections) and thโฆ
Diffusion models have emerged as powerful generative priors for solving PDE-constrained inverse problems. Compared to end-to-end approaches relying on massive paired datasets, explicitly decoupling thโฆ
We study the complete diagonal of the Laurent series expansion of a rational function in $n$-complex variables. For a denominator that is nondegenerate for its Newton polyhedron, we prove that the comโฆ
We study the GENERIC (General Equation for Non-Equilibrium Reversible Irreversible Coupling) formulation of the nonlinear Vlasov-Fokker-Planck equation from the perspective of gradient flows along traโฆ
Benchmark problems play a central role in assessing the performance of numerical optimization algorithms. However, many existing constrained multiobjective optimization benchmark problems rely on overโฆ
Data-driven control has emerged as a powerful paradigm for synthesizing controllers directly from data, bypassing explicit model identification. However, this reliance on data introduces new and largeโฆ
Let $p$ be a prime number, and let $\Delta_1,\Delta_2 < 0$ be two coprime fundamental discriminants. When $p$ splits in $\mathbb{Q}(\sqrt{\Delta_1})$ and $\mathbb{Q}(\sqrt{\Delta_2})$ the height pairiโฆ
Let $M$ be the $n$-square matrix partitioned into $\ell^2$ blocks $b_{ij}$ according to some partition $P=\{C_{1},\dots,C_{\ell}\}$ of index set $\{1,\dots,n\}$. The quotient matrix $Q=(q_{ij})$ is a โฆ
We propose a novel numerical approach to compute the Pareto front in multivariate polynomial multi-objective optimization problems. When the objective functions and (equality) constraints are multivarโฆ
In a cluster algebra, a subset of initial cluster variables can be specialised in such a way that all elements of the resulting algebra become polynomial in the remaining variables.โฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ