Related papers: Periodic balanced binary triangles
We prove that almost every triangle can be dissected only into $n^2$ triangles which have to be equal one another. Moreover, such a dissection is unique for every $n$. It turns out that to solve this "simple" problem it is convenient to use…
Let $A$ be a finite multiset of integers. If $B$ be a multiset such that $A$ and $B$ are $t$-complementing multisets of integers, then $B$ is periodic. We obtain the Biro-type upper bound for the smallest such period of $B$: Let…
An ordered matching of size $n$ is a graph on a linearly ordered vertex set $V$, $|V|=2n$, consisting of $n$ pairwise disjoint edges. There are three different ordered matchings of size two on $V=\{1,2,3,4\}$: an alignment…
A general formula for the linearized Poincar\'e map of a billiard with a potential is derived. The stability of periodic orbits is given by the trace of a product of matrices describing the piecewise free motion between reflections and the…
A Heron triangle is one that has all integer side lengths and integer area, which takes its name from Heron of Alexandria's area formula. From a more relaxed point of view, if rescaling is allowed, then one can define a Heron triangle to be…
We say that a diagonal in an array is {\em $\lambda$-balanced} if each entry occurs $\lambda$ times. Let $L$ be a frequency square of type $F(n;\lambda^m)$; that is, an $n\times n$ array in which each entry from $\{1,2,\dots ,m\}$ occurs…
The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…
Any periodic trajectory on an isosceles triangle gives rise to a periodic trajectory on a right triangle obtained by identifying the halves of the original triangle. We examine the relationship between periodic trajectories on isosceles…
Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…
Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable…
We show that, for each real number $\epsilon > 0$ there is an integer $c$ such that, if $M$ is a simple triangle-free binary matroid with $|M| \ge (\tfrac{1}{4} + \epsilon) 2^{r(M)}$, then $M$ has critical number at most $c$. We also give a…
A gain graph is a triple (G,h,H), where G is a connected graph with an arbitrary, but fixed, orientation of edges, H is a group, and h is a homomorphism from the free group on the edges of G to H. A gain graph is called balanced if the…
A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…
A 2-coloring of the n-cube in the n-dimensional Euclidean space can be considered as an assignment of weights of 1 or 0 to the vertices. Such a colored n-cube is said to be balanced if its center of mass coincides with its geometric center.…
A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…
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. We wish to understand…
Balancing numbers $n$ are originally defined as the solution of the Diophantine equation $1+2+\cdots+(n-1)=(n+1)+\cdots+(n+r)$, where $r$ is called the balancer corresponding to the balancing number $n$. By slightly modifying, $n$ is the…
A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…