English
Related papers

Related papers: Equivalent Conditions for Domination of $\mathrm{M…

200 papers

It is given notions of singular hyperbolicity and sectional Lyapunov exponents of orders beyond the classical ones, namely, other dimensions besides the dimension 2 and the full dimension of the central subbundle of the singular hyperbolic…

Dynamical Systems · Mathematics 2020-07-09 Luciana Salgado

We give an extension of a criterion of van der Corput on uniform distribution of sequences. Namely, we prove that a sequence $x_n$ is uniformly distributed modulo 1 if it is weakly monotonic and satisfies the conditions $\Delta^2x_n\to…

Classical Analysis and ODEs · Mathematics 2024-08-14 Grigori Karagulyan , Iren Petrosyan

Let $\gamma_g(G)$ be the game domination number of a graph $G$. It is proved that if ${\rm diam}(G) = 2$, then $\gamma_g(G) \le \left\lceil \frac{n(G)}{2} \right\rceil- \left\lfloor \frac{n(G)}{11}\right\rfloor$. The bound is attained: if…

Combinatorics · Mathematics 2021-02-03 Csilla Bujtás , Vesna Iršič , Sandi Klavžar , Kexiang Xu

We prove that a C2 Hamiltonian system H in M is globally hyperbolic if any of the following statements holds: H is robustly topologically stable; H is stably shadowable; H is stably expansive; and H has the stable weak specification…

Dynamical Systems · Mathematics 2015-06-12 M. Bessa , J. Rocha , M. J. Torres

For a genuinely nonlinear $2\times 2$ hyperbolic system of conservation laws, assuming that the initial data have small ${\bf L}^\infty$ norm but possibly unbounded total variation, the existence of global solutions was proved in a…

Analysis of PDEs · Mathematics 2025-05-06 Alberto Bressan , Elio Marconi , Ganesh Vaidya

Let $G$ be a graph. A total dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex in $G$ is adjacent to a vertex in $S$. Recently, the following question was proposed: "Is it true that every connected cubic…

Combinatorics · Mathematics 2023-08-30 S. Akbari , M. Azimian , A. Fazli Khani , B. Samimi , E. Zahiri

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex of $G$ is in $S$ or is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The domination number…

Combinatorics · Mathematics 2020-10-27 Martin Knor , Riste Škrekovski , Aleksandra Tepeh

We use the framework of Colombeau algebras of generalized functions to study existence and uniqueness of global generalized solutions to mixed non-local problems for a semilinear hyperbolic system. Coefficients of the system as well as…

Analysis of PDEs · Mathematics 2025-12-10 Irina Kmit

We study the hyperbolicity of singular quotients of bounded symmetric domains. We give effective criteria for such quotients to satisfy Green-Griffiths-Lang's conjectures in both analytic and algebraic settings. As an application, we show…

Algebraic Geometry · Mathematics 2018-10-01 Benoit Cadorel , Erwan Rousseau , Behrouz Taji

Let $\Gamma$ be a Schottky subgroup of $\mathrm{SL} (2,\mathbb{Z})$. We establish a uniform and explicit lower bound of the second eigenvalue of the Laplace-Beltrami operator of congruence coverings of the hyperbolic surface $\Gamma…

Spectral Theory · Mathematics 2023-04-20 Irving Calderón , Michael Magee

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number…

Discrete Mathematics · Computer Science 2020-01-10 A. Akbari , S. Akbari , A. Doosthosseini , Z. Hadizadeh , Michael A. Henning , A. Naraghi

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex in $V(G) \setminus S$ is adjacent to a vertex in $S$. A restrained dominating set of $G$ is a dominating set $S$ with the additional restraint that the graph $G…

Combinatorics · Mathematics 2024-03-27 Boštjan Brešar , Michael A. Henning

We commence the study of domination in the incidence graphs of combinatorial designs. Let $D$ be a combinatorial design and denote by $\gamma(D)$ the domination number of the incidence (Levy) graph of $D$. We obtain a number of results…

Combinatorics · Mathematics 2014-05-15 Felix Goldberg , Deepak Rajendraprasad , Rogers Mathew

An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…

Functional Analysis · Mathematics 2013-06-12 Alexey I. Popov

We revisit the question of whether the strong law of large numbers (SLLN) holds uniformly in a rich family of distributions, culminating in a distribution-uniform generalization of the Marcinkiewicz-Zygmund SLLN. These results can be viewed…

Probability · Mathematics 2024-10-23 Ian Waudby-Smith , Martin Larsson , Aaditya Ramdas

Recently, a strong exponential character bound has been established in [3] for all elements $g \in \mathbf{G}^F$ of a finite reductive group $\mathbf{G}^F$ which satisfy the condition that the centraliser $C_{\mathbf{G}}(g)$ is contained in…

Representation Theory · Mathematics 2022-02-07 Jay Taylor , Pham H. Tiep

We consider smooth, double-odd solutions of the two-dimensional Euler equation in $[-1, 1)^2$ with periodic boundary conditions. It is tempting to think that the symmetry in the flow induces possible double-exponential growth in time of the…

Analysis of PDEs · Mathematics 2016-01-19 Vu Hoang , Maria Radosz

For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…

Rings and Algebras · Mathematics 2022-01-19 Gábor Czédli

We study coarse separation in one-ended hyperbolic groups from a quantitative point of view, focusing on the volume growth of separating subsets. We prove that a one-ended hyperbolic group that is not virtually a surface group is coarsely…

Group Theory · Mathematics 2026-03-19 Oussama Bensaid , Anthony Genevois , Romain Tessera

Let $G$ be a finite simple group. By a theorem of Guralnick and Kantor, $G$ contains a conjugacy class $C$ such that for each non-identity element $x \in G$, there exists $y \in C$ with $G = \langle x,y\rangle$. Building on this deep…

Group Theory · Mathematics 2018-04-11 Timothy C. Burness , Scott Harper
‹ Prev 1 3 4 5 6 7 10 Next ›