English
Related papers

Related papers: Characterizations of discrete Sugeno integrals as …

200 papers

A method of estimating sums of multiplicative functions braided with Dirichlet characters is demonstrated, leading to a taxonomy of the characters for which such sums are large.

Number Theory · Mathematics 2012-08-02 P. D. T. A. Elliott , Jonathan Kish

We give a uniform construction of irreducible polynomial representations of all classical groups, including spin groups, using semistandard domino tableaux. We also give an explicit decomposition of the homogeneous coordinate ring of the…

Representation Theory · Mathematics 2025-04-22 William M. McGovern

We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…

Statistical Mechanics · Physics 2009-11-13 Deepak Dhar , Samarth Chandra

We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike…

Logic in Computer Science · Computer Science 2023-04-27 Mikołaj Bojańczyk

We present a way to normalize a combinatorial Morse function into an integer-valued canonical representative of the set of discrete Morse functions inducing a given gradient field.

Combinatorics · Mathematics 2018-04-03 Nicolás A. Capitelli

We study Brown's definition of the probabilistic zeta function of a finite lattice as a generalization of that of a finite group. We propose a natural alternative or extension that may be better suited for non-atomistic lattices. The…

Combinatorics · Mathematics 2024-10-03 Besfort Shala

In a recent article, the class of functions from the integers to the integers computable in polynomial time has been characterized using discrete ordinary differential equations (ODE), also known as finite differences. Doing so, we pointed…

Computational Complexity · Computer Science 2022-10-04 Manon Blanc , Olivier Bournez

We develop a framework for the distributed minimization of submodular functions. Submodular functions are a discrete analog of convex functions and are extensively used in large-scale combinatorial optimization problems. While there has…

Optimization and Control · Mathematics 2018-01-23 Hassan Jaleel , Jeff Shamma

We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that…

Combinatorics · Mathematics 2009-02-03 Colin Bailey , Joseph Oliveira

In this paper we define Diophantine exponents of lattices and investigate some of their properties. We prove transference inequalities and construct some examples with the help of Schmidt's subspace theorem.

Number Theory · Mathematics 2016-06-01 Oleg N. German

It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the…

Representation Theory · Mathematics 2008-12-15 Nathaniel Thiem

The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…

Discrete Mathematics · Computer Science 2016-11-29 Corinna Gottschalk , Britta Peis

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…

Cryptography and Security · Computer Science 2007-05-23 Janis Buls

In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…

Logic · Mathematics 2018-10-22 Sergio A. Celani , Ma. Paula Menchón

We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…

Logic · Mathematics 2014-02-26 G. O. Jones , A. J. Wilkie

We present a Carlson type inequality for the generalized Sugeno integral and a much wider class of functions than the comonotone functions. We also provide three Carlson type inequalities for the Choquet integral. Our inequalities…

Functional Analysis · Mathematics 2015-02-25 Michał Boczek , Marek Kaluszka

We study and simulate N=2 supersymmetric Wess-Zumino models in one and two dimensions. For any choice of the lattice derivative, the theories can be made manifestly supersymmetric by adding appropriate improvement terms corresponding to…

High Energy Physics - Lattice · Physics 2008-11-26 Tobias Kaestner , Georg Bergner , Sebastian Uhlmann , Andreas Wipf , Christian Wozar

We propose the fundamental and two dimensional representation of the Lorentz groups on a (3+1)-dimensional hypercubic lattice, from which representations of higher dimensions can be constructed. For the unitary representation of the…

High Energy Physics - Lattice · Physics 2008-11-26 M. Lorente , P. Kramer

We study the class of real-valued functions on convex subsets of R^n which are computed by the maximum of finitely many affine functionals with integer slopes. We prove several results to the effect that this property of a function can be…

Combinatorics · Mathematics 2008-11-21 Kiran S. Kedlaya , Philip Tynan

We describe the class of polynomial functions which are barycentrically associative over an infinite commutative integral domain.

Rings and Algebras · Mathematics 2015-09-14 Jean-Luc Marichal , Pierre Mathonet , Jörg Tomaschek