Related papers: Corner-free sets via the torus
The goal of this note is to give a systematic method of constructing zero-free regions for the permanent in the sense of A. Barvinok, i.e. regions in the complex plane such that the permanent of a square matrix of any size with entries from…
A twist is a datum playing a role of a local system for topological $K$-theory. In equivariant setting, twists are classified into four types according to how they are realized geometrically. This paper lists the possible types of twists…
In this paper we obtain an explicit formula for the number of curves in two dimensional complex projective space, of degree d, passing through d(d+3)/2-(k+1) generic points and having one node and one codimension k singularity, where k is…
The Farey sequence is a natural exhaustion of the set of rational numbers between 0 and 1 by finite lists. Ford Circles are a natural family of mutually tangent circles associated to Farey fractions: they are an important object of study in…
In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…
A set of rational points on a curve is said to be in geometric progression if either the abscissae or the ordinates of the points are in geometric progression. Examples of three points in geometric progression on a circle are already known.…
Let $D$ be a square-free integer. Under certain conditions on $D$, we characterize non-constant arithmetic progressions of squares over quadratic extensions of $\mathbb{Q}(\sqrt{D})$.
Let $u \shuffle v$ denote the set of all shuffles of the words $u$ and $v$. It is shown that for each integer $n \geq 3$ there exists a square-free ternary word $u$ of length $n$ such that $u\shuffle u$ contains a square-free word. This…
We discuss a K3 and torus from view point of "mirror symmetry". We calculate the periods of the K3 surface and obtain the mirror map, the two-point correlation function, and the prepotential. Then we find there is no instanton correction on…
The celebrated Thue-Morse sequence, or the Prouhet-Thue-Morse sequence (A010060 in the OEIS), has a number of interesting properties and is a rich source to many (counter)examples. We introduce two different square-free sequences on three…
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e.,…
Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the Erd\H{o}s--Szekeres theorem is known and empty triangles have been investigated. We introduce a…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
We define an invariant for bordered 3-manifolds with torus boundary, taking the form of a module over a weighted A-infinity algebra associated to a torus defined in previous work. On setting U=0, we obtain the bordered three-manifold…
We determine which connected surfaces can be partitioned into topological circles. There are exactly seven such surfaces up to homeomorphism: those of finite type, of Euler characteristic zero, and with compact boundary components. As a…
This work discusses an approach to solving geometric construction problems in which the given figure is included in a set ordered by construction steps. The flow of information is carried through the chain, allowing the original problem to…
We provide a complete characterization of periodic point free homeomorphisms of the $2$-torus admitting irrational circle rotations as topological factors. Given a homeomorphism of the $2$-torus without periodic points and exhibiting…
A free-form Sudoku puzzle is a square arrangement of m times m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1,...,m in the cells such that the…
A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…
We present a general framework to generate trees every vertex of which has a non-negative weight and a color. The colors are used to impose certain restrictions on the weight and colors of other vertices. We first extend the enumeration…