Related papers: An Algorithm for Fat Points on P2

Let $\Gamma\subset \mathrm{SU}((2,1),\mathbb{C})$ be a torsion-free cocompact subgroup. Let $\mathbb{B}^{2}$ denote the $2$-dimensional complex ball endowed with the hyperbolic metric $\mu_{\mathrm{hyp}}$, and let…

We study the Fujita-type conjecture proposed by Popa and Schnell. We obtain an effective bound on the global generation of direct images of pluri-adjoint line bundles on the regular locus. We also obtain an effective bound on the generic…

We study criteria for deciding when the normal subgroup generated by a single polynomial automorphism of $\mathbb{A}^n$ is as large as possible, namely equal to the normal closure of the special linear group in the special automorphism…

In this paper we address the problem of computing $\text{deg}(f^n)$, the degrees of iterates of a birational map $f:\mathbb{P}^N\rightarrow\mathbb{P}^N$. For this goal, we develop a method based on two main ingredients: the factorization of…

Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instance of the same problem such that the size of the reduced…

We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex…

Let $G$ be the group scheme $\operatorname{SL}_{d+1}$ over $\mathbb{Z}$ and let $Q$ be the parabolic subgroup scheme corresponding to the simple roots $\alpha_{2},\cdots,\alpha_{d-1}$. Then $G/Q$ is the $\mathbb{Z} $-scheme of partial flags…

Let G be a semi simple linear algebraic group over a field of characteristic zero and let V be a finite dimensional irreducible G-module with highest weight vector v. Let P in G be the parabolic subgroup fixing v and let g=Lie(G). We get a…

We construct a stacky curve of genus $1/2$ (i.e., Euler characteristic $1$) over $\mathbb{Z}$ that has an $\mathbb{R}$-point and a $\mathbb{Z}_p$-point for every prime $p$ but no $\mathbb{Z}$-point. This is best possible: we also prove that…

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

In our previous papers [Far East Journal of Mathematical Sciences, 35 (2009), 211-223] and [International Journal of Pure and Applied Mathematics, 60 (2010), 15-24] we have developed the theory of Weil prolongation, Weil exponentiability…

This paper demonstrates that grokking behavior in modular arithmetic with a modulus P in a neural network can be controlled by modifying the profile of the activation function as well as the depth and width of the model. Plotting the even…

Let $X=G/P$ be a partial flag variety, where $G$ is a semi-simple, simply connected algebraic group defined over an algebraically closed field $K$ of positive characteristic. Let $\mathsf{F}\colon X\to X$ be the absolute Frobenius morphism.…

We study the defining equations of projective embeddings of the blowup of P^2 at a set of {d+1 \choose 2} number of points in generic position. To do this, we first generalize the notion of a matrix, its ideal of 2x2 minors to that of a…

We present a method of finding weighted Koppelman formulas for $(p,q)$-forms on $n$-dimensional complex manifolds $X$ which admit a vector bundle of rank $n$ over $X \times X$, such that the diagonal of $X \times X$ has a defining section.…

The fundamental matrix can be estimated from point matches. The current gold standard is to bootstrap the eight-point algorithm and two-view projective bundle adjustment. The eight-point algorithm first computes a simple linear least…

In this paper we use the Galois module structure for the classical parameterizing spaces for elementary p-abelian extensions of a field K to give necessary and sufficient conditions for the solvability of any embedding problem which is an…

Let p: Y--> X be a surjection between schemes projective over the algebraic closure of a finite field. Let L be a line bundle on X such that p^*(L) is globally generated. I give a natural necessary and sufficient condition under which some…

We show a kernel of at most $13k$ vertices for the Planar Feedback Vertex Set problem restricted to planar graphs, i.e., a polynomial-time algorithm that transforms an input instance $(G,k)$ to an equivalent instance with at most $13k$…

We consider the classical problem of the blowing-up of solutions of the nonlinear heat equation. We show that there exist infinitely many profiles around the blow-up point, and for each integer $k$, we construct a set of codimension $2k$ in…