English
Related papers

Related papers: Ingham type inequalities in lattices

200 papers

Graham Theorem on the unit ball $B_{n}$ in $\mathbb{C}^{n}$ states that every invariant harmonic function $u\in C^{n}(\overline{B}_{n})$ must be pluriharmonic in $B_{n}$. This rigidity phenomenon of Graham have been studied by many authors.…

Complex Variables · Mathematics 2017-08-14 Ren-Yu Chen , Song-Ying Li

The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…

Combinatorics · Mathematics 2009-04-12 Sergei Ovchinnikov

Based on the complete-lattice approach, a new Lagrangian duality theory for set-valued optimization problems is presented. In contrast to previous approaches, set-valued versions for the known scalar formulas involving infimum and supremum…

Optimization and Control · Mathematics 2024-01-26 Andreas H. Hamel , Andreas Löhne

Given that the existing parametric functional forms for the Lorenz curve do not fit all possible size distributions, a universal parametric functional form is introduced. By using the empirical data from different scientific disciplines and…

Data Analysis, Statistics and Probability · Physics 2023-04-28 Thitithep Sitthiyot , Kanyarat Holasut

As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using the Taylor expansion, is…

Probability · Mathematics 2020-08-03 Yoichi Nishiyama

In this paper we introduce the class of infinite infimal convolution functionals and apply these functionals to the regularization of ill-posed inverse problems. The proposed regularization involves an infimal convolution of a continuously…

Optimization and Control · Mathematics 2024-12-17 Kristian Bredies , Marcello Carioni , Martin Holler , Yury Korolev , Carola-Bibiane Schönlieb

A function is exponentially concave if its exponential is concave. We consider exponentially concave functions on the unit simplex. In a previous paper we showed that gradient maps of exponentially concave functions provide solutions to a…

Probability · Mathematics 2017-06-01 Soumik Pal , Ting-Kam Leonard Wong

This work contributes to an understanding of the domain size's effect on the existence and uniqueness of the linear convection--diffusion equation with integral-type boundary conditions, where boundary conditions depend non-locally on…

Analysis of PDEs · Mathematics 2022-06-14 Chiun-Chang Lee , Masashi Mizuno , Sang-Hyuck Moon

We prove intertwining relations by twisted gradients for Markov semi-groups. These relations are applied to Brascamp-Lieb type inequalities and spectral gap results. It generalizes the results of [1] from the Euclidean space to Riemannian…

Functional Analysis · Mathematics 2021-01-14 Baptiste Huguet

Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…

Computational Complexity · Computer Science 2025-11-21 Antoine Joux

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

Combinatorics · Mathematics 2009-09-24 Alan Stapledon

We establish a general normal subgroup theorem for commensurators of lattices in locally compact groups. While the statement is completely elementary, its proof, which rests on the original strategy of Margulis in the case of higher rank…

Group Theory · Mathematics 2014-09-19 Darren Creutz , Yehuda Shalom

Lagrangian multiforms provide a variational framework for describing integrable hierarchies. This thesis presents two approaches for systematically constructing Lagrangian one-forms, which cover the case of finite-dimensional integrable…

Mathematical Physics · Physics 2026-02-13 Anup Anand Singh

We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…

Combinatorics · Mathematics 2024-08-07 Jinting Liang , Bruce E. Sagan

The tangent method has recently been devised by Colomo and Sportiello (arXiv:1605.01388 [math-ph]) as an efficient way to determine the shape of arctic curves. Largely conjectural, it has been tested successfully in a variety of models.…

Mathematical Physics · Physics 2020-01-29 Bryan Debin , Etienne Granet , Philippe Ruelle

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

The main purpose of the paper is to demonstrate that condition of invariance with respect to the Legendre transformations allows effectively isolate the class of integrable difference equations on the triangular lattice, which can be…

solv-int · Physics 2014-08-27 V. E. Adler

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…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 S. Sergeev

This paper concerns the geometric structure of optimizers for frame potentials. We consider finite, real or complex frames and rotation or unitarily invariant potentials, and mostly specialize to Parseval frames, meaning the frame potential…

Functional Analysis · Mathematics 2014-07-08 Bernhard G. Bodmann , John Haas

The Ingleton-LP bound is an outer bound for the multicast capacity region, assuming the use of linear network codes. Computation of the bound is performed on a polyhedral cone obtained by taking the intersection of half-spaces induced by…

Information Theory · Computer Science 2008-02-20 Laurent Guille , Terence Chan , Alex Grant
‹ Prev 1 3 4 5 6 7 10 Next ›