Related papers: A random version of Mazur's lemma
We extend Polyak's theorem on the convexity of joint numerical range from three to any number of quadratic forms on condition that they can be generated by three quadratic forms with a positive definite linear combination. Our new result…
Our aim in this paper is to present a new type of the modular space. This space contains the classical modular space. There are some mappings that do not have contractive condition in the usual modular space but become contraction in this…
In the paper, we generalize some congruences of Lehmer for general composite numbers.
We introduce an infinite set of integer mappings that generalize the well-known Collatz-Ulam mapping and we conjecture that an infinite subset of these mappings feature the remarkable property of the Collatz conjecture, namely that they…
The purpose of this paper is to combine classical methods from transcendental number theory with the technique of restriction to real scalars. We develop a conceptual approach relating transcendence properties of algebraic groups to results…
Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important…
Kelly's combinatorial lemma is a basic tool in the study of Ulam's reconstruction conjecture. A generalization in terms of a family of t-elements subsets of a v-element set was given by Pouzet. We consider a version of this generalization…
To verify the universal validity of the "two-sided" monotonicity condition introduced in [8], we will apply it to include more classical examples. The present paper selects the $L^{p}$ convergence case for this purpose. Furthermore, Theorem…
Expander graphs are fundamental in both computer science and mathematics, with a wide array of applications. With quantum technology reshaping our world, quantum expanders have emerged, finding numerous uses in quantum information theory,…
In this paper we introduce the convex fragment of {\L}ukasiewicz Logic and discuss its possible applications in different learning schemes. Indeed, the provided theoretical results are highly general, because they can be exploited in any…
In this note, the Zorn lemma is extended to arbitrary binary relations and thus the Zorn lemma can do for optimization when the transitivity is broken. Zorn's extended lemma can be used to prove existence theorems of generalized solution…
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
Classical linear regression is considered for a case when regression parameters depend on the external random environment. The last is described as a continuous time Markov chain with finite state space. Here the expected sojourn times in…
We introduce an extension of the standard Local-to-Global Principle used in the proof of the convexity theorems for the momentum map to handle closed maps that take values in a length metric space. This extension is used to study the…
This paper provides versions of classical results from linear algebra, real analysis and convex analysis in a free module of finite rank over the ring $L^0$ of measurable functions on a $\sigma$-finite measure space. We study the question…
The confluence of untyped \lambda-calculus with unconditional rewriting is now well un- derstood. In this paper, we investigate the confluence of \lambda-calculus with conditional rewriting and provide general results in two directions.…
A broad class of optimization problems can be cast in composite form, that is, considering the minimization of the composition of a lower semicontinuous function with a differentiable mapping. This paper investigates the versatile template…
We prove two conjectures posed in 2016 concerning a generalization of the Sawayama-Th\'ebault Theorem and the Sawayama Lemma. We show that this generalized statement can be viewed in Laguerre geometry, which provides a natural framework for…
An old result by Shearer relates the Lov\'asz Local Lemma with the independent set polynomial on graphs, and consequently, as observed by Scott and Sokal, with the partition function of the hard core lattice gas on graphs. We use this…
In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…