Related papers: Maximal skew sets of lines on a Hermitian surface …
In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specifically, using the columns of a parity check matrix of an…
This work presents novel algorithms for learning Bayesian network structures with bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed-integer linear programming formulations for structure…
In 1991 S{\o}rensen proposed a conjecture for the maximum number of points on the intersection of a surface of degree $d$ and a non-degenerate Hermitian surface in $\PP^3(\Fqt)$. The conjecture was proven to be true by Edoukou in the case…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We consider the problem of identifying a maximum clique in a given graph. We have proposed a mathematical model for this problem. The model resembles the matrix decomposition of the adjacency matrix of a given graph. The objective function…
We consider heights of horizontal irreducible divisors on an arithmetic surface with respect to some hermitian line bundle. We obtain both lower and upper bounds for these heights. The results are different and sometimes stronger that those…
We discuss sufficient conditions for a given curve to be covered by a maximal curve with the covering being unramified; it turns out that the given curve itself will be also maximal. We relate our main result to the question of whether or…
This paper unifies the theory of consistent-set maximization for robust outlier detection in a simultaneous localization and mapping framework. We first describe the notion of pairwise consistency before discussing how a consistency graph…
The purpose of this work is to pursue classification of geproci sets. Specifically we classify $[m,n]$-geproci sets which consist of $m=4$ points on each of $n$ skew lines, assuming the skew lines have two transversals in common. We show…
In this article we use the modular decomposition technique for exact solving the weighted maximum clique problem. Our algorithm takes the modular decomposition tree from the paper of Tedder et. al. and finds solution recursively. Also, we…
In the 90's Clark, Colbourn and Johnson wrote a seminal paper where they proved that maximum clique can be solved in polynomial time in unit disk graphs. Since then, the complexity of maximum clique in intersection graphs of d-dimensional…
In this paper, we consider tree decompositions, branch decompositions, and clique decompositions. We improve the running time of dynamic programming algorithms on these graph decompositions for a large number of problems as a function of…
We study the complexity of Maximum Clique in intersection graphs of convex objects in the plane. On the algorithmic side, we extend the polynomial-time algorithm for unit disks [Clark '90, Raghavan and Spinrad '03] to translates of any…
We prove an effective upper bound on the number of effective sections of a hermitian line bundle over an arithmetic surface. It is an effective version of the arithmetic Hilbert--Samuel formula in the nef case. As a consequence, we obtain…
We study the classic set cover problem from the perspective of sub-linear algorithms. Given access to a collection of $m$ sets over $n$ elements in the query model, we show that sub-linear algorithms derived from existing techniques have…
Over an infinite field $K$, we investigate the minimal free resolution of some configurations of lines. We explicitly describe the minimal free resolution of "complete grids of lines" and obtain an analogous result about the so-called…
A class of smoothing methods is proposed for solving mathematical programs with equimibrium constraints. We introduce new and very simple regularizations of the complementarity constraints. Some estimate distance to optimal solution and…
We wish to bring attention to a natural but slightly hidden problem, posed by Erd\H{o}s and Ne\v{s}et\v{r}il in the late 1980s, an edge version of the degree--diameter problem. Our main result is that, for any graph of maximum degree…
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…
Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact…