Related papers: A greedy maximal sweepline algorithm for a Jordan …
We determine the maximal number of smooth rational degree d curves on a complex K3-surface of degree 2n provided n is sufficiently large as compared to d>1. We obtain precise characterization of configurations of rational degree d curves…
We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applications, each edge in a network is associated with a certain…
We propose a new yet natural algorithm for learning the graph structure of general discrete graphical models (a.k.a. Markov random fields) from samples. Our algorithm finds the neighborhood of a node by sequentially adding nodes that…
In Nature Machine Intelligence 4, 367 (2022), Schuetz et al provide a scheme to employ graph neural networks (GNN) as a heuristic to solve a variety of classical, NP-hard combinatorial optimization problems. It describes how the network is…
First we give a sharp upper bound for the cardinal $m$ of a minimal set of generators for the module of Jacobian syzygies of a complex projective reduced plane curve $C$. Next we discuss the sharpness of an upper bound, given by A. du…
We present various new results on greedoids. We prove a theorem that generalizes an equivalent formulation of Edmonds' classic matroid polytope theorem to local forest greedoids -- a class of greedoids that contains matroids as well as…
We study the asymptotics of the set $S(d)$ of possible prime orders of $K$-rational points on elliptic curves over number fields $K$ of degree $d$ as $d$ tends to infinity. Assuming some conjectures on the sparsity of newforms of weight $2$…
The greedy algorithm for monotone submodular function maximization subject to cardinality constraint is guaranteed to approximate the optimal solution to within a $1-1/e$ factor. Although it is well known that this guarantee is essentially…
The main goal of this article is to give an explicit rigid analytic uniformization of the maximal toric quotient of the Jacobian of a Shimura curve over the field of rational numbers at a prime dividing exactly the level. This result can be…
This paper presents the results of an experimental study of graph partitioning. We describe a new heuristic technique, path optimization, and its application to two variations of graph partitioning: the max_cut problem and the…
Let $J$ be a simple closed curve in $\mathbb R^{k}$ $(k\geq2)$ that is differentiable with non-zero derivative at a point $A_0\in J$. For a tuple of positive reals $a_1,\cdots,a_n$ $(n\geq3)$, each of which is less than the sum of the…
The goal of this article is to give a positive answer to Rockafellar's maximality of the sum conjecture in the linear multi-valued operator case.
We derive new results for the performance of a simple greedy algorithm for finding large independent sets and matchings in constant degree regular graphs. We show that for $r$-regular graphs with $n$ nodes and girth at least $g$, the…
We address the question of what is the correct higher dimensional analogue of Jordan curves from the point of view of quantitative rectifiability. More precisely, we show that 'topologically stable' sets can be used as covering objects in…
Let $\Gamma$ be a $C^{2+}$ Jordan arc and let $\Gamma_0$ be the open arc which consists of interior points of $\Gamma$. We find concrete upper and lower bounds for the limit of Widom factors for $L_2(\mu)$ extremal polynomials on $\Gamma$…
We investigate online maximum cardinality matching, a central problem in ad allocation. In this problem, users are revealed sequentially, and each new user can be paired with any previously unmatched campaign that it is compatible with.…
The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis. Existing approaches include exact algorithms with exponential runtimes,…
We prove two "large images" results for the Galois representations attached to a degree $d$ Q-curve $E$ over a quadratic field $K$: if $K$ is arbitrary, we prove maximality of the image for every prime $p >13$ not dividing $d$, provided…
The problem of column subset selection has recently attracted a large body of research, with feature selection serving as one obvious and important application. Among the techniques that have been applied to solve this problem, the greedy…