Cubic curves in the triangle plane

The subject of this paper are two pencils of cubic curves that are the result of certain geometrical constructions in the triangle plane. One of them turns out to be the probably most significant pencil of anallagmatic cubics that are associated with triangle geometry. Both contain virtually all important single cubics, and other well known curves appear closely connected with them.Dedicated to Professor T.G. Ostrom on the occasion of his 80th birthday     

Cubic pencils of lines and bivariate interpolation

Cubic pencils of lines are classified up to projectivities. Explicit formulae for the addition of lines on the set of nonsingular lines of the pencils are given. These formulae can be used for constructing planar generalized principal lattices, which are sets of points giving rise to simple Lagrange formulae in bivariate interpolation. Special attention is paid to the irreducible nonsingular case, where elliptic functions are used in order to express the addition in a natural form.     

Multiperfect numbers on lines of the Pascal triangle

A number n is said to be multiperfect (or multiply perfect) if n divides its sum of divisors σ(n). In this paper, we study the multiperfect numbers on straight lines through the Pascal triangle. Except for the lines parallel to the edges, we show that all other lines through the Pascal triangle contain at most finitely many multiperfect numbers. We also study the distribution of the numbers σ(n)/n whenever the positive integer n ranges through the binomial coefficients on a fixed line through the Pascal triangle.     

How to best fold a triangle

We fold a triangle once along a straight line and study how small the area of the folded figure can be. It can always be as small as the fraction \(2-\sqrt{2}\) of the area of the original triangle.This is best possible: For every positive number \(\varepsilon\) there are triangles that cannot be folded better than \(2-\sqrt{2}-\varepsilon\).     

Invariants of infinite groups generated by reflections relative to lines

We distinguish nine rings of invariants of infinite groups generated by oblique reflections relative to lines of Euclidean space, and prove that a ring of invariants of any infinite group generated by such reflections is contained in one of these nine rings.Translated from Ukrainskii Geometricheski Sbornik, No. 33, pp. 65–69, 1990.     

On the relative strength of split,triangle and quadrilateral cuts

Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilateral inequalities. In this paper, we compare the strength of these three families of inequalities. In particular we study how well each family approximates the integer hull. We show that, in a well defined sense, triangle inequalities provide a good approximation of the integer hull. The same statement holds for quadrilateral inequalities. On the other hand, the approximation produced by split inequalities may be arbitrarily bad.     

Conjectures pertaining to repeated partitioning of a triangle

This note describes two conjectures pertaining to repeated partitioning of an arbitrary triangle. The first conjecture turns out to be true, and hence gives rise to a new, more general, conjecture that is also addressed in this article. Both conjectures can be explored in a dynamic geometry environment. The proofs to the conjectures addressed in this article require knowledge of high school Euclidean geometry.     

Fractals related to Pascal's triangle

A precise definition of a fractalF _p ^{r 1} derived from Pascal's triangle modulop ^r (p prime) is given. The number of nonzero terms in the firstp ^s lines of Pascal's triangle modulop ^r is computed. From this result the Hausdorff dimension and Hausdorff measure ofF _p ^{r 1} are deduced. The nonself-similarty ofF _p ^{r 1},r2, is also discussed.     

Cubic multiwavelets orthogonal to polynomials and a splitting algorithm

In this paper, an implicit method of decomposition of cubic Hermite splines using a new type of multiwavelets with supercompact supports is investigated. A splitting algorithm of wavelet-transforms of solving two three-diagonal systems of linear equations with strict diagonal dominance in parallel is justified. Results of some numerical experiments are presented.     

A counterexample to the triangle conjecture

The triangle conjecture sets a bound on the cardinality of a code formed by words of the form aⁱba^j. A counterexample exceeding that bound is given. This also disproves a stronger conjecture that every code is commutatively equivalent to a prefix code.     

Reflecting a triangle in the plane

We prove that if the three angles of a triangleT in the plane are different from (60°, 60°, 60°), (30°, 30°, 120°), (45°,45°,90°),(30°,60°,90°), then the set of vertices of those triangles which are obtained fromT by repeating ‘edge-reflection’ is everywhere dense in the plane.     

Quasi-Armendariz rings relative to a monoid

For a monoid M, we introduce M-quasi-Armendariz rings which are a generalization of quasi-Armendariz rings, and investigate their properties. The M-quasi-Armendariz condition is a Morita invariant property. The class of M-quasi-Armendariz rings is closed under some kinds of upper triangular matrix rings. Every semiprime ring is M-quasi-Armendariz for any unique product monoid and any strictly totally ordered monoid M. Moreover, we study the relationship between the quasi-Baer property of a ring R and those of the monoid ring R[M]. Every quasi-Baer ring is M-quasi-Armendariz for any unique product monoid and any strictly totally ordered monoid M.     

Packing similar triangles into a triangle

There exists a triangle T and a number \frac{1}{2}$$ " align="middle" border="0"> such that any sequence of triangles similar to T with total area not greater than times the area of T can be packed into T.     

The triangle closure is a polyhedron

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with certain families of lattice-free sets are polyhedra. For a long time, the only result known was the celebrated theorem of Cook, Kannan and Schrijver who showed that the split closure is a polyhedron. Although some fairly general results were obtained by Andersen et al. (Math Oper Res 35(1):233–256, 2010) and Averkov (Discret Optimiz 9(4):209–215, 2012), some basic questions have remained unresolved. For example, maximal lattice-free triangles are the natural family to study beyond the family of splits and it has been a standing open problem to decide whether the triangle closure is a polyhedron. In this paper, we show that when the number of integer variables $m=2$ the triangle closure is indeed a polyhedron and its number of facets can be bounded by a polynomial in the size of the input data. The techniques of this proof are also used to give a refinement of necessary conditions for valid inequalities being facet-defining due to Cornuéjols and Margot (Math Program 120:429–456, 2009) and obtain polynomial complexity results about the mixed integer hull.     

Freely adjoining a relative complement to a lattice

Let K be a lattice, and let a < b < c be elements of K. We adjoin freely a relative complement u of b in [a, c] to K to form the lattice L. For two polynomials A and B over K ∪ {u}, we find a very simple set of conditions under which A and B represent the same element in L, so that in L all pairs of relative complements in [a, c] can be described. Our major result easily follows: Let [a, c] be an interval of a lattice K; let us assume that every element in [a, c] has at most one relative complement. Then K has an extension L such that [a, c] in L, as a lattice, is uniquely complemented.As an immediate consequence, we get the classical result of R. P. Dilworth: Every lattice can be embedded into a uniquely complemented lattice. We also get the stronger form due to C. C. Chen and G. Grätzer: Every at most uniquely complemented bounded lattice has a {0, 1}-embedding into a uniquely complemented lattice. Some stronger forms of these results are also presented.A polynomial A over K ∪ {u} naturally represents an element 〈A 〉 of L. Let us call a polynomial A minimal, if it is of minimal length representing x. We characterize minimal polynomials.Dedicated to the memory of Ivan RivalReceived February 12, 2003; accepted in final form June 18, 2004.This revised version was published online in August 2005 with a corrected cover date.     

The transition from fracton to phonon states in a Sierpinski triangle lattice

Lattice dynamics of a Sierpinski triangle submitted to different levels of disorder was studied via atomistic Green’s functions. It was found that there is a critical level of disorder that separates two regions of thermal transport. The first is characterized by a fast destruction of fracton states and the formation of spatially extended phonon states. The second region is characterized by a transition from extended to localized phonon states as predicted by the Anderson model.