Related papers: Sparse bounds on variational norms along monomial …

A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…

We introduce a new sparse $T1$ theorem that estimates the dual pair associated with a Calderon-Zygmund operator by a sub-bilinear form supported on a sparse family of cubes. The main result in the paper improves previous sparse $T1$…

Given graphs $G_1,\ldots,G_s$ all on a common vertex set and a graph $H$ with $e(H) = s$, a copy of $H$ is \emph{transversal} or \emph{rainbow} if it contains one edge from each $G_i$. We establish a stability result for transversal…

By generalizing the path method, we show that nonlinear spectral gaps of a finite connected graph are uniformly bounded from below by a positive constant which is independent of the target metric space. We apply our result to an $r$-ball…

This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows and linear programming in order to obtain results on the…

Let $(\Sigma,p)$ be a pointed Riemann surface of genus $g\geq 1$. For any integer $k\geq 1$, we parametrize the space of meromorphic quadratic differentials on $\Sigma$ with a pole of order $(k+2)$ at $p$, having a connected critical graph…

Let G be a semisimple linear algebraic group defined over rational numbers, K be a maximal compact subgroup of its real points and {\Gamma} be an arithmetic lattice. One can associate a probability measure {\mu}(H) on {\Gamma}\G for each…

Let $\Gamma$ be an arbitrary $\mathbb{Z}^n$-periodic metric graph, which does not coincide with a line. We consider the Hamiltonian $\mathcal{H}_\varepsilon$ on $\Gamma$ with the action $-\varepsilon^{-1}{\mathrm{d}^2/\mathrm{d} x^2}$ on…

In this sequence, we first prove an abstract Morse index theorem in a Hilbert space modeling a variational problem with constraints. Then, our abstract formulation is applied to study several optimization setups including closed CMC…

For any 3-manifold M and any nonnegative integer g, we give here examples of metrics on M each of which has a sequence of embedded minimal surfaces of genus g and without Morse index bounds. On any spherical space form S^3/Gamma we…

We investigate exponential sums modulo primes whose phase function is a sparse polynomial, with exponents growing with the prime. In particular, such sums model those which appear in the study of the quantum cat map. While they are not…

Let C be an algebraic curve defined over a number field K, of positive genus and without K-rational points. We conjecture that there exists some extension field L over which C violates the Hasse principle, i.e., has points everywhere…

Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…

For continuous \gamma, g:[0,1]\to(0,\infty), consider the degenerate stochastic differential equation dX_t=[1-|X_t|^2]^{1/2}\gamma(|X_t|) dB_t-g(|X_t|)X_t dt in the closed unit ball of R^n. We introduce a new idea to show pathwise…

The $d$-distance $p$-packing domination number $\gamma_d^p(G)$ of a graph $G$ is the cardinality of a smallest set of vertices of $G$ which is both a $d$-distance dominating set and a $p$-packing. If no such set exists, then we set…

For graphs $G,H$ it is possible to add $(|V(G)|-\gamma(G))(|V(H)|-\gamma(H))$ edges to the Cartesian product $G\mathbin{\square}H$ such that a minimal dominating set $D$ of size $\gamma(G)\gamma(H)$ emerges. We hypothesize that $D$ is also…

Let $G=NH$ be a Lie group where $N,H$ are closed connected subgroups of $G,$ and $N$ is an exponential solvable Lie group which is normal in $G.$ Suppose furthermore that $N$ admits a unitary character $\chi_{\lambda}$ corresponding to a…

A matching in a hypergraph $\mathcal{H}$ is a set of pairwise disjoint hyperedges. The matching number $\nu(\mathcal{H})$ of $\mathcal{H}$ is the size of a maximum matching in $\mathcal{H}$. A subset $D$ of vertices of $\mathcal{H}$ is a…

We investigate the threshold $p_{\vec H}=p_{\vec H}(n)$ for the Ramsey-type property $G(n,p)\to \vec H$, where $G(n,p)$ is the binomial random graph and $G\to\vec H$ indicates that every orientation of the graph $G$ contains the oriented…

We consider a realization of fractional supersymmetric of quantum mechanics of order $r$, where the Hamiltonian and supercharges involve reflection operators. It is shown that the Hamiltonian has $r$-fold degenerate spectrum and the…