Related papers: Corner-free sets via the torus

A bidimensional bifix (in short bibifix) of a square matrix T is a square submatrix of T which occurs in the top-left and bottom-right corners of T. This allows us to extend the definition of bifix-free words and cross-bifix-free set of…

A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…

We report a small advance on a question raised by Robertson, Schweitzer, and Wagon in [RSW02]. They constructed a genus-13 polyhedron built from bricks without corners, and asked whether every genus-0 such polyhedron must have a corner. A…

Consider the triangle-free graph process, which starts from the empty graph on $n$ vertices and a random ordering of the possible ${n \choose 2}$ edges; the edges are added in this ordering provided the graph remains triangle free. We will…

We classify closed, simply connected $n$-manifolds of non-negative sectional curvature admitting an isometric torus action of maximal symmetry rank in dimensions $2\leq n\leq 6$. In dimensions $3k$, $k=1,2$ there is only one such manifold…

The twist construction is a method to build new interesting examples of geometric structures with torus symmetry from well-known ones. In fact it can be used to construct arbitrary nilmanifolds from tori. In our previous paper, we presented…

The main result of this paper, is the complete parametric description of the family of triangles which have integer sidelengths and with one angle being sixty degrees.

This paper contains an attempt to formulate rigorously and to check predictions in enumerative geometry of curves following from Mirror Symmetry. The main tool is a new notion of stable map. We give an outline of a contsruction of…

We produce several algebraic curves, some well--known, some new, out of circles, by means of two classical (mutually reciprocal) algebraic methods: blow--down and blow--up.

In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…

This article introduces efficient and user-friendly tools for analyzing the intersection curve between a ringed torus and an irreducible quadric surface. Without loose of generality, it is assumed that the torus is centered at the origin,…

Given the degree sequence $d$ of a graph, the realization graph of $d$ is the graph having as its vertices the labeled realizations of $d$, with two vertices adjacent if one realization may be obtained from the other via an edge-switching…

A transformation based on mean curvature is introduced which morphs triangulated surfaces into round spheres.

Let T be the standard torus of revolution in R^3 with radii b and 1, 0<b<1. Let \alpha be a (p,q) torus curve on T. We show that there are points of zero curvature on \alpha for only one value of the variable radius of T, b=p^2/(p^2+q^2).…

Consider two families of closed oriented curves in a d-manifold. At each point of intersecction of a curve of one family with a curve of the other family, form a new closed curve by going around the first curve and then going around the…

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

Each closed oriented 3-manifold $M$ is naturally associated with a set of integers $D(M)$, the degrees of all self-maps on $M$. $D(M)$ is determined for each torus bundle and torus semi-bundle $M$. The structure of torus semi-bundle is…

An asteroidal triple free graph is a graph such that for every independent triple of vertices no path between any two avoids the third. In a recent result from Corneil and Stacho, these graphs were characterised through a linear vertex…

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of…

Shape complexity is a hard-to-quantify quality, mainly due to its relative nature. Biased by Euclidean thinking, circles are commonly considered as the simplest. However, their constructions as digital images are only approximations to the…