10,742,125 research outputs found
On Parameterizations of plane rational curves and their syzygies
Let be a plane rational curve of degree and its normalization. We are interested in the splitting type of ,
where
gives the syzigies of the ideal , and
is a parameterization of . We want to describe in which
cases (, via a geometric description; namely we show
that if and only if is the projection of a rational curve
on a rational normal surface in .Comment: 12 Page
Exploiting -Closure in Kernelization Algorithms for Graph Problems
A graph is c-closed if every pair of vertices with at least c common
neighbors is adjacent. The c-closure of a graph G is the smallest number such
that G is c-closed. Fox et al. [ICALP '18] defined c-closure and investigated
it in the context of clique enumeration. We show that c-closure can be applied
in kernelization algorithms for several classic graph problems. We show that
Dominating Set admits a kernel of size k^O(c), that Induced Matching admits a
kernel with O(c^7*k^8) vertices, and that Irredundant Set admits a kernel with
O(c^(5/2)*k^3) vertices. Our kernelization exploits the fact that c-closed
graphs have polynomially-bounded Ramsey numbers, as we show
The support theorem for the complex Radon transform of distributions
The complex Radon transform of a rapidly decreasing distribution
is considered. A compact set
is called linearly convex if the set is a union of complex hyperplanes. Let denote the set of
complex hyperplanes which meet . The main result of the paper establishes
the conditions on a linearly convex compact under which the support theorem
for the complex Radon transform is true: from the relation it follows that is
compactly supported and .Comment: 8 page
- β¦