相关论文: A flower theorem in $\mathbb{C}^n$

We use the technology of linking groupoids to show that equivalent groupoids have Morita equivalent reduced C*-algebras. This equivalence is compatible in a natural way in with the Equivalence Theorem for full groupoid C*-algebras.

Let $\Omega\subset\mathbb{C}^n$, $n\geq 2$, be a domain with smooth connected boundary. If $\Omega$ is relatively compact, the Hartogs-Bochner theorem ensures that every CR distribution on $\partial\Omega$ has a holomorphic extension to…

The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…

Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line…

We prove the existence of regular foliations with a prescribed tangency divisor in neighborhoods of negatively embedded holomorphic curves; this is related to a linearization theorem due to Grauert. We give also examples of neighborhoods…

The C-Planarity problem asks for a drawing of a $\textit{clustered graph}$, i.e., a graph whose vertices belong to properly nested clusters, in which each cluster is represented by a simple closed region with no edge-edge crossings, no…

We develop an analog of the notion of a character variety in the context of algebraic correspondences. It turns out that matings of certain Fuchsian groups and polynomials are contained in this ambient character variety. This gives rise to…

In this paper we prove another pairing theorem for bordered Floer homology. Unlike the original pairing theorem, this one is stated in terms of homomorphisms, not tensor products. The present formulation is closer in spirit to the usual…

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…

We prove existence, non-degeneracy, and exponential decay at infinity of a non-trivial solution to Emden's equation $-\Delta u = | u |^3$ on an unbounded $L$-shaped domain, subject to Dirichlet boundary conditions. Besides the direct value…

The 2-Decomposition Conjecture, equivalent to the 3-Decomposition Conjecture stated in 2011 by Hoffmann-Ostenhof, claims that every connected graph $G$ with vertices of degree 2 and 3, for which $G \setminus E(C)$ is disconnected for every…

We show a stability-type theorem for foliations on projective spaces which arise as pullbacks of foliations with a split tangent sheaf on weighted projective spaces. As a consequence, we will be able to construct many irreducible components…

For a commutative ring $R$ with a unit, an $R$-homology rose is a topological space whose homology groups with $R$-coefficients agree with those of a bouquet of cirlces. In this paper, we study some special properties of covering spaces and…

We define a special type of hypersurface varieties inside $\mathbb{P}_k^{n-1}$ arising from connected planar graphs and then find their equivalence classes inside the Gr\"othendieck ring of projective varieties. Then we find a…

The famous Dirac's Theorem gives an exact bound on the minimum degree of an $n$-vertex graph guaranteeing the existence of a hamiltonian cycle. We prove exact bounds of similar type for hamiltonian Berge cycles in $r$-uniform, $n$-vertex…

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

We prove a new quantitative result on the degeneracy of the dimension of the subspace spanned by the best Diophantine approximations for a linear form.

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

If Gamma is any finite graph, then the unlabelled configuration space of n points on Gamma, denoted UC^n(Gamma), is the space of n-element subsets of Gamma. The braid group of Gamma on n strands is the fundamental group of UC^n(Gamma). We…