Related papers: Log-concavity and log-convexity via distributive l…
We present log-linear dynamical systems, a dynamical system model for positive quantities. We explain the connection to linear dynamical systems and show how convex optimization can be used to identify and control log-linear dynamical…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…
Two interesting sequences arose in the study of the series expansions of the complete elliptic integrals, which are called the Catalan-Larcombe-French sequence $\{P_n\}_{n\geq 0}$ and the Fennessey-Larcombe-French sequence $\{V_n\}_{n\geq…
Many lattice-based crypstosystems employ ideal lattices for high efficiency. However, the additional algebraic structure of ideal lattices usually makes us worry about the security, and it is widely believed that the algebraic structure…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
We prove, using optimal transport tools, weighted Poincar'e inequalities for log-concave random vectors satisfying some centering conditions. We recover by this way similar results by Klartag and Barthe-Cordero-Erausquin for log-concave…
In this work, various versions of the so-called Omega-Lemma are provided, which ensure differentiability properties of pushforwrds between spaces of C^r-sections (or compactly supported C^r-sections) in vector bundles over…
A mixed lattice vector space is a partially ordered vector space with two partial orderings and certain lattice-type properties. In this paper we first give some fundamental results in mixed lattice groups, and then we investigate the…
We review some results on the logarithmic convexity for evolution equations, a well-known method in inverse and ill-posed problems. We start with the classical case of self-adjoint operators. Then, we analyze the case of analytic…
We give an explicit combinatorial proof of a weighted version of strong log-concavity for the generating polynomial of increasing spanning forests of a finite simple graph equipped with a total ordering of the vertices. In contrast to…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…
The finite Pfaff lattice is given by commuting Lax pairs involving a finite matrix L (zero above the first subdiagonal) and a projection onto Sp(N). The lattice admits solutions such that the entries of the matrix L are rational in the time…
In applications that use knowledge representation (KR) techniques, in particular those that combine data-driven and logic methods, the domain of objects is not an abstract unstructured domain, but it exhibits a dedicated, deep structure of…
In this paper, binomial difference ideals are studied. Three canonical representations for Laurent binomial difference ideals are given in terms of the reduced Groebner basis of Z[x]-lattices, regular and coherent difference ascending…
We propose a computationally efficient random walk on a convex body which rapidly mixes and closely tracks a time-varying log-concave distribution. We develop general theoretical guarantees on the required number of steps; this number can…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
Orders and fractional ideals in number fields provide interesting examples of lattices. We ask: what lattices arise from orders in number fields? We prove that all nontrivial multiplicative constraints on successive minima of orders come…
We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…
This article focuses on the relationship between pseudo-t-norms and the structure of lattices. First, we establish a necessary and sufficient condition for the existence of a left-continuous t-norm on the ordinal sum of two disjoint…