相关论文: Convex expansion for finite distributive lattices …

We study the distribution of lattice points with prime coordinates lying in the dilate of a convex planar domain having smooth boundary, with nowhere vanishing curvature. Counting lattice points weighted by a von Mangoldt function gives an…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

A finite group G is said to be a cut group if all central units in the integral group ring ZG are trivial. In this article, we extend the notion of cut groups, by introducing extended cut groups. We study the properties of extended cut…

In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone. Such a representation or 'lift' of the convex set is especially useful if the…

In this article, we introduce the notion of a functor on coarse spaces being coarsely excisive- a coarse analogue of the notion of a functor on topological spaces being excisive. Further, taking cones, a coarsely excisive functor yields a…

This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

The object of this paper is to introduce and study the concept of quasi-geometric infinite divisibility for distributions on $\bf R_+$. These distributions arise as mixing distributions of (discrete) geometric infinitely divisible Poisson…

In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). We show that many…

In this note, we discuss Hassett maximal cubic fourfolds and construct an explicit irreducible component of maximal dimension sixteen of the locus $\mathcal{Z}$ of Hassett maximal cubic fourfolds. We utilize algebraic and arithmetic methods…

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…

We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…

We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…

We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…

We study the mixed-integer epigraph of a special class of convex functions with non-convex indicator constraints, which are often used to impose logical constraints on the support of the solutions. The class of functions we consider are…

We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…

This is a translation. I have added translations for (possibly) outdated definitions in an appendix at the end. In this paper, we define distributive groups and show some properties of them. We then concern ourselves with the homogeinity of…