Research
Research
Research
Research
5,177+ open-access research outputs.
Ghost imaging uses two light beams correlated in the transverse position, time, or frequency to create an image of a spatial, temporal, or spectral object. We propose a scheme of time-to-space ghost i…
The classification of maximal algebras of square block Toeplitz matrices is a considerably more difficult problem and has received relatively little attention in the existing literature. In this work,…
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…
A graph is Schur-positive if its chromatic symmetric function expands non-negatively in the Schur basis. We determine a full Schur-positivity classification for complete multipartite graphs by showing…
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 …
Network Slice as a Service (NSaaS) is a key enabler of Beyond Fifth Generation (5G) and Sixth Generation (6G) networks, supporting next-generation applications such as extended reality (XR), immersive…
Continuous causal discovery typically couples representation learning with structural optimization via non-convex acyclicity penalties, which subjects solvers to local optima and restricts scalability…
The IKKT matrix model, which is proposed as a non-perturbative formulation of superstring theory, has an issue typical of zero-dimensional theory -- ambiguity in the definition of its path integral. T…
Genomic Schur functions were introduced by Pechenik and Yong in connection with the $K$-theory of Grassmannians. Pechenik proved that genomic Schur functions admit a positive expansion in the basis of…
We study modular analogues of Schur numbers for systems of linear equations. We show that these only depend on the number of equations, not their coefficients and in the case of one equation show stro…
One of the central open problems in both algebraic combinatorics and representation theory is to find a positive combinatorial rule for Kronecker coefficients $ g_{\lambda \, \mu \, \nu}$. A notable a…
We study three-dimensional partition functions constructed from the tetrahedral $L$-operator introduced and studied by Bazhanov-Sergeev and Kuniba-Maruyama-Okado. First, we explore the $q=0$ case, ext…
We develop a minisuperspace formulation of the classical double copy for anisotropic Lifshitz spacetimes in arbitrary dimension. By imposing static symmetries at the level of the action, the gravitati…
Previous work shows that small triangles can be rasterized efficiently with compute shaders. Building on this insight, we explore how far this can be pushed for massive triangle datasets without the n…
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 quadratic complexity of softmax attention presents a major obstacle for scaling Transformers to high-resolution vision tasks. Existing linear attention variants often replace the softmax with Gaus…
The classical double copy provides a powerful bridge between gravity and gauge theory, but its most explicit realizations remain concentrated in stationary or highly symmetric settings. We show that t…
The Nobel Prize in literature 1965 was awarded Mikhail Sholokhov (1905-1984), for the epic novel Tikhij Don about Cossack life and the birth of a new Soviet society (And Quiet Flows the Don, or The Qu…
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 …
Free open-access publishing with Google Scholar indexing.
Submission Guide →