相关论文: 38406501359372282063949 & all that: Monodromy of F…
We introduce the notion of cracked polytope, and - making use of joint work with Coates and Kasprzyk - construct the associated toric variety $X$ as a subvariety of a non-singular toric variety $Y$ under certain conditions. Restricting to…
We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…
In this article we study domino snake problems on finitely generated groups. We provide general properties of these problems and introduce new tools for their study. The first is the use of symbolic dynamics to understand the set of all…
If $x$ is a non-empty string then the repetition $xx$ is called a tandem repeat. Similarly, a tandem in a two dimensional array $X$ is a configuration consisting of a same primitive block $W$ that touch each other with one side or corner.…
We obtain bounds on the least dimension of an affine space that can contain an $n$-dimensional submanifold without any pairs of parallel or intersecting tangent lines at distinct points. This problem is closely related to the generalized…
Given a generic family $Q$ of 2-dimensional quadrics over a smooth 3-dimensional base $Y$ we consider the relative Fano scheme $M$ of lines of it. The scheme $M$ has a structure of a generically conic bundle $M \to X$ over a double covering…
For a finite group $G$, we obtain asymptotics for the number of connected components of Hurwitz spaces of marked $G$-covers (of both the affine and projective lines) whose monodromy classes are constrained in a certain way, when the number…
Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges…
We give a necessary and sufficient condition for the nonsingular projective toric variety associated to the graph cubeahedron of a finite simple graph to be Fano or weak Fano in terms of the graph.
We consider the space of smooth complex projective plane curves of degree d. Defined over this is the tautological family of plane curves, and hence there is a monodromy representation into the mapping class group of the fiber. We show two…
In this paper we deal with branched coverings over the complement to finitely many exceptional points on the Riemann sphere having the property that the local monodromy around each of the branching points is of finite order. To such a…
We construct well-formed and quasismooth terminal Fano 4-folds of index 1 in low codimension containing at worst isolated orbifold points. We provide a certain classification of these varieties where their images under the anitcanonical…
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…
The Fano lineshape arises from the interference of two excitation pathways to reach a continuum. Its generality has resulted in a tremendous success in explaining the lineshapes of many one-dimensional spectroscopies - absorption, emission,…
In a \emph{fan-planar drawing} of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who proved that every $n$-vertex fan-planar drawing has at most…
The finite strain theory is reformulated in the frame of the Tangential Differential Calculus (TDC) resulting in a unification in a threefold sense. Firstly, ropes, membranes and three-dimensional continua are treated with one set of…
We characterize the birational geometry of some hyperk\"ahler fourfolds of Picard rank $3$ obtained as the Fano varieties of lines on cubic fourfolds containing pairs of cubic scrolls. In each of the two cases considered, we identify all of…
A dominating set of a graph is a set of vertices such that every vertex not in the set has at least one neighbor in the set. The problem of counting dominating sets is #P-complete for chordal graphs but solvable in polynomial time for its…
In arXiv:1503.00125, the authors proved that every complete intersection smooth projective variety $Y$ is a Fano visitor, i.e. its derived category $D^b(Y)$ is equivalent to a full triangulated subcategory of the derived category $D^b(X)$…
We provide examples of smooth three-dimensional Fano complete intersections of dergee 2, 4, 6, and 8 that have coregularity 0. Considering the main theorem of arXiv:2309.16784 on the remaining 101 families of smooth Fano threefolds, our…