Research
Research
Research
Research
117,871+ open-access research outputs.
We advance Matkovi\v{c} ideas, originally applied to complete the classification of tight structures on small Seifert fibred $L$-spaces, to show the existence of contact structures on Brieskorn sphere…
We adapt the Ozsv\'ath-Szab\'o full path algorithm to every star-shaped graph and establish a correspondence between negative-twisting tight contact structures on any Seifert fibred space over $S^2$, …
We introduce a refined immersed boundary (IB) methodology that is better-than-first-order accurate in practice, while preserving key properties of "continuous-forcing" IB approaches that retain a sing…
We investigate the dynamics of dissipative systems with stochastic forcing and focus in particular on mean-square stability. First we show, under a natural condition on the drift and diffusion, that t…
The impossibility of eliminating hallucination, understood here as incorrect definite answers, in sufficiently expressive yes-or-no formal domains is an immediate consequence of classical undecidabili…
In this paper, we study an inverse boundary value problem for the Jordan--Moore--Gibson--Thompson equation on a simple Riemannian manifold. We consider an all boundary measurement map that maps Dirich…
We associate a musical instrument, a "hyperbolic marimba", to every pair $(X,\Gamma)$ where $X$ is a hyperbolic surface and $\Gamma\subset X$ a simple multicurve labeled with musical keys. It works as…
A Killing tensor field on a Riemannian space corresponds to an integral of the geodesic flow polynomial in momenta. A Killing tensor field is called decomposable if it is a polynomial in Killing vecto…
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$…
The Etzion-Silberstein conjecture asserts that, for any finite field $\mathbb F$, Ferrers diagram $\mathcal D$, and integer $d$, there exists a linear matrix code supported on $\mathcal D$ with minimu…
We study solution discovery, where the goal is to obtain a feasible solution to a problem from an initial configuration by a bounded sequence of local moves. In many applications, however, the graph t…
We consider the problem of finding the (unique) minimal Walrasian equilibrium price in multi-item, multi-unit auction models: there are multiple indivisible items for sale, with several units of each …
This work studies numerical integration by the M\"obius-transformed trapezoidal rule, which combines the classical trapezoidal rule with a change of variables induced by a M\"obius transformation that…
In this paper, we study the three-dimensional inviscid incompressible resistive Hall-MHD system in the axisymmetric setting with nontrivial swirl velocity and purely azimuthal magnetic. Assuming only …
We construct pulse-type approximate solutions to nonlinear hyperbolic equations near diffractive points, allowing arbitrary (even infinite) order of grazing. We show that in low regularity spaces and …
Let $k\ge 2$ be fixed integer, $0<c<1$ a constant. Consider a graph $G$ with $n$ vertices and average degree $cn$. We answer a question of Simon Griffiths by showing that $G$ has $k$ vertices such tha…
Mirror symmetry predicts an action by the fundamental group of a conjectural stringy K\"ahler moduli space on the derived category of an algebraic variety. For a toric variety, a model for this space …
Field/circuit coupling is a common approach when a lumped representation of a certain electrotechnical device is not accurate enough. To exploit existing code and underlying properties of the coupled …
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…
We present two complementary proofs that, if the lengths of $n$ sticks are sampled at random, then the probability that no $p+1$ sticks can form a $(p+1)$-sided polygon can be expressed as the product…
Free open-access publishing with Google Scholar indexing.
Submission Guide →