English
Related papers

Related papers: An enriched degree of the Wronski

200 papers

We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…

Geometric Topology · Mathematics 2025-05-27 Michal Jablonowski

Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…

Computational Complexity · Computer Science 2017-12-27 Grzegorz Guśpiel

We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…

alg-geom · Mathematics 2025-10-20 Birkett Huber , Frank Sottile , Bernd Sturmfels

This manuscript recounts some of the author's contributions to algebraic and enumerative combinatorics. We have focused on two types of generalizations of bipartite maps, which are bipartite graphs embedded on surfaces. Maps are known to…

Combinatorics · Mathematics 2023-02-14 Valentin Bonzom

Witten's top Chern class is a particular cohomology class on the moduli space of Riemann surfaces endowed with r-spin structures. It plays a key role in Witten's conjecture relating to the intersection theory on these moduli spaces. Our…

Algebraic Geometry · Mathematics 2014-11-11 Sergei Shadrin , Dimitri Zvonkine

Consider the following problem: Given a planar graph $G$, what is the maximum number $p$ such that $G$ has a planar straight-line drawing with $p$ collinear vertices? This problem resides at the core of several graph drawing problems,…

Computational Geometry · Computer Science 2016-09-01 Giordano Da Lozzo , Vida Dujmovic , Fabrizio Frati , Tamara Mchedlidze , Vincenzo Roselli

We obtain the Weierstrass-Enneper representation for maximal graphs(whose Gauss map is one-one) in Lorentz-Minkowski space. For this we use the method of Barbishov and Chernikov, which they have used to find the solutions of Born-Infeld…

Differential Geometry · Mathematics 2017-03-16 Rahul Kumar Singh

This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are…

Combinatorics · Mathematics 2007-05-23 J. H. Conway , R. H. Hardin , N. J. A. Sloane

The goal of this very short note is to give a new proof of Faber's formula for the socle intersection numbers in the tautological ring of $\mathcal{M}_g$. This new proof exhibits a new beautiful tautological relation that stems from the…

Algebraic Geometry · Mathematics 2026-03-13 Xavier Blot , Sergey Shadrin , Ishan Jaztar Singh

We give a refinement of the Kronecker-Hurwitz class number relation, based on a tesselation of the Euclidean plane into semi-infinite triangles labeled by $PSL_2(\mathbb{Z})$ that may be of independent interest.

Number Theory · Mathematics 2016-04-12 Alexandru A. Popa , Don Zagier

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

Research about crossings is typically about minimization. In this paper, we consider \emph{maximizing} the number of crossings over all possible ways to draw a given graph in the plane. Alpert et al. [Electron. J. Combin., 2009] conjectured…

Computational Geometry · Computer Science 2017-05-16 Markus Chimani , Stefan Felsner , Stephen Kobourov , Torsten Ueckerdt , Pavel Valtr , Alexander Wolff

We discover that tautological intersection numbers on $\bar{\mathcal{M}}_{g, n}$, the moduli space of stable genus $g$ curves with $n$ marked points, are evaluations of Ehrhart polynomials of partial polytopal complexes. In order to prove…

Algebraic Geometry · Mathematics 2022-09-29 Adam Afandi

In this paper, the $mn$-dimensional space of tensor-product polynomials of two variables, of degree at most $(m-1)+(n-1)$, is considered. A theory of two-variate polynomials is developed by establishing the algebra and basic algebraic…

General Mathematics · Mathematics 2017-12-29 Dharm Prakash Singh , Amit Ujlayan

This paper studies increasing trees on $n$ labeled vertices, in which labels increase from the root to the leaves. It is known that the number of binary increasing trees coincides with the number of alternating permutations (Euler numbers).…

Combinatorics · Mathematics 2026-01-13 Medet Jumadildayev

We consider the following problem: Let $\mathcal{L}$ be an arrangement of $n$ lines in $\mathbb{R}^3$ colored red, green, and blue. Does there exist a vertical plane $P$ such that a line on $P$ simultaneously bisects all three classes of…

Computational Geometry · Computer Science 2019-09-11 Alexander Pilz , Patrick Schnider

In 2023 in (3), Uwe finds the explicit form of the map which is which is settled in ZN of finite functional degree and14 discusses how to compute its usual degree w.r.t to the derivative in the linear form, i.e. the product of ones formed…

General Mathematics · Mathematics 2025-03-27 Yunting Iris Gao

The classical Bertini theorem on generic intersection of an algebraic set with hyperplanes states the following: \emph{Let X be a nonsingular closed subvariety of $\mathbb{P}^n_k$, where $k$ is an algebraically closed field. Then there…

Algebraic Geometry · Mathematics 2021-06-22 Tomasz Rodak , Adam Różycki , Stanisław Spodzieja

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

Combinatorics · Mathematics 2025-09-03 Rutger Campbell , Matthew E. Kroeker , Ben Lund

How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…

Combinatorics · Mathematics 2007-07-16 N. J. A. Sloane
‹ Prev 1 8 9 10 Next ›