相关论文: Characterizations of discrete Sugeno integrals as …
The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also known as finite differences. In the framework of ordinary…
In this paper, as an extension of the integer case, we define polynomial functions over the residue class rings of Dedekind domains, and then we give canonical representations and counting formulas for such polynomial functions. In…
Based on the representation of a set of canonical operators on the lattice $h\mathbb{Z}^n$, which are Clifford-vector-valued, we will introduce new families of special functions of hypercomplex variable possessing $\mathfrak{su}(1,1)$…
Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer…
Two-dimensional sigma-models describing superstrings propagating on manifolds of special holonomy are characterized by symmetries related to covariantly constant forms that these manifolds hold, which are generally non-linear and close in a…
The first part of the paper provides new characterizations of the normal cone to the effective domain of the supremum of an arbitrary family of convex functions. These results are applied in the second part to give new formulas for the…
We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…
We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in…
We extend two of the methods previously introduced to find discrete symmetries of differential equations to the case of difference and differential-difference equations. As an example of the application of the methods, we construct the…
Submodular functions are discrete functions that model laws of diminishing returns and enjoy numerous algorithmic applications. They have been used in many areas, including combinatorial optimization, machine learning, and economics. In…
The purpose of this article is to investigate the combinatorial properties of the cross section lattice of a $J$-irreducible monoid associated with a semisimple algebraic group of one of the types $A_n$, $B_n$, or $C_n$. Our main tool is a…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and…
In this paper we characterize the definiteness of the discrete symplectic system, study a nonhomogeneous discrete symplectic system, and introduce the minimal and maximal linear relations associated with these systems. Fundamental…
In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…
Supersymmetry, like Poincare symmetry, is softly broken at finite lattice spacing provided the gaugino mass term is strongly suppressed. Domain wall fermions provide the mechanism for suppressing this term by approximately imposing chiral…
The main aim of this paper is to study aggregation functions on lattices via clone theory approach. Observing that the aggregation functions on lattices just correspond to $0,1$-monotone clones, as the main result we show that for any…
We characterize the finite intervals of the Muchnik lattice by proving that they are a certain proper subclass of the finite distributive lattices.
We introduce a basis of rational polynomial-like functions $P_0,\ldots,P_{n-1}$ for the free module of functions $Z/nZ\to Z/mZ$. We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the…