Related papers: Integer Triangles with R/r=N

In this paper we consider the Erd\H{o}s-R\'enyi random graph in the sparse regime in the limit as the number of vertices $n$ tends to infinity. We are interested in what this graph looks like when it contains many triangles, in two…

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

We prove that it is $\#\mathsf{P}$-complete to count the triangulations of a (non-simple) polygon.

We discuss an unusual phenomenon in (integral) positive ternary quadratic forms. We also describe an interesting pairing of genera of ternary forms.

A rational spherical triangle is a triangle on the unit sphere such that the lengths of its three sides and its area are rational multiples of $\pi$. Little and Coxeter have given examples of rational spherical triangles in 1980s. In this…

We study those rings in which all invertible elements are weakly nil-clean calling them {\it UWNC rings}. This somewhat extends results due to Karimi-Mansoub et al. in Contemp. Math. (2018), where rings in which all invertible elements are…

In this paper, we prove that if a finite number of rectangles, every of which has at least one integer side, perfectly tile a big rectangle then there exists a strategy which reduces the number of these tiles (rectangles) without violating…

Let $k\ge 2$ and $n_1\ge n_2\ge n_3\ge n_4$ be integers such that $n_4$ is sufficiently larger than $k$. We determine the maximum number of edges of a 4-partite graph with parts of sizes $n_1,\dots, n_4$ that does not contain $k$…

The relevance of this paper lies in the fact that it resolves two previously unsolved open problems. In the first part of the paper, a new lemma is proved, from which it follows that if there exists a triangle with integer sides and…

A ring R is said to be VNL if for any a in R, either a or 1-a is (von Neumann) regular. The class of VNL rings lies properly between the exchange rings and (von Neumann) regular rings. We characterize abelian VNL rings. We also characterize…

We improve the estimates of the subgraph probabilities in a random regular graph. Using the improved results, we further improve the limiting distribution of the number of triangles in random regular graphs.

An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile'". The tile may or may not be similar to ABC . This paper is the…

Fix an integer n>=1. Suppose that a simple polygon is the union of n triangles whose vertices along the common boundary are arranged cyclically. How many sides can such a union -- to be called regular -- have at most? This gives OEIS…

We provide an algorithm for computing the number of integral points lying in certain triangles that do not have integral vertices. We use techniques from Algebraic Geometry such as the Riemann-Roch formula for weighted projective planes and…

In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…

The degenerate Stirling numbers of the second kind and of the first kind, which are respectively degenerate versions of the Stirling numbers of the second kind and of the first kind, appear frequently when we study various degenerate…

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

Given real numbers whose sum is an integer, we study the problem of finding integers which match these real numbers as closely as possible, in the sense of L^p norm, while preserving the sum. We describe the structure of solutions for this…

We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…

We show that every minimum area isosceles triangle containing a given triangle $T$ shares a side and an angle with $T$. This proves a conjecture of Nandakumar motivated by a computational problem. We use our result to deduce that for every…