Searcharxiv⌕ Search

arXiv subjects

Janusz Adamus

Publications and source records attributed to Janusz Adamus.

27 records · Page 2Linked to original sources

On Nash approximation of complex analytic sets in Runge domains

We prove that every complex analytic set X in a Runge domain D can be approximated by Nash sets on relatively compact subdomains of D. We give a necessary and sufficient condition for a complex analytic set X to admit a Nash approximation which coincides with X along its given subsets.

math.CV↗

On the Meyniel condition for hamiltonicity in bipartite digraphs

We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For k greater than or equal to 2, a bipartite digraph D with colour classes of cardinalities k is hamiltonian if the sum of degrees of vertices u and v is at least 3k+1 for every pair of vertices u, v such that D does not contain the arc uv nor vu. As a consequence, we obtain a sharp sufficient condition for hamiltonicity in terms of the minimal degree: a balanced bipartite digraph D on 2k vertices is hamiltonian if its minimal degree is at least (3k + 1)/2.

math.CO↗

A degree condition for cycles of maximum length in bipartite digraphs

We prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite digraphs: A bipartite digraph D, with colour classes of cardinality N, is hamiltonian if, for every pair of vertices u and v from opposite colour classes of D such that the arc uv is not in D, the sum of the outdegree of u and the indegree of v is greater than or equal to N+2.

math.CO↗

An inductive analytic criterion for flatness

We present a constructive criterion for flatness of a morphism of analytic spaces X -> Y or, more generally, for flatness over Y of a coherent sheaf of modules on X. The criterion is a combination of a simple linear-algebra condition "in codimension zero" and a condition "in codimension one" which can be used together with the Weierstrass preparation theorem to inductively reduce the fibre dimension of the morphism.

math.AC↗

On the holomorphic closure dimension of real analytic sets

Given a real analytic (or, more generally, semianalytic) set R in the n-dimensional complex space, there is, for every point p in the closure of R, a unique smallest complex analytic germ X_p that contains the germ R_p. We call the complex dimension of X_p the holomorphic closure dimension of R at p. We show that the holomorphic closure dimension of an irreducible R is constant on the complement of a closed proper analytic subset of R, and discuss the relationship between this dimension and the CR dimension of R.

math.CV↗

A note on a degree sum condition for long cycles in graphs

We conjecture that a 2-connected graph $G$ of order $n$, in which $d(x)+d(y)\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$, contains a cycle of length $n-k$ ($k<n/2$), unless $G$ is bipartite and $n-k$ is odd. This generalizes to long cycles a well-known degree sum condition for hamiltonicity of Ore. The conjecture is shown to hold for $k=1$.

math.CO↗