Complete pluripolar curves and graphs

Tomas Edlund

Displaying similar documents to “Complete pluripolar curves and graphs”

Edit distance measure for graphs

Tomasz Dzido, Krzysztof Krzywdziński (2015)

Czechoslovak Mathematical Journal

Similarity:

In this paper, we investigate a measure of similarity of graphs similar to the Ramsey number. We present values and bounds for $g (n, l)$ , the biggest number $k$ guaranteeing that there exist $l$ graphs on $n$ vertices, each two having edit distance at least $k$ . By edit distance of two graphs $G$ , $F$ we mean the number of edges needed to be added to or deleted from graph $G$ to obtain graph $F$ . This new extremal number $g (n, l)$ is closely linked to the edit distance of graphs. Using probabilistic methods we show...

Intrinsic linking and knotting are arbitrarily complex

Erica Flapan, Blake Mellor, Ramin Naimi (2008)

Fundamenta Mathematicae

Similarity:

We show that, given any n and α, any embedding of any sufficiently large complete graph in ℝ³ contains an oriented link with components Q₁, ..., Qₙ such that for every i ≠ j, $| l k (Q_{i}, Q_{j}) | \geq α$ and $| a ₂ (Q_{i}) | \geq α$ , where $a ₂ (Q_{i})$ denotes the second coefficient of the Conway polynomial of $Q_{i}$ .

Remarks on $D$ -integral complete multipartite graphs

Pavel Híc, Milan Pokorný (2016)

Czechoslovak Mathematical Journal

Similarity:

A graph is called distance integral (or $D$ -integral) if all eigenvalues of its distance matrix are integers. In their study of $D$ -integral complete multipartite graphs, Yang and Wang (2015) posed two questions on the existence of such graphs. We resolve these questions and present some further results on $D$ -integral complete multipartite graphs. We give the first known distance integral complete multipartite graphs $K_{p_{1}, p_{2}, p_{3}}$ with $p_{1} < p_{2} < p_{3}$ , and $K_{p_{1}, p_{2}, p_{3}, p_{4}}$ with $p_{1} < p_{2} < p_{3} < p_{4}$ , as well as the infinite classes of distance integral...

Rational points on $X_{0}^{+} (p^{r})$

Yuri Bilu, Pierre Parent, Marusia Rebolledo (2013)

Annales de l’institut Fourier

Similarity:

Using the recent isogeny bounds due to Gaudron and Rémond we obtain the triviality of $X_{0}^{+} (p^{r}) (ℚ)$ , for $r > 1$ and $p$ a prime number exceeding $2 \cdot 10^{11}$ . This includes the case of the curves $X_{split} (p)$ . We then prove, with the help of computer calculations, that the same holds true for $p$ in the range $11 \leq p \leq 10^{14}$ , $p \neq 13$ . The combination of those results completes the qualitative study of rational points on $X_{0}^{+} (p^{r})$ undertook in our previous work, with the only exception of $p^{r} = 13^{2}$ .

Complete pluripolar graphs in $ℂ^{N}$

Nguyen Quang Dieu, Phung Van Manh (2014)

Annales Polonici Mathematici

Similarity:

