Related papers: Semigroups of rational functions: some problems an…
We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…
We propose an integration of possibility theory into non-classical logics. We obtain many formal results that generalize the case where possibility and necessity functions are based on classical logic. We show how useful such an approach is…
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been many attempts to find notions of conjugacy in semigroups that would be useful in special…
We develop notions of integrable functions within the theory of schemic motivic integration.
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…
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…
The paper gives some criteria for partial sums of rational number sequences to be not rational functions and to be not algebraic functions. As an application, we study partial sums of some famous rational number sequences in mathematical…
Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…
Probabilistic Soft Logic has been proposed and used in several applications as an efficient way to deal with inconsistency, uncertainty and relational representation. In several applications, this approach has led to an adequate description…
Skew idempotent functionals of ordered semirings are studied. Different associative and non-associative semirings are considered. Theorems about properties of skew idempotent functionals are proved. Examples are given.
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
The set of increasing functions on the rational numbers, equipped with the composition operation, naturally forms a topological semigroup with respect to the topology of pointwise convergence in which a sequence of increasing functions…
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…
In this paper we give a brief review of semiparametric theory, using as a running example the common problem of estimating an average causal effect. Semiparametric models allow at least part of the data-generating process to be unspecified…
We define and study notions of amenability and skew-amenability of continuous actions of topological groups on compact topological spaces. Our main motivation is the question under what conditions amenability of a topological group passes…
We strengthen certain known results saying that separately regular functions are rational and separately Nash functions are semialgebraic. The approach presented here unifies and highlights the similarities between the two problems.
The notion \emph{Perron-Frobenius theory} usually refers to the interaction between three properties of operator semigroups: positivity, spectrum and long-time behaviour. These interactions gives rise to a profound theory with plenty of…
This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same…