Related papers: To count clean triangles we count on $imph(n)$
An ideal triangulation of a singular flat surface is a geodesic triangulation such that its vertex set is equal to the set of singular points of the surface. Using the fact that each pair of points in a surface has a finite number of…
A triangle-free graph $G$ is called read-$k$ when there exists a monotone Boolean formula $\phi$ whose variables are the vertices of $G$ and whose minterms are precisely the edges of $G$, such that no variable occurs more than $k$ times in…
Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $o = u_l…
On the circle of radius $R$ centred at the origin, consider a ``thin'' sector about the fixed line $y = \alpha x$ with edges given by the lines $y = (\alpha \pm \epsilon) x$, where $\epsilon = \epsilon_R \rightarrow 0$ as $ R \to \infty $.…
Motivated by the problem of counting finite BPS webs, we count certain immersed metric graphs, tripods, on the flat torus. Classical Euclidean geometry turns this into a lattice point counting problem in $\mathbb C^2$, and we give an…
A \emph{magic square} is an $n \times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an…
We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.
We give a simple and complete description of those convex lattice polygons in the plane that can be dissected into lattice triangles of integer area. A new version of Sperner's Lemma plays a central role.
A ring $R$ is uniquely (strongly) clean provided that for any $a\in R$ there exists a unique idempotent $e\in R \big(\in comm(a)\big)$ such that $a-e\in U(R)$. Let $R$ be a uniquely bleached ring. We prove, in this note, that $R$ is…
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…
Given a unimodular lattice $\Lambda\subseteq \mathbb{R}^2$ consider the counting function $\mathcal{N}_\Lambda(T)$ counting the number of lattice points of norm less than $T$, and the remainder $\mathcal{R}_\Lambda(T)=\mathcal{N}(T)-\pi…
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…
We calculate the area of the smallest triangle and the area of the smallest virtual triangle for many known lattice surfaces. We show that our list of the lattice surfaces for which the area of the smallest virtual triangle greater than .05…
We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…
Any permutation-invariant function of data points $\vec{r}_i$ can be written in the form $\rho(\sum_i\phi(\vec{r}_i))$ for suitable functions $\rho$ and $\phi$. This form - known in the machine-learning literature as Deep Sets - also…
This paper studies a fascinating type of filter in residuated lattices, the so-called pure filters. A combination of algebraic and topological methods on the pure filters of a residuated lattice is applied to obtain some new structural…
A perfect triangle is a triangle with rational sides, medians, and area. In this article, we use a similar strategy due to Pocklington to show that if $\Delta$ is a perfect triangle, then it cannot be an isosceles triangle. It gives a…
A triangulation of a surface is \emph{irreducible} if there is no edge whose contraction produces another triangulation of the surface. We prove that every irreducible triangulation of a surface with Euler genus $g\geq1$ has at most $13g-4$…
An element $a\in R$ is very clean provided that there exists an idempotent $e\in R$ such that $ae=ea$ and either $a-e$ or $a+e$ is invertible. A ring $R$ is very clean in case every element in $R$ is very clean. We explore the necessary and…
In this work, we consider a number of problems defined on the triangular lattice with $n$ rows, which we will denote as $T_n$. Define a \textit{proper coloring} to be an assignment of colors to the points of $T_n$ such that no three points…