Research
Research
Research
Research
41,263+ open-access research outputs.
Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, sho…
We prove a transfer theorem for hereditary classes of $(r+1)$-uniform hypergraphs. Let $\mathcal G$ be such a class, and for $H\in\mathcal G$ write $\Delta(H)$ and $d(H)$ for the maximum degree and av…
For a graph \(G\), let $avm(G)$ denote the average size of its maximal matchings. This parameter was introduced by Engbers and Erey in the study of extremal problems for maximal matchings, and they as…
We consider smooth convex minimization over compact convex sets, i.e., $\min_{x \in C} f(x)$ with the (vanilla) Frank-Wolfe algorithm. Well-known lower bounds establish a worst-case $\Omega(1/t)$ prim…
We introduce a fast, one-dimensional Newtonian {reduced model} to capture uniform rotation in cold white dwarfs, encoding centrifugal support as an effective pressure anisotropy. Using $\Delta_{\rm ro…
The toughness of a graph $G$, denoted by $\tau(G)$, is defined by $\tau(G)=$min $\{\frac{|S|}{c(G-S)}:S\subseteq V(G)$ and $c(G-S)\geq2\}$. A graph $G$ is said to be $\tau$-tough if $\tau(G)\geq \tau$…
Let $X_1,\ldots,X_n$ be independent random points in the closed unit ball of $\mathbb{R}^d$. Assume that each $X_i$ has a beta distribution with parameter $\beta_i \ge -1$: if $\beta_i>-1$, then $X_i$…
In this paper, we compute the iterated Aluthge transforms $\widetilde{C_\phi}^{(n)}$ of the composition operator $C_\phi$ on the weighted Bergman spaces $\mathcal{A}_\alpha^2(\mathbb{D})$, where $\phi…
Let $k\in\mathbb{N}$. Wigert's divisor function $d^{\left(\frac{1}{k}\right)}(j)$ counts the number of representations of $j$ of the form $m^k+mn$ with $m\geq1 , n\geq0$. Let $\mathcal{F}_k(s)$ denote…
\indent In this paper, we study a class of parabolic-elliptic Keller-Segel systems with diffusion sensitivity dependent on spatial position, given by type \begin{equation} \left\{ \begin{array}{ll…
We consider a class of nonlinear parabolic equations \[ \dfrac{\partial}{\partial t} b(u)-\nabla \cdot (A(x,t,u,\nabla u))+H(x,t,\nabla u)=f , \] where $H$ is a nonlinear lower order term sati…
Let $ n \in \mathbb{N} $ with $ n \geq 3 $, and let $\mathcal{G} = \{G_i:i\in [n]\} $ be a family of $ n $-vertex graphs on a common vertex set $V$, where the graphs in the family do not need to be di…
We prove that the Lorentz--FitzGerald contraction is the unique deformation of a resonant cavity moving through a mechanical wave medium that preserves spherical-harmonic phase closure. For a cavity m…
A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possibl…
We study fair allocation of indivisible goods among strategic agents with additive valuations. Motivated by impossibility results for deterministic truthful mechanisms, we focus on randomized mechanis…
We prove the $\frac{2d}{d+1}$-Sidon inequality for a system of functions representing the most general extension of the Rademacher $d$-chaos to the $p$-ary case.…
We compute exact finite-rank BPS generating functions for the fermionic matrix model with single-trace supercharge $Q_p=\operatorname{tr}(\Psi^p)$ at $(p,N)=(5,3),(5,4),(5,5),(7,4)$, together with par…
We study the Maximum Balanced Biclique (MBB) problem: Given a bipartite graph $G$ with $n$ vertices on each side, find a balanced biclique in $G$ with maximum size. We give a polynomial-time $\left(\f…
Radio Access Network (RAN) configuration has traditionally required significant manual effort due to indirect causal dependencies between observable Key Performance Indicators (KPIs), and context-depe…
This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Spe…
Free open-access publishing with Google Scholar indexing.
Submission Guide →