<?xml version="1.0" encoding="UTF-8"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>2007, Studia Mathematica 6</title>
<link href="http://hdl.handle.net/11716/5435" rel="alternate"/>
<subtitle/>
<id>http://hdl.handle.net/11716/5435</id>
<updated>2026-04-09T11:47:33Z</updated>
<dc:date>2026-04-09T11:47:33Z</dc:date>
<entry>
<title>11th International Conference on Functional Equations and Inequalities, Będlewo, September 17-23, 2006</title>
<link href="http://hdl.handle.net/11716/6845" rel="alternate"/>
<author>
<name>Chmieliński, Jacek</name>
</author>
<id>http://hdl.handle.net/11716/6845</id>
<updated>2020-02-17T09:37:59Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">11th International Conference on Functional Equations and Inequalities, Będlewo, September 17-23, 2006
Chmieliński, Jacek
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Boundary value problem and functional equations for overlapping disks</title>
<link href="http://hdl.handle.net/11716/6844" rel="alternate"/>
<author>
<name>Mityushev, Vladimir</name>
</author>
<id>http://hdl.handle.net/11716/6844</id>
<updated>2020-02-17T09:34:19Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">Boundary value problem and functional equations for overlapping disks
Mityushev, Vladimir
We compare applications of the method of functional equations to boundary value problem for circular multiply connected domains and to circular polygons generated by overlapping disks. The second part of the paper is devoted rather to the statement of a problem than its resolution.
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Randomly $C_n ∪ C_m$ graphs</title>
<link href="http://hdl.handle.net/11716/6843" rel="alternate"/>
<author>
<name>Híc, Pavel</name>
</author>
<author>
<name>Pokorný, Milan</name>
</author>
<id>http://hdl.handle.net/11716/6843</id>
<updated>2023-05-16T15:37:12Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">Randomly $C_n ∪ C_m$ graphs
Híc, Pavel; Pokorný, Milan
A graph G is said to be a randomly H graph if and only if any subgraph of G without isolated vertices, which is isomorphic to a subgraph of H, can be extended to a subgraph F of G such that F is isomorphic to H. In this paper the problem of randomly H graphs, where $H = C_n ∪ C_m, m ≠ n$, is discussed.
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Submaximal Riemann-Roch expected curves and symplectic packing</title>
<link href="http://hdl.handle.net/11716/6842" rel="alternate"/>
<author>
<name>Syzdek, Wioletta</name>
</author>
<id>http://hdl.handle.net/11716/6842</id>
<updated>2023-05-16T15:39:55Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">Submaximal Riemann-Roch expected curves and symplectic packing
Syzdek, Wioletta
We study Riemann–Roch expected curves on $P^1 × P^1$ in the context of the Nagata–Biran conjecture. This conjecture predicts that for a sufficiently large number of points multiple points Seshadri constants of an ample line bundle on algebraic surface are maximal. Biran gives an effective lower bound $N_0$ . We construct examples verifying to the effect that the assertions of the Nagata–Biran conjecture can not hold for small number of points. We discuss cases where our construction fails. We observe also that there exists a strong relation between Riemann–Roch expected curves on $P^1 × P^1$ and the symplectic packing problem. Biran relates the packing problem to the existence of solutions of certain Diophantine equations. We construct such solutions for any ample line bundle on $P^1 × P^1$ and a relatively small number of points. The solutions geometrically correspond to Riemann–Roch expected curves. Finally we discuss in how far the Biran number $N_0$ is optimal in the case of $P^1 × P^1$. In fact, we conjecture that it can be replaced by a lower number and we provide an evidence justifying this conjecture.
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
</feed>
