5,016+ open-access research outputs.
We prove that a class of classical lattice models on $\mathbb{Z}^d$ ($d \geq 2$) with on-site space $\mathbb{N}_0$ exhibits long-range checkerboard order at sufficiently high temperature. The model ha…
In this paper we improve the previously achieved upper bound on the corank of an equivariantly stable singularity for a group of prime order. We also prove that the maximal corank of a simple $\mathbb…
We consider adversarial multi-armed bandit problems where the learner is allowed to observe losses of a number of arms beside the arm that it actually chose. We study the case where all non-chosen arm…
Heinsohn and Steiger's "Eigentum, Zins und Geld" (1996) proposes the property premium as the foundational determinant of interest, replacing time preference. This paper examines whether the replacemen…
For $0\le k\le n$, write $\binom nk=uv$ where the primes dividing $u$ are at most $k$ and the primes dividing $v$ exceed $k$, and let $f(n)$ be the least $k$ with $u>n^2$; Erd\H{o}s problem 684 asks f…
For a germ $(X,0)$ of a normal complex analytic surface, let $E:=H^0({}^p_+IC_X\mathbb Z)_0$, where ${}^pIC_X\mathbb Z$ and ${}^p_+IC_X\mathbb Z$ denote the ordinary and dual middle-perversity interse…
We present a uniform framework for constructing $3$-designs from $\mathrm{GL}_2(\mathbb F_q)$-invariant subspaces of $\mathbb F_q[X,Y]_k$, the space of homogeneous polynomials of degree $k$. Given suc…
Let H(k) be the smallest N such that every finite coloring of [N] contains a monochromatic or rainbow k-term arithmetic progression. Erd\H{o}s and Graham asked whether $H(k)^{1/k}/k \to \infty$ (Probl…
This paper investigates several classical and novel variations of the Erd\H{o}s--Szekeres problem, including multicolored point sets, convex hexagons with a given number of interior points, and polygo…
Let $U$ be a Lucas sequence, $p$ be prime, and $\rho_U(p)$ be the rank of appearance of $p$ in $U$. We derive closed-form formulas for the Dirichlet density of primes $p$ for which $d\mid \rho_U(p)$, …
It is well known that Erd\H{o}s Matching Conjecture concerns the maximum number of hyperedges in an $r$-uniform hypergraph with bounded matching number. As a generalization, it is natural to ask for t…
This manuscript investigates channel capacity under mismatched stochastic likelihood decoding. We derive Feinstein- and Verd\'u-Han-style bounds on the error probability coded communication. These are…
We study the set $S(q)$ of residue classes $r$ modulo the Pisano period $\pi(q)$ for which $q \mid \varphi(F_m)$ for every $m \equiv r \pmod{\pi(q)}$. We prove that if $q$ is a Sophie Germain prime an…
Erd\H{o}s asked for the largest size $f(n)$ of a subset of $\{1,\dots,n\}$ with no element dividing two others. We show that $f(n)=c_2\,n+o(n)$ for an effectively computable constant $c_2$, and moreov…
We prove that the Penrose limit of a Lorentzian metric along an affinely parametrized null geodesic is intrinsic, but intrinsic on a weighted associated-graded model determined by the null filtration …
For finite graphs $G$ and $H$, let $\RR(G,H)$ denote the isomorphism classes of Ramsey-minimal graphs for $(G,H)$. We prove two 1981 conjectures of Burr, Erd\H{o}s, Faudree, Rousseau, and Schelp: Rams…
Neurobiological and neurodegenerative diseases are inherently multifactorial, arising from coupled influences spanning genetic susceptibility, brain alterations, and environmental and behavioral facto…
We present a review of supersymmetry, supergravity, and the non-perturbative dynamics of gauge theories, tracing a path from the supersymmetry algebra to moduli stabilisation and de~Sitter vacua in st…
Across scholarly communities, manuscripts face similar evaluative rituals: editors invite experts to privately assess submissions through formal peer reviews. This closed, loosely structured, and publ…
In 1981, Erd\H{o}s and Faudree asked whether there exists an infinite family of graphs $G_N$ on $N$ vertices with $\Delta(G_N)<N-1$ and $\sri(G_N)=1$, and whether every family with $|V(G_N)|=N$ and $\…
Free open-access publishing with Google Scholar indexing.
Submission Guide →