Related papers: Addition-deletion results for plus-one generated c…
We bound the number of fixed points of an automorphism of a real curve in terms of the genus and the number of connected components of the real part of the curve. Using this bound, we derive some consequences concerning the maximum order of…
This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The method is based on adding group structure to classes of…
In this paper, we study $\mathbb{A}^1$-connected varieties from log geometry point of view, and prove a criterion for $\mathbb{A}^1$-connectedness. As applications, we provide many interesting examples of $\mathbb{A}^1$-connected varieties…
We study line patterns in a free group by considering the topology of the decomposition space, a quotient of the boundary at infinity of the free group related to the line pattern. We show that the group of quasi-isometries preserving a…
Menger's Edge Theorem asserts that there exist $k$ pairwise edge-disjoint paths between two vertices in an undirected graph if and only if a deletion of any $k-1$ or less edges does not disconnect these two vertices. Alternatively, there…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…
We show that we can obtain a reducible spherical curve from any non-trivial spherical curve by four or less inverse-half-twisted splices, i.e., the reductivity, which represents how reduced a spherical curve is, is four or less. We also…
Grid peeling is the process of repeatedly removing the convex hull vertices of the grid-points that lie inside a given convex curve. It has been conjectured that, for a more and more refined grid, grid peeling converges to a continuous…
A uniform bound of intersection multiplicities of curves and divisors on abelian varieties is proved by algebraic geometric methods. It extends and improves a result obtained by A. Buium with a different method based on Kolchin's…
"Theorems for Free!" (Wadler, FPCA 1989) is a slogan for a technique that allows to derive statements about functions just from their types. So far, the statements considered have always had a purely extensional flavor: statements relating…
We present the technique of derivation of a theory to obtain an $(n+1)f$-degrees-of-freedom theory from an $f$-degrees-of-freedom theory and show that one can calculate all of the quantities of the derived theory from those of the original…
In this note we make use of some properties of vector fields on a manifold to give an alternate proof to [3] for the equivalence between connections and parallel transport on vector bundles over manifolds. Out of the proof will emerge a new…
We prove that every curve on a rationally connected variety is algebraically equivalent to a (non-effective) integral sum of rational curves.
Given a morphism between smooth projective varieties $f: W \to X$, we study whether $f$-relatively free rational curves imply the existence of $f$-relatively very free rational curves. The answer is shown to be positive when the fibers of…
Recent machine learning techniques can be modified to produce creative results. Those results did not exist before; it is not a trivial combination of the data which was fed into the machine learning system. The obtained results come in…
This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…
Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…
We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…
In order to find Hamiltonian cycle, algorithm should find edges that creates a Hamiltonian cycle. Higher number of edges creates more possibilities to check to solve the problem. Algorithm rests on analysis of original graph and opposite…
We study the classes of free and plus-one generated hyperplane arrangements. Specifically, we describe how to compute the associated prime ideals of the Jacobian ideal of such an arrangement from its lattice of intersection. Moreover, we…