English
Related papers

Related papers: Removability of H\"older graphs for continuous sob…

200 papers

A relationship between two old mathematical subjects is observed: the theory of hypergeometric functions and the separability in classical mechanics. Separable potential perturbations of the integrable billiard systems and the Jacobi…

Mathematical Physics · Physics 2007-05-23 Vladimir Dragovic

We construct irreducible modules V_{\alpha}, \alpha \in \C over W_3 algebra with c = -2 in terms of a free bosonic field. We prove that these modules exhaust all the irreducible modules of W_3 algebra with c = -2. Highest weights of modules…

q-alg · Mathematics 2009-10-30 Weiqiang Wang

This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…

Combinatorics · Mathematics 2007-05-23 Howard Kleiman

In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable…

Commutative Algebra · Mathematics 2015-08-31 Jürgen Herzog , Ahad Rahimi

Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…

Functional Analysis · Mathematics 2008-06-03 Hamed Hatami

In this paper we study differentiability properties of the map $T\mapsto\phi(T)$, where $\phi$ is a given function in the disk-algebra and $T$ ranges over the set of contractions on Hilbert space. We obtain sharp conditions (in terms of…

Functional Analysis · Mathematics 2008-05-29 V. V. Peller

We introduce a characterization for split graphs by using edge contraction. Then, we use it to prove that any ($2K_{2}$, claw)-free graph with $\alpha(G) \geq 3$ is a split graph. Also, we apply it to characterize any pseudo-split graph.…

Combinatorics · Mathematics 2022-05-05 Hany Ibrahim

The main result of this paper states, that if a function $f:\R^2\to [0, +\infty)$ has a closed graph and the set of discontinuity points is a network (as defined by Kuratowski in Topology II, 61.IV), then the graph of $f$ is disconnected.…

General Topology · Mathematics 2013-07-17 Michal Stanislaw Wojcik

We investigate the computational complexity of separating two distinct vertices s and z by vertex deletion in a temporal graph. In a temporal graph, the vertex set is fixed but the edges have (discrete) time labels. Since the corresponding…

Computational Complexity · Computer Science 2020-10-12 Till Fluschnik , Hendrik Molter , Rolf Niedermeier , Malte Renken , Philipp Zschoche

Let $G$ be a finite group. For $x \in G$, we define the solvabilizer of $x$ in $G$, denoted $sol_G(x)$, to be the set $\{g \in G \mid \langle g,x \rangle$ is solvable$\}$. A group $G$ is an S-group if $sol_G(x)$ is a subgroup of $G$ for…

Group Theory · Mathematics 2013-07-12 Doron Hai-Reuven

This paper concerns the quasilinear subelliptic function derived from H\"ormander vector fields. Based on the significant work of J. Serrin in \cite{SER}, M. Meier in \cite{MM1}, and L. Capogna, D. Danielli and N. Garofalo in…

Analysis of PDEs · Mathematics 2025-10-02 Jiayi Qiang , Yawei Wei , Mengnan Zhang

We study the following question: how few edges can we delete from any $H$-free graph on $n$ vertices in order to make the resulting graph $k$-colorable? It turns out that various classical problems in extremal graph theory are special cases…

Combinatorics · Mathematics 2021-03-23 Jacob Fox , Zoe Himwich , Nitya Mani

We construct an example showing that the solution map of the Euler equations is not continuous in the H\"older space from $C^{1,\alpha}$ to $L^\infty_tC^{1,\alpha}_x$ for any $0<\alpha<1$. On the other hand we show that it is continuous…

Analysis of PDEs · Mathematics 2017-04-28 Gerard Misiołek , Tsuyoshi Yoneda

A fork is a graph obtained from $K_{1,3}$ (usually called claw) by subdividing an edge once. A graph is perfectly divisible if for each of its induced subgraph $H$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and…

Combinatorics · Mathematics 2025-04-23 Baogang Xu , Miaoxia Zhuang

Let $L^{m,p}(\R^n)$ be the Sobolev space of functions with $m^{th}$ derivatives lying in $L^p(\R^n)$. Assume that $n< p < \infty$. For $E \subset \R^n$, let $L^{m,p}(E)$ denote the space of restrictions to $E$ of functions in…

Classical Analysis and ODEs · Mathematics 2012-05-22 Charles L. Fefferman , Arie Israel , Garving K. Luli

Let $M^{(u)}$, $H^{(u)}$ be the maximal operator and Hilbert transform along the parabola $(t, ut^2) $. For $U\subset(0,\infty)$ we consider $L^p$ estimates for the maximal functions $\sup_{u\in U}|M^{(u)} f|$ and $\sup_{u\in U}|H^{(u)}…

Classical Analysis and ODEs · Mathematics 2020-04-17 Shaoming Guo , Joris Roos , Andreas Seeger , Po-Lam Yung

It is well-known that the problem of sampling recovery in the $L_2$-norm on unweighted Korobov spaces (Sobolev spaces with mixed smoothness) as well as classical smoothness classes such as H\"older classes suffers from the curse of…

Numerical Analysis · Mathematics 2024-02-26 David Krieg

We consider a continuous function $f$ on a domain in $\mathbf C^n$ satisfying the inequality that $|\bar \partial f|\leq |f|$ off its zero set. The main conclusion is that the zero set of $f$ is a complex variety. We also obtain removable…

Complex Variables · Mathematics 2007-08-14 Xianghong Gong , Jean-Pierre Rosay

We show that wave maps from Minkowski space $R^{1+n}$ to a sphere are globally smooth if the initial data is smooth and has small norm in the critical Sobolev space $\dot H^{n/2}$ in the high dimensional case $n \geq 5$. A major difficulty,…

Analysis of PDEs · Mathematics 2007-05-23 Terence Tao

For an integer $\ell\geq 2$, let ${\cal{H}}_{\ell}$ denote the family of graphs which have girth $2\ell$ and have no even hole of length greater than $2\ell$. Wu, Xu and Xu conjectured that every graph in $\bigcup_{\ell\geq 2}…

Combinatorics · Mathematics 2026-05-28 Yan Wang , Rong Wu