Let F be the Cartesian product of N closed sets in ℂ. We prove that there exists a function g which is continuous on F and holomorphic on the interior of F such that $Γ_{g} (F) : = (z, g (z)) : z \in F$ is complete pluripolar in $ℂ^{N + 1}$ . Using this result, we show that if D is an analytic polyhedron then there exists a bounded holomorphic function g such that $Γ_{g} (D)$ is complete pluripolar in $ℂ^{N + 1}$ . These results are high-dimensional analogs of the previous ones due to Edlund [Complete pluripolar curves and graphs, Ann. Polon. Math....

Embedding products of graphs into Euclidean spaces

Mikhail Skopenkov (2003)

Fundamenta Mathematicae

Similarity:

For any collection of graphs $G ₁, . . ., G_{N}$ we find the minimal dimension d such that the product $G ₁ \times . . . \times G_{N}$ is embeddable into $ℝ^{d}$ (see Theorem 1 below). In particular, we prove that (K₅)ⁿ and $(K_{3, 3}) ⁿ$ are not embeddable into $ℝ^{2 n}$ , where K₅ and $K_{3, 3}$ are the Kuratowski graphs. This is a solution of a problem of Menger from 1929. The idea of the proof is a reduction to a problem from so-called Ramsey link theory: we show that any embedding $L k O \to S^{2 n - 1}$ , where O is a vertex of (K₅)ⁿ, has a pair of linked (n-1)-spheres.

Frobenius nonclassicality with respect to linear systems of curves of arbitrary degree

Nazar Arakelian, Herivelto Borges (2015)

Acta Arithmetica

Similarity:

For each integer s ≥ 1, we present a family of curves that are $_{q}$ -Frobenius nonclassical with respect to the linear system of plane curves of degree s. In the case s=2, we give necessary and sufficient conditions for such curves to be $_{q}$ -Frobenius nonclassical with respect to the linear system of conics. In the $_{q}$ -Frobenius nonclassical cases, we determine the exact number of $_{q}$ -rational points. In the remaining cases, an upper bound for the number of $_{q}$ -rational points will follow from Stöhr-Voloch...

On ramified covers of the projective plane II: Generalizing Segre’s theory

Michael Friedman, Rebecca Lehman, Maxim Leyenson, Mina Teicher (2012)

Journal of the European Mathematical Society

Similarity:

The classical Segre theory gives a necessary and sufficient condition for a plane curve to be a branch curve of a (generic) projection of a smooth surface in $ℙ^{3}$ . We generalize this result for smooth surfaces in a projective space of any dimension in the following way: given two plane curves, $B$ and $E$ , we give a necessary and sufficient condition for $B$ to be the branch curve of a surface $X$ in $ℙ^{N}$ and $E$ to be the image of the double curve of a $ℙ^{3}$ -model of $X$ . In the classical Segre theory, a...

On distinguishing and distinguishing chromatic numbers of hypercubes

Werner Klöckl (2008)

Discussiones Mathematicae Graph Theory

Similarity:

The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d colors that is not preserved by any nontrivial automorphism. The restriction to proper labelings leads to the definition of the distinguishing chromatic number $χ_{D} (G)$ of G. Extending these concepts to infinite graphs we prove that $D (Q_{ℵ} ₀) = 2$ and $χ_{D} (Q_{ℵ} ₀) = 3$ , where $Q_{ℵ} ₀$ denotes the hypercube of countable dimension. We also show that $χ_{D} (Q ₄) = 4$ , thereby completing the investigation of finite hypercubes with respect to $χ_{D}$ . Our...

Edge-colouring of graphs and hereditary graph properties

Samantha Dorfling, Tomáš Vetrík (2016)

Czechoslovak Mathematical Journal

Similarity:

Edge-colourings of graphs have been studied for decades. We study edge-colourings with respect to hereditary graph properties. For a graph $G$ , a hereditary graph property $𝒫$ and $l \geq 1$ we define $χ_{𝒫, l}^{'} (G)$ to be the minimum number of colours needed to properly colour the edges of $G$ , such that any subgraph of $G$ induced by edges coloured by (at most) $l$ colours is in $𝒫$ . We present a necessary and sufficient condition for the existence of $χ_{𝒫, l}^{'} (G)$ . We focus on edge-colourings of graphs with respect to the hereditary...

On invariants of elliptic curves on average

Amir Akbary, Adam Tyler Felix (2015)

Acta Arithmetica

Similarity:

We prove several results regarding some invariants of elliptic curves on average over the family of all elliptic curves inside a box of sides A and B. As an example, let E be an elliptic curve defined over ℚ and p be a prime of good reduction for E. Let $e_{E} (p)$ be the exponent of the group of rational points of the reduction modulo p of E over the finite field $_{p}$ . Let be the family of elliptic curves $E_{a, b} : y^{2} = x^{3} + a x + b$ , where |a| ≤ A and |b| ≤ B. We prove that, for any c > 1 and k∈ ℕ, $1 / | | \sum_{E \in} \sum_{p \leq x} e_{E}^{k} (p) = C_{k} l i (x^{k + 1}) + O ((x^{k + 1}) / {(l o g x)}^{c}$ )as x → ∞, as long...

A note on the independent domination number versus the domination number in bipartite graphs

Shaohui Wang, Bing Wei (2017)

Czechoslovak Mathematical Journal

Similarity:

Let $γ (G)$ and $i (G)$ be the domination number and the independent domination number of $G$ , respectively. Rad and Volkmann posted a conjecture that $i (G) / γ (G) \leq Δ (G) / 2$ for any graph $G$ , where $Δ (G)$ is its maximum degree (see N. J. Rad, L. Volkmann (2013)). In this work, we verify the conjecture for bipartite graphs. Several graph classes attaining the extremal bound and graphs containing odd cycles with the ratio larger than $Δ (G) / 2$ are provided as well.

The real symmetric matrices of odd order with a P-set of maximum size

Zhibin Du, Carlos M. da Fonseca (2016)

Czechoslovak Mathematical Journal

Similarity:

Suppose that $A$ is a real symmetric matrix of order $n$ . Denote by $m_{A} (0)$ the nullity of $A$ . For a nonempty subset $α$ of ${1, 2, ..., n}$ , let $A (α)$ be the principal submatrix of $A$ obtained from $A$ by deleting the rows and columns indexed by $α$ . When $m_{A (α)} (0) = m_{A} (0) + | α |$ , we call $α$ a P-set of $A$ . It is known that every P-set of $A$ contains at most $⌊ n / 2 ⌋$ elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As...

Generalized 3-edge-connectivity of Cartesian product graphs

Yuefang Sun (2015)

Czechoslovak Mathematical Journal

Similarity:

The generalized $k$ -connectivity $κ_{k} (G)$ of a graph $G$ was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized $k$ -edge-connectivity which is defined as $λ_{k} (G) = min {λ (S) : S \subseteq V (G)$ and $| S | = k}$ , where $λ (S)$ denotes the maximum number $ℓ$ of pairwise edge-disjoint trees $T_{1}, T_{2}, ..., T_{ℓ}$ in $G$ such that $S \subseteq V (T_{i})$ for $1 \leq i \leq ℓ$ . In this paper we prove that for any two connected graphs $G$ and $H$ we have $λ_{3} (G □ H) \geq λ_{3} (G) + λ_{3} (H)$ , where $G □ H$ is the Cartesian product of $G$ and $H$ . Moreover, the bound is sharp. We also...

Persistency in the Traveling Salesman Problem on Halin graphs

Vladimír Lacko (2000)

Discussiones Mathematicae Graph Theory

Similarity:

For the Traveling Salesman Problem (TSP) on Halin graphs with three types of cost functions: sum, bottleneck and balanced and with arbitrary real edge costs we compute in polynomial time the persistency partition $E_{A l l}$ , $E_{S o m e}$ , $E_{N o n e}$ of the edge set E, where: $E_{A l l}$ = e ∈ E, e belongs to all optimum solutions, $E_{N o n e}$ = e ∈ E, e does not belong to any optimum solution and $E_{S o m e}$ = e ∈ E, e belongs to some but not to all optimum solutions.

On covering and quasi-unsplit families of curves

Laurent Bonavero, Cinzia Casagrande, Stéphane Druel (2007)

Journal of the European Mathematical Society

Similarity:

Given a covering family $V$ of effective 1-cycles on a complex projective variety $X$ , we find conditions allowing one to construct a geometric quotient $q : X \to Y$ , with $q$ regular on the whole of $X$ , such that every fiber of $q$ is an equivalence class for the equivalence relation naturally defined by $V$ . Among other results, we show that on a normal and $ℚ$ -factorial projective variety $X$ with canonical singularities and $dim X \leq 4$ , every covering and quasi-unsplit family $V$ of rational curves generates a geometric...