56,566+ open-access research outputs.
We classify fillable contact structures on all negative-definite star-shaped plumbings. Along the way, we show that such Seifert fibred spaces admit a unique negative maximal twisting number, and comp…
We study Tur\'an-type extremal problems for distance graphs, motivated by work of Csikv\'ari, Bollob\'as, Tyomkyn, and Uzzell. We determine the maximum number of vertex pairs at distance three in an $…
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 show that every minimally generically globally rigid graph in $\mathbb R^d$ which contains a subgraph isomorphic to $K_{d+2}$ is itself isomorphic to $K_{d+2}$, confirming a conjecture by Garamv{\"…
We study scale-invariant geometric quantities associated with embedded closed curves in Euclidean three-space, with an emphasis on their behavior under optimization within a fixed knot type. Given a E…
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$…
We study structural properties of the free Banach lattice $FBL\langle L\rangle$ generated by a distributive lattice $L$. We characterize when $FBL\langle L\rangle$ has a strong unit, compute its densi…
We construct a block bootstrap max-test for detecting the presence of significant predictors in a high dimensional setting, allowing for weakly dependent and heterogeneous (possibly non-stationary) da…
We study the extremal energy problem for complex unit gain graphs whose underlying graph is the dumbbell graph $D_{r,s,\ell}$. An explicit expression of its characteristic polynomial is derived in ter…
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…
The bull is a graph consisting of a triangle and two pendant edges. The P_5 is the chordless path on five vertices. The house is the complement of a P_5. A graph is k-critical if it is k-chromatic but…
In this letter, we study a model-based inverse problem for infinite-horizon linear-quadratic differential games with descriptor dynamics. Specifically, we seek to identify the set of all cost function…
The reciprocality means a duality in Kirchberg algebras between K-theory groups and strong extension groups. In the paper, we will find a certain class of unital simple Exel--Laca algebras for which t…
We study the set of solutions to a parameterized, strongly convex optimization problem whose cost depends on uncertain, bounded parameters. We compute a certified outer approximation of the correspond…
We study some interesting hypersurfaces that naturally arise when studying the period map on the moduli space of hypersurfaces, in the context of Sung Gi Park's recent work on studying the GIT moduli …
Let $K$ be a finite $p$-adic field with uniformiser $\pi$. In this paper we study the image of the logarithm attached to a Lubin-Tate series $[\pi](X)$ on the maximal ideal of so-called $\pi$-regular …
The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an e…
Optimization of quadratic functions and the quotient of those are relevant in subspace and iterative optimization methods. In this paper, the calculation of the generalized operator norm and extremal …
We prove pathwise convergence of the layerwise evolution of tokens in a finite-depth, finite-width transformer model with MultiLayer Perceptron (MLP) blocks to a continuous-time stochastic interacting…
We develop efficient algorithms for a fundamental network design problem arising in potential-based flow models, which are central to many energy transport networks (e.g., hydrogen and electricity). I…
Free open-access publishing with Google Scholar indexing.
Submission Guide →