Related papers: The Pattern Complexity of the 2-Dimensional Paperf…
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel…
We give formulas for the degrees of the spaces of foliations in P2 with a dicritical singularity of prescribed order. Blowing up such singularity induces, generically, a foliation with all but finitely many leaves transversal to the…
We provide local formul{\ae} for Poisson bivectors and symplectic forms on the leaves of Poisson structures associated to wrinkled fibrations on smooth $4$--manifolds.
We present some results on the proportion of permutations of length $n$ containing certain mesh patterns as $n$ grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and…
For suitable pairs of diagonal quadratic forms in 8 variables we use the circle method to investigate the density of simultaneous integer solutions and relate this to the problem of estimating linear correlations among sums of two squares.
We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.
This paper deals with the complexity of strings, which play an important role in biology (nucleotid sequences), information theory and computer science. The d-complexity of a string is defined as the number of its distinct d-substrings…
Despite the apparent ease with which a sheet of paper is crumpled and tossed away, crumpling dynamics are often considered a paradigm of complexity. This complexity arises from the infinite number of configurations a disordered crumpled…
We examine sequences of dense packings of n congruent non-overlapping disks inside a square which follow specific patterns as n increases along certain values, n = n(1), n(2),... n(k),.... Extending and improving previous work of Nurmela…
We compute part of the superfield in terms of the component fields of 11-dimensional on-shell supergravity by using `Gauge completion' in 2nd-order formalism. The result is the same as was derived recently in 1.5-order formalism by B. de…
In this paper we study the lattice point covering property of some regular polygons in dimension 2.
We study several variations of line segment covering problem with axis-parallel unit squares in $I\!\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at…
This is the paper as published. The topology of a complex plane curve singularity with real branches is deduced from any real deformation having delta crossings. An example of the computation of the global geometric monodromy of a…
In this paper we describe the group of symmetries of a two-dimensional continued fraction. As a multidimensional generalization of continued fractions we consider Klein polyhedra. We distinguish two types of symmetries: the Dirichlet-type…
We consider smooth 1-parameter families of plane curves tangent to a semicubic parabola, when the curvature radius of their curves at the tangency point vanishes at the cusp point. We find the $\A$-normal form of these families, their…
In this paper we examine the structure of complex points of real 4-manifolds embedded into complex 3-manifolds up to isotopy. We show that there are only two types of complex points up to isotopy and as a consequence, show that any such…
Dielectric resonators are open systems particularly interesting due to their wide range of applications in optics and photonics. In a recent paper [PRE, vol. 78, 056202 (2008)] the trace formula for both the smooth and the oscillating parts…
We present two universal hinge patterns that enable a strip of material to fold into any connected surface made up of unit squares on the 3D cube grid--for example, the surface of any polycube. The folding is efficient: for target surfaces…
We study the geometry of the critical clusters in fully coordinated percolation on the square lattice. By Monte Carlo simulations (static exponents) and normal mode analysis (dynamic exponents), we find that this problem is in the same…