Related papers: A Conic Section Problem Involving the Maximum Gene…
An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G and (ii) edge-weights on a complete undirected graph on the same vertex set. The objective is to find a subset of vertices satisfying some…
For a primal-dual pair of conic linear problems that are described by convex cones $S\subset X$, $T\subset Y$, bilinear symmetric objective functions $\langle\cdot,\cdot\rangle_X$, $\langle\cdot,\cdot\rangle_Y$ and a linear operator…
The strong geodetic problem on a graph $G$ is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of $G$ are covered. To do this as efficiently as possible, strong…
The generalized problem of moments is a conic linear optimization problem over the convex cone of positive Borel measures with given support. It has a large variety of applications, including global optimization of polynomials and rational…
In a graph $G=(V,E)$, a bisection $(X,Y)$ is a partition of $V$ into sets $X$ and $Y$ such that $|X|\le |Y|\le |X|+1$. The size of $(X,Y)$ is the number of edges between $X$ and $Y$. In the Max Bisection problem we are given a graph…
In a generalized Tur\'an problem, two graphs $H$ and $F$ are given and the question is the maximum number of copies of $H$ in an $F$-free graph of order $n$. In this paper, we study the number of double stars $S_{k,l}$ in triangle-free…
A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a…
The total angular resolution of a straight-line drawing is the minimum angle between two edges of the drawing. It combines two properties contributing to the readability of a drawing: the angular resolution, which is the minimum angle…
From Euclid's fundamental formula for the Pythagorean triples we define the rational triples relating certain congruent numbers by an identity and explore their relationships. We introduce two geometric methods relating the congruent number…
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of…
In this paper, we consider the maximum $k$-edge-colorable subgraph problem. In this problem we are given a graph $G$ and a positive integer $k$, the goal is to take $k$ matchings of $G$ such that their union contains maximum number of…
Conic optimization has recently emerged as a powerful tool for designing tractable and guaranteed algorithms for non-convex polynomial optimization problems. On the one hand, tractability is crucial for efficiently solving large-scale…
We give some new advances in the research of the maximum number of triangles that we may obtain in a simple arrangements of n lines or pseudo-lines.
In this paper we continue the investigation of finding the max/min polygons which can be inscribed in a given triangle. Here we are concerned with equilateral triangles. This may seem uninteresting or benign at first, but there are some…
The aim of this paper is to generalize Apollonius' problem. The problem is to construct a circle that is tangent to three given circles in a plane. We find the maximum possible number of solution circles in the case of more than the three…
In the Vertex Triangle 2-Club problem, we are given an undirected graph $G$ and aim to find a maximum-vertex subgraph of $G$ that has diameter at most 2 and in which every vertex is contained in at least $\ell$ triangles in the subgraph. So…
A {\em maximal partial ovoid} of a generalized quadrangle is a maximal set of points no two of which are collinear. The problem of determining the smallest size of a maximal partial ovoid in quadrangles has been extensively studied in the…
In the article it was shown the convergence of special integral of two dimensional Terry's problem. Main tools of the article are an investigation of real algebraic varieties and estimations of areas of algebraic surfaces.
This paper deals with the gravitational potential of a homogeneous torus with elliptical cross-section. We present a new expression for its gravitational potential which is valid in any point of the space, obtained by modeling the torus…
It is demonstrated that iterative repeating of some simple geometric construction leads unavoidably in the limit to the golden ratio. The procedure appears to be quickly convergent regardless of a ratio of initial elements sizes. This could…