相关论文: Mathematics of Plott choice functions
A novel basis of discrete analytic polynomials on a rhombic lattice is introduced and the associated convolution product is studied. A class of discrete analytic functions that are rational with respect to this product is also described.
The main purpose of this paper is to study the lattice structure of variable precision rough sets. The notion of variation in precision of rough sets have been further extended to variable precision rough set with variable classification…
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…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the…
This note studies numerical methods for solving compositional optimization problems, where the inner function is smooth, and the outer function is Lipschitz continuous, non-smooth, and non-convex but exhibits one of two special structures…
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 investigate the (functional) convex order of for various continuous martingale processes, either with respect to their diffusions coefficients for L\'evy-driven SDEs or their integrands for stochastic integrals. Main results are bordered…
Let C be the set of all possible quantum states. We study the convex subsets of C with attention focused on the lattice theoretical structure of these convex subsets and, as a result, find a framework capable of unifying several aspects of…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We suggest to compute structure functions in the Hamiltonian formalism on a momentum lattice using a physically motivated regularisation that links the total parton number to the lattice size. We show for the $\phi ^4 _4$ theory that our…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, and derive a canonical representation. Moreover, we prove said scale-measures are lattice…
A new methodological approach for the study of topology for shapes made of arrangements of lines, planes or solids is presented. Topologies for shapes are traditionally built on the classical theory of point-sets. In this paper, topologies…
There is a very extensive literature dealing with convex polytopes from the standpoints of combinatorics and numerical analysis. By contrast, the current paper adopts an alternative viewpoint that regards a polytope as an autonomous space…
We investigate choice principles in the Weihrauch lattice for finite sets on the one hand, and convex sets on the other hand. Increasing cardinality and increasing dimension both correspond to increasing Weihrauch degrees. Moreover, we…
We study a number of combinatorial and algebraic structures arising from walks on the two-dimensional integer lattice. To a given step set $X\subseteq\mathbb Z^2$, there are two naturally associated monoids: $\mathscr F_X$, the monoid of…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…
We compute structure functions in the Hamiltonian formalism on a momentum lattice using a physically motivated regularisation that links the maximal parton number to the lattice size. We show for the $\phi ^4 _{3+1}$ theory that our method…
In this work we establish a connection between two classical notions, unrelated so far: Harmonic functions on the one hand and absolutely monotonic functions on the other hand. We use this to prove convexity type and propagation of…