Related papers: A Conic Section Problem Involving the Maximum Gene…
An interesting problem that determine a triangle of smallest area which circumscribes a semicircle is solved. Then a generalized golden right triangles sequence $T_n$ is obtained, and an interesting construction of the maximum generalized…
The maximum segment sum problem is to compute, given a list of integers, the largest of the sums of the contiguous segments of that list. This problem specification maps directly onto a cubic-time algorithm; however, there is a very elegant…
The aim of this paper is to consider the Lobachevskii geometry analog of a well-known Euclidian problem; namely: to find a triangle with two fixed sides and the maximum area
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…
We use floor decompositions of tropical curves to prove that any enumerative problem concerning conics passing through projective-linear subspaces in $\RP^n$ is maximal. That is, there exist generic configurations of real linear spaces such…
Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…
A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. It is reasoned that under some conditions, the optimum occurs at the corners of…
We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…
We introduce and study a new kind of congruent number problem on the right trapezoid.
If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…
In the present work we show how different ways to solve biquadratic equations can lead us to different representations of its solutions. A particular equation which has the golden ratio and its reciprocal as solutions is shown as an…
The edge geodesic cover problem of a graph $G$ is to find a smallest number of geodesics that cover the edge set of $G$. The edge $k$-general position problem is introduced as the problem to find a largest set $S$ of edges of $G$ such that…
Constructing the maximum spanning tree $T$ of an edge-weighted connected graph $G$ is one of the important research topics in computer science and optimization, and the related research results have played an active role in practical…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
The weighted $\mathcal{T}$-free $2$-matching problem is the following problem: given an undirected graph $G$, a weight function on its edge set, and a set $\mathcal{T}$ of triangles in $G$, find a maximum weight $2$-matching containing no…
We review, from a didactic point of view, the definition of a toric section and the different shapes it can take. We'll then discuss some properties of this curve, investigate its analogies and differences with the most renowned conic…
We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…
We present a criterion when six points chosen on the sides of a triangle belong to the same conic. Using this tool we show how the two geometrical gems - celebrated Poncelet's theorem of projective geometry and incredible Morley's theorem…