English
Related papers

Related papers: An Algorithm for Fat Points on P2

200 papers

This paper presents an algorithm for calculation of the Lyubeznik numbers of a local ring which is a homomorphic image of a regular local ring $R$ of prime characteristic. The methods used employ Lyubeznik's $F$-modules over $R$,…

Commutative Algebra · Mathematics 2022-04-06 Mordechai Katzman , Rodney Y. Sharp

We study the annihilator of the cokernel of a map of free Z/2-graded modules over a Z/2-graded skew-commutative algebra in characteristic 0 and define analogues of its Fitting ideals. We show that in the ``generic'' case the annihilator is…

Algebraic Geometry · Mathematics 2007-05-23 David Eisenbud , Jerzy Weyman

For an odd prime $p$ and a number field $F$ containing a $p$th root of unity, we study generalised Tate kernels, $D_F^{[i,n]}$, for $i\in \mathbb{Z}$ and $n\geq 1$, having the properties that if $i\geq 2$ and if either $p$ does not divide…

Number Theory · Mathematics 2017-09-20 Kevin Hutchinson

Let $R=k[x_1,..., x_n]$ be a polynomial ring over a field $k$ of characteristic $p>0,$ let $\m=(x_1,..., x_n)$ be the maximal ideal generated by the variables, let $^*E$ be the naturally graded injective hull of $R/\m$ and let $^*E(n)$ be…

Commutative Algebra · Mathematics 2014-02-26 Yi Zhang

We study the metric Steiner tree problem in the sublinear query model. In this problem, for a set of $n$ points $V$ in a metric space given to us by means of query access to an $n\times n$ matrix $w$, and a set of terminals $T\subseteq V$,…

Data Structures and Algorithms · Computer Science 2024-11-15 Sepideh Mahabadi , Mohammad Roghani , Jakub Tarnawski , Ali Vakilian

We prove a conjecture by F. Ferrari. Let X be the total space of a nonlinear deformation of a rank 2 holomorphic vector bundle on a smooth rational curve, such that X has trivial canonical bundle and has sections. Then the normal bundle to…

Mathematical Physics · Physics 2009-11-11 U. Bruzzo , A. Ricco

Permutation products and their various "fat diagonal" subspaces are studied from the topological and geometric point of view. We describe in detail the stabilizer and orbit stratifications related to the permutation action, producing a…

Algebraic Topology · Mathematics 2012-09-17 Sadok Kallel , Walid Taamallah

We assume that $\mathcal{E}$ is a rank $r$ Ulrich bundle for $(P^n, \mathcal{O}(d))$. The main result of this paper is that $\mathcal{E}(i)\otimes \Omega^{j}(j)$ has natural cohomology for any integers $i \in \mathbb{Z}$ and $0 \leq j \leq…

Algebraic Geometry · Mathematics 2017-03-21 Zhiming Lin

We consider the algebraization problem for principal bundles with reductive structure group, defined on the complement of a closed subset Z in a proper formal scheme. We show that, when Z is of codimension at least 3, an algebraization…

Algebraic Geometry · Mathematics 2008-03-07 Vladimir Baranovsky

This paper is a sequel to \cite{Xu}. In this paper, an estimation of the Bergman Kernel of K\"ahler hyperbolic manifold is given by the $L^2$ estimate and the Bochner formula. As an application, an effective criterion of the very ampleness…

Complex Variables · Mathematics 2013-07-16 Xu Wang

We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM algorithm with a Hensel lifting strategy. In analogy with Hensel lifting, we show that…

Symbolic Computation · Computer Science 2024-09-20 Jérémy Berthomieu , Rafael Mohr

We consider a planar graph $G$ in which the edges have nonnegative integer lengths such that the length of every cycle of $G$ is even, and three faces are distinguished, called holes in $G$. It is known that there exists a packing of cuts…

Combinatorics · Mathematics 2018-03-20 Alexander V. Karzanov

For each positive prime integer $p$ we construct a standard graded $F$-rational ring $R$, over a field $K$ of characteristic $p$, such that $R\otimes_K\overline{K}$ is not $F$-rational. By localizing we obtain a flat local homomorphism $(R,…

Commutative Algebra · Mathematics 2024-06-04 Eamon Quinlan-Gallego , Austyn Simpson , Anurag K. Singh

It has been observed in many places that constant-factor approximable problems often admit polynomial or even linear problem kernels for their decision versions, e.g., Vertex Cover, Feedback Vertex Set, and Triangle Packing. While there…

Computational Complexity · Computer Science 2015-03-13 Stefan Kratsch

Kernel methods are a highly effective and widely used collection of modern machine learning algorithms. A fundamental limitation of virtually all such methods are computations involving the kernel matrix that naively scale quadratically…

Machine Learning · Computer Science 2021-06-09 John Paul Ryan , Sebastian Ament , Carla P. Gomes , Anil Damle

Meta-kernelization theorems are general results that provide polynomial kernels for large classes of parameterized problems. The known meta-kernelization theorems, in particular the results of Bodlaender et al. (FOCS'09) and of Fomin et al.…

Data Structures and Algorithms · Computer Science 2013-04-22 Robert Ganian , Friedrich Slivovsky , Stefan Szeider

The Firefighting problem is defined as follows. At time $t=0$, a fire breaks out at a vertex of a graph. At each time step $t \geq 0$, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all…

Data Structures and Algorithms · Computer Science 2017-11-29 Bireswar Das , Murali Krishna Enduri , Neeldhara Misra , I. Vinod Reddy

In this article, we investigate alternative construction of Fitting ideals of pushforward modules $f_*\mathcal{O}_{X,0}$ for finite and holomorphic map-germs from an $n$-dimensional Cohen-Macaulay space $(X,0)$ to $(\mathbb{C}^{n+1},0)$.…

Commutative Algebra · Mathematics 2025-01-22 Ayse Sharland , Jacob Smith

Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…

Computational Geometry · Computer Science 2019-09-27 Sándor Kisfaludi-Bak , Dániel Marx , Tom C. van der Zanden

We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…

Numerical Analysis · Mathematics 2008-07-10 Joerg Kampen