Related papers: The Lattice of Amoebas
We study the amoebae (in S. Favorov's sense) of finite systems of exponential sums with real spectra. For generic systems of this type, we give a more effective representation of the amoeba and we prove that the complementary set to the…
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…
The amoeba of a Laurent polynomial $f \in \C[z_1^{\pm 1},\ldots,z_n^{\pm 1}]$ is the image of its zero set $\mathcal{V}(f)$ under the log-absolute-value map. Understanding the space of amoebas (i.e., the decomposition of the space of all…
The topology of amoebas of complex algebraic hypersurfaces is deeply connected to the combinatorics of the Newton polytope and the convex geometry of the Ronkin function. A long-standing conjecture of Passare and Rullgard asserts that the…
We examine the lattice generated by two pairs of supplementary vector subspaces of a finite-dimensional vector space by intersection and sum, with the aim of applying the results to the study of representations admitting two pairs of…
Lattice sums of cuboidal lattices, which connect the face-centered with the mean-centered and the body-centered cubic lattices through parameter dependent lattice vectors, are evaluated by decomposing them into two separate lattice sums…
Amoebas are projections of complex algebraic varieties in the algebraic torus under a Log-absolute value map, which have connections to various mathematical subjects. While amoebas of hypersurfaces have been intensively studied in recent…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…
Amoebas and coamoebas are the logarithmic images of algebraic varieties and the images of algebraic varieties under the arg-map, respectively. We present new techniques for computational problems on amoebas and coamoebas, thus establishing…
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…
This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…
Given a hypersurface coamoeba of a Laurent polynomial f, it is an open problem to describe the structure of its set of connected complement components. In this paper we approach this problem by introducing the lopsided coamoeba. We show…
Let M be a connection on a complex affine space with poles along a hyperplane. In this paper, we prove that the nearby cycles of Abbes and Saito's construction applied to M satisfy a linearity condition analogous to that obtained by Abbes…
Approximate lattices are aperiodic generalisations of lattices of locally compact groups that were first studied in seminal work of Yves Meyer. They are defined as those uniformly discrete approximate subgroups (symmetric subsets stable…
In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain…
Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…
A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…
The distribution of the deformations of elementary cells is studied in an abstract lattice constructed from the existence of the empty set. One combination rule determining oriented sequences with continuity of set-distance function in such…