Related papers: To count clean triangles we count on $imph(n)$

We study the minimum degree necessary to guarantee the existence of perfect and almost-perfect triangle-tilings in an $n$-vertex graph $G$ with sublinear independence number. In this setting, we show that if $\delta(G) \ge n/3 + o(n)$ then…

Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…

We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these \emph{lattice games} can be made particularly efficient for octal games, which we generalize to…

Let $R$ be a ring (not necessarily a commutative ring) with identity. The clean graph $Cl(R)$ of a ring $R$ is a graph with vertices in the form of an ordered pair $(e,u)$, where $e$ is an idempotent and $u$ is a unit of ring $R$,…

In this paper we consider the problem of finding pairs of triangles whose sides are perfect squares of integers, and which have a common perimeter and common area. We find two such pairs of triangles, and prove that there exist infinitely…

Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute…

In this paper we are interested in an intrinsic property of graphs which is derived from their embeddings into the Euclidean 3-space $\mathbb{R}^3$. An embedding of a graph into $\mathbb{R}^3$ is said to be linear, if it sends every edge to…

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

We show that there are only two equable triangles having vertices on the Eisenstein lattice, up to Euclidean motions.

A massless up quark is an intriguing solution to the strong CP problem. We discuss how lattice computations can be used in conjunction with chiral perturbation theory to address the consistency of $m_u=0$ with the observed hadron spectrum…

We give an arithmetic count of the lines on a smooth cubic surface over an arbitrary field $k$, generalizing the counts that over $\mathbb{C}$ there are $27$ lines, and over $\mathbb{R}$ the number of hyperbolic lines minus the number of…

An element of a ring is unique clean if it can be uniquely written as the sum of an idempotent and a unit. A ring $R$ is uniquely $\pi$-clean if some power of every element in $R$ is uniquely clean. In this article, we prove that a ring $R$…

Using a functional renormalization group we compute the flow of the renormalized impurity potential for a single impurity in a Luttinger liquid over the entire energy range - from the microscopic scale of a lattice-fermion model down to the…

Simple cubic lattice (SC lattice) can be viewed as plane triangular lattice (PT lattice) by viewing it along its principle diagonal lines. By viewing thus we establish the exact one-to-one correspondence between the closed graphs on SC…

A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

Craig interpolation is a fundamental property of classical and non-classic logics with a plethora of applications from philosophical logic to computer-aided verification. The question of which interpolants can be obtained from an…

An \emph{auspicious tatami mat arrangement} is a tiling of a rectilinear region with two types of tiles, $1 \times 2$ tiles (dimers) and $1 \times 1$ tiles (monomers). The tiles must cover the region and satisfy the constraint that no four…

Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the "tile") and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known…

A recent paper by the authors (ITCS'26) initiates the study of the Triangle Detection problem in graphs avoiding a fixed pattern $H$ as a subgraph and proposes a \emph{dichotomy hypothesis} characterizing which patterns $H$ make the…