Related papers: To count clean triangles we count on $imph(n)$
In this note, we investigate conformally flat submanifolds of Euclidean space with positive index of relative nullity. Let $M^n$ be a complete conformally flat manifold and let $f\colon M^n\to \R^m$ be an isometric immersion. We prove the…
A \emph{hole} in a graph is an induced cycle with at least 4 vertices. A graph is \emph{even-hole-free} if it does not contain a hole on an even number of vertices. A \emph{pyramid} is a graph made of three chordless paths $P_1 = a \dots…
A commutative ring $R$ is projective free provided that every finitely generated $R$-module is free. An element in a ring is strongly clean provided that it is the sum of an idempotent and a unit that commutates. Let $R$ be a…
We show that for every lattice packing of $n$-dimensional spheres there exists an $(n/\log_2(n))$-dimensional affine plane which does not meet any of the spheres in their interior, provided $n$ is large enough. Such an affine plane is…
We present an intriguing question about lattice points in triangles where Pick's formula is "almost correct". The question has its origin in knot theory, but its statement is purely combinatorial. After more than 30 years the topological…
Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…
We introduce the canonical, parameter-free, and efficiently computable notion of peel neighborhoods in a finite metric space of strict negative type. Using a soft threshold to upper bound their radius or cardinality allows peel…
The $F$-pure threshold is a numerical invariant of prime characteristic singularities, that constitutes an analogue of the log canonical thresholds in characteristic zero. We compute the $F$-pure thresholds of determinantal ideals, i.e., of…
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…
We construct a formula $\phi$ which axiomatizes non-narrow rectangular grids without using any binary relations other than the grid neighborship relations. As a corollary, we prove that a set $A \subseteq \mathbb{N}$ is a spectrum of a…
We give upper and lower bounds on the number of graphs of fixed degree which have a positive density of triangles. In particular, we show that there are very few such graphs, when compared to the number of graphs without this restriction.…
The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…
An \emph{antilattice} is an algebraic structure based on the same set of axioms as a lattice except that the two commutativity axioms for $\land$ and $\lor$ are replaced by anticommutative counterparts. In this paper we study certain…
Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…
Two triangle meshes are conformally equivalent if for any pair of incident triangles the absolute values of the corresponding cross-ratios of the four vertices agree. Such a pair can be considered as preimage and image of a discrete…
A primitive Heron triangle is a triangle with integral sides and integral area where the greatest common divisor of the lengths of its sides is $1$. By utilizing the theory of elliptic curves, we prove that there exist infinitely many…
We compute the $F$-pure threshold of a degree three homogeneous polynomial in three variables with an isolated singularity. The computation uses elementary methods to prove a known result of Bhatt and Singh.
A fake quadric is a smooth projective surface that has the same rational cohomology as a smooth quadric surface but is not biholomorphic to one. We provide an explicit classification of all irreducible fake quadrics according to the…
Triangle counting is a fundamental problem in the analysis of large graphs. There is a rich body of work on this problem, in varying streaming and distributed models, yet all these algorithms require reading the whole input graph. In many…
A set $B$ is said to be \emph{sum-free} if there are no $x,y,z\in B$ with $x+y=z$. We show that there exists a constant $c>0$ such that any set $A$ of $n$ integers contains a sum-free subset $A'$ of size $|A'|\geqslant n/3+c\log \log n$.…