Related papers: Some further construction methods for uninorms via…
This paper makes the following original contributions. First, we develop a unifying framework for testing shape restrictions based on the Wald principle. The test has asymptotic uniform size control and is uniformly consistent. Second, we…
We construct Poisson brackets at boundaries of open strings and membranes with constant background fields which are compatible with their boundary conditions. The boundary conditions are treated as primary constraints which give infinitely…
The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…
The main aim of the present note is to consider bounded orthomorphisms between locally solid vector lattices. We establish a version of the remarkable Zannen theorem regarding equivalence between orthomomorphisms and the underlying vector…
In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…
We derive exact reconstruction methods for cracks consisting of unions of Lipschitz hypersurfaces in the context of Calder\'on's inverse conductivity problem. Our first method obtains upper bounds for the unknown cracks, bounds that can be…
The combinatorial hierarchical hyperbolicity criterion is a very useful way of constructing new hierarchically hyperbolic spaces (HHSs). We show that, conversely, HHSs satisfying natural assumptions (satisfied, for example, by mapping class…
There are several known constructions of equilibrium states for H\"older continuous potentials in the context of both subshifts of finite type and uniformly hyperbolic systems. In this article we present another method of building such…
An upper bound on operator norms of compound matrices is presented, and special cases that involve the $\ell_1$, $\ell_2$ and $\ell_\infty$ norms are investigated. The results are then used to obtain bounds on products of the largest or…
We give some new estimates for the norm and essential norm of a weighted composition operator on the Bloch space. As corollaries, we obtain some new characterizations of the boundedness and compactness of a weighted composition operator on…
We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on the Cartesian plane. Connections to the Fibonacci sequence,…
We develop an approach for the treatment of one--dimensional bounded quantum--mechanical models by straightforward modification of a successful method for unbounded ones. We apply the new approach to a simple example and show that it…
In many applications of Structural Engineering the following question arises: given a set of forces $\mathbf{f}_1,\mathbf{f}_2,\dots,\mathbf{f}_N$ applied at prescribed points $\mathbf{x}_1,\mathbf{x}_2,\dots,\mathbf{x}_N$, under what…
In this work, constructions of ordered covering arrays are discussed and applied to obtain new upper bounds on covering codes in Rosenbloom-Tsfasman spaces (RT spaces), improving or extending some previous results.
We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…
We propose a compositional approach to construct subspaces consisting entirely of r-uniform states, including the ones in heterogeneous systems. The approach allows one to construct new objects from old ones: it combines encoding isometries…
This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…
The so-called min-sum algorithm has been applied for decoding lattices constructed by Construction D'. We generalize this iterative decoding algorithm to decode lattices constructed by Construction D. An upper bound on the decoding…
We initiate the study of general metric lattices in the context of the model theory of metric structures. As an application we develop a theory of pseudo-finite limits of partition lattices and connect this theory with the theory of…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…