Related papers: Counting Specific Classes of Relations Regarding F…
We study a positive-definite function associated to a measure-preserving equivalence relation on a standard probability space and use it to measure quantitatively the proximity of subequivalence relations. This is combined with a recent…
In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…
Reaction systems are discrete dynamical systems that model biochemical processes in living cells using finite sets of reactants, inhibitors, and products. We investigate the computational complexity of a comprehensive set of problems…
In a couple of previous papers, we initiated a systematic study of semihypergroups and had a thorough discussion on certain analytic and algebraic aspects associated to this class of objects. In this article, we introduce and examine…
A function in a class $\mathcal{F}(X)$ is said to be subdifferentially determined in $\mathcal{F}(X)$ if it is equal up to an additive constant to any function in $\mathcal{F}(X)$ with the same subdifferential. A function is said to be…
We explore a combinatorial bijection between two seemingly unrelated topics: the roots of irreducible polynomials of degree $m$ over a finite field $F_p$ for a prime number $p$ and the number of points that are periodic of order $m$ for a…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
Pippenger's Galois theory of finite functions and relational constraints is extended to the infinite case. The functions involved are functions of several variables on a set $A$ and taking values in a possibly different set $B$, where any…
The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the first in a series of papers in…
This work is devoted to the study of first order linear problems with involution and periodic boundary value conditions. We first prove a correspondence between a large set of such problems with different involutions to later focus our…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
The relation between fixed point and orbit count sequences is investigated from the point of view of linear mappings on the space of arithmetic functions. Spectral and asymptotic properties are derived and several quantities are explicitly…
In this paper, we study the existence of fixed points for mappings defined on complete (compact) metric space (X, d) satisfying a general contractive (contraction) inequality depended on another function. These conditions are analogous to…
Central configurations play an important role in the dynamics of the $n$-body problem: they occur as relative equilibria and as asymptotic configurations in colliding trajectories. We illustrate how they can be found as projective fixed…
We consider transcendental entire functions of finite order for which the zeros and $1$-points are in disjoint sectors. Under suitable hypotheses on the sizes of these sectors we show that such functions must have a specific form, or that…
It is solved a problem of construction of separately continuous functions on the product of compacts with a given discontinuity points set. We obtaine the following results. 1. For arbitrary \v{C}ech complete spaces $X$, $Y$ and a separable…
In discrete convex analysis, various convexity concepts are considered for discrete functions such as separable convexity, L-convexity, M-convexity, integral convexity, and multimodularity. These concepts of discrete convex functions are…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
In this survey article (which hitherto is an ongoing work-in-progress) we present the formulation of the induction and coinduction principles using the language and conventions of each of order theory, set theory, programming languages'…
We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…