相关论文: Lattice convex chains in the plane

The model of dense lattice polymers is studied as an example of non-unitary Conformal Field Theory (CFT) with $c=-2$. ``Antisymmetric'' correlation functions of the model are proved to be given by the generalized Kirchhoff theorem.…

In this paper we outline a Matrix Ansatz approach to some problems of combinatorial enumeration. The idea is that many interesting quantities can be expressed in terms of products of matrices, where the matrices obey certain relations. We…

In this paper we present a set of results on the integration and on the symmetries of the lattice potential Korteweg-de Vries (lpKdV) equation. Using its associated spectral problem we construct the soliton solutions and the Lax technique…

We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…

We demonstrate the benefits of a convex geometric perspective for questions on chemical stoichiometry. We show that the balancing of chemical equations, the use of "mixtures" to explain multiple stoichiometry, and the half-reaction for…

In this paper, we examine the combinatorial properties of conic arrangements in the complex projective plane that possess certain quasi-homogeneous singularities. First, we introduce a new tool that enables us to characterize the property…

We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…

We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…

In this paper, we study the connextion between lattice and Riesz homomorphisms in Riesz spaces. We prove, under a certain condition, that any lattice homomorphism on Riesz space is a Riesz homomorphism. This fits in the type of results by…

This paper illustrates the combinatorial approach to vertex algebra - study of vertex algebras presented by generators and relations. A necessary ingredient of this method is the notion of free vertex algebra. Borcherds \cite{bor} was the…

We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…

We investigate similarity classes of arithmetic lattices in the plane. We introduce a natural height function on the set of such similarity classes, and give asymptotic estimates on the number of all arithmetic similarity classes,…

We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in $\mathbb{R}^3$. We show that this question, which is equivalent to deciding the emptiness of certain…

In his work on log-concavity of multiplicities, Okounkov showed in passing that one could associate a convex body to a linear series on a projective variety, and then use convex geometry to study such linear systems. Although Okounkov was…

We represent the Riemann zeta function in the half-plane $\Re s >1$ via series whose terms admit geometrically decreasing bounds. Due to an underlying recurrence relation, which is used to compute coefficients entering into the terms, the…

Assuming the Riemann Hypothesis, we provide effective upper and lower estimates for $\left|\zeta(s)\right|$ right to the critical line. As an application we make explicit Titchmarsh's conditional bound for the Mertens function and…

We study the probability that a cycle of length k in the lattice [1, n]^s does not contain more lattice points than the k vertices of the cycle. Then we generalize this problem to other configurations induced by a given graph H,…

We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…