Related papers: Lattice convex chains in the plane
In this paper we investigate the discrete version of the classical hanging chain problem. We generalize the problem, by allowing for arbitrary mass and length of each link. We show that the shape of the chain can be obtained by solving a…
Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…
We study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…
This is a survey of results in the enumeration of lattice paths.
We consider the Tarski--Bang problem about covering of convex bodies by planks. The results of this kind give a lower bound on the sum of widths of planks (regions between a pair of parallel hyperplanes) covering a given convex body.…
We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…
We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…
It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…
Combining the Kaplan surface mode approach for chiral fermions with added terms motivated by Eichten and Preskill suggests the possibility for a lattice regularization of the standard model which is finite, exactly gauge invariant, and only…
We solve a randomized version of the following open question: is there a strictly convex, bounded curve \gamma in the plane such that the number of rational points on \gamma, with denominator $n$, approaches infinity with $n$? Although this…
In this paper we investigate some particular spin lattice (a higher dimensional generalization of a spin chain) related to Zamolodchikov model, in the limit when both sizes of the lattice tend to infinity. An infinite set of bilinear…
The purpose of this paper is to study convex bodies $C$ for which there exists no convex body $C^\prime\subsetneq C$ of the same lattice width. Such bodies shall be called ``lattice reduced'', and they occur naturally in the study of the…
A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…
We study the structure of inverse limit space of so-called Fibonacci-like tent maps. The combinatorial constraints implied by the Fibonacci-like assumption allow us to introduce certain chains that enable a more detailed analysis of…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…
In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…
There are well-known constructions of integrable systems which are chains of infinitely many copies of the equations of the KP hierarchy ``glued'' together with some additional variables, e.g., the modified KP hierarchy. Another…
We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…
We show that the XYZ spin chain along the special line of couplings J_xJ_y+J_xJ_z+J_yJ_z=0 possesses a hidden N=(2,2) supersymmetry. This lattice supersymmetry is non-local and changes the number of sites. It extends to the full transfer…