998+ open-access research outputs.
In 2014, Michal Lewicki and Andrzej Olbry\'s proved that if a real valued function $f$ defined on the real line satisfies the conditional functional equation \[ f(tx + (1-t)y) = t f(x) + (1-t) f(y),\qโฆ
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 prove that on a semisimple Lie algebra $\mathfrak{g}$ over a finite field of large characteristic, if a complex-valued invariant function $f$ and its Fourier transform $\hat f$ are both supported iโฆ
We study the edge-expansion of the graph of a random $0/1$ polytope $P^d_p$, defined as the convex hull of a random subset of the points in $\{0,1\}^d$ where every point is retained independently and โฆ
The extent to which the geometry of an object is determined by some associated spectral data is a longstanding problem. We investigate this problem in the context of the Steklov spectrum, focusing on โฆ
Biochemical signalling cascades transduce extracellular stimuli into cellular responses through sequences of discrete, node-to-node activations. While signal fidelity depends critically on local interโฆ
Given a thin torus $T_K$ around a knot $K\subset \mathbb{R}^3$, we construct Morse models of cord algebra $Cord(T_K)$ with $\mathbb{Z}$ and loop space coefficients. Using the Multiple time scale dynamโฆ
A 0/1-polytope is the convex hull of a subset $V\subseteq \{0,1\}^n$. A celebrated conjecture of Mihail and Vazirani asserts that the graph of every 0/1-polytope has edge-expansion at least 1. In thisโฆ
For a set of $n$ points $V \subseteq \mathbb{R}$ let $G(V, p)$ be the random graph on $V$ where each possible edge is present independently with probability $p$. We call a subset $U \subseteq V$ {\empโฆ
The notion of asymptotic space for an unbounded metric space has been introduced by Micha Gromov in 1980s. It is intended to capture the structure of a metric space at infinity. The most comprehensiveโฆ
We study the Hitchin morphism for higher dimensional varieties and show that, for a certain class of varieties which we call r-small, the set-theoretic image of the Hitchin morphism from the Dolbeaultโฆ
We give a categorical proof of the projectivity of $N$ in the free topos -- in proof-theoretic terms, the rule of countable choice for intuitionistic higher-order logic -- based on the unpublished proโฆ
The notion of $\ast$-measure on a compact Hausdorff space can be defined for arbitrary continuous triangular norm $\ast$. The well-known Hutchinson-Barnsley theory deals with the iterated function sysโฆ
To model amplification Polymerase Chain Reaction (PCR) techniques targeting DNA sequences of several types, we introduce a multitype PCR branching process as a generalized version of the Michaelis-Menโฆ
Oriented graph discrepancy problems focus on finding specific subgraphs within a given oriented graph $G$ that contain a significant number of edges in one direction. This concept was first introducedโฆ
We prove that every sufficiently large integer $n$ can be written in the form $n=x^2+y^2-z^2$ with $\textrm{max}(x^2,y^2,z^2)\le n$. The proof converts the problem into finding a primitive binary quadโฆ
In this expository paper, we discuss a unified framework for proving various geometric inequalities, based on the so-called Alexandrov-Bakelman-Pucci technique. Examples include Cabr\'e's proof of theโฆ
We construct the natural Frobenius structures on two families of rigid irregular $\check{G}$-connections on $\mathbb{G}_m$ (or $\mathbb{A}^1$) for a split simple group $\check{G}$: (i) the $\theta$-coโฆ
We prove a conjecture of Michel--Venkatesh on joinings of distinct Linnik problems, in the setting of simultaneous quaternionic embeddings of imaginary quadratic fields having sufficiently many small โฆ
Spin glass theory studies the structure of sublevel sets and minima (or near-minima) of certain classes of random functions in high dimension. Near-minima of random functions also play an important roโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