Related papers: Minor complexities of finite operations

We explore a definition of complexity based on logic functions, which are widely used as compact descriptions of rules in diverse fields of contemporary science. Detailed numerical analysis shows that (i) logic complexity is effective in…

Let $A$ be a rational function. For any decomposition of $A$ into a composition of rational functions $A=U\circ V$ the rational function $\widetilde A=V\circ U$ is called an elementary transformation of $A$, and rational functions $A$ and…

A k-dissimilarity map on a finite set X is a function D : X \choose k \rightarrow R assigning a real value to each subset of X with cardinality k, k \geq 2. Such functions, also sometimes known as k-way dissimilarities, k-way distances, or…

This is an expository paper about iterations of a smooth real function $f$ on $[0,\varepsilon)$ such that $f(0)=0$, $f'(0)=1$, and $f(x)<x$ for $x>0$, i.e., the sequence defined by $x_{n+1}=f(x_n)$. This sequence has interesting…

Subadditive set functions play a pivotal role in computational economics (especially in combinatorial auctions), combinatorial optimization or artificial intelligence applications such as interpretable machine learning. However, specifying…

A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is…

Let $M$ be strongly minimal and constructed by a `Hrushovski construction'. If the Hrushovski algebraization function $\mu$ is in a certain class ${\mathcal T}$ ($\mu$ triples) we show that for independent $I$ with $|I| >1$, ${\rm…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k< n$, if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph is minimal if for every edge, the deletion of…

We present an overview of the meaningful aggregation functions mapping ordinal scales into an ordinal scale. Three main classes are discussed, namely order invariant functions, comparison meaningful functions on a single ordinal scale, and…

A family $\bfam$ of continuous real-valued functions on a space $X$ is said to be {\sl basic} if every $f \in C(X)$ can be represented $f = \sum_{i=1}^n g_i \circ \phi_i$ for some $\phi_i \in \bfam$ and $g_i \in C(\R)$ ($i=1, ..., n$).…

This paper exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes. These results fall into the general domain of logic-based approaches to complexity theory and so-called implicit computational…

Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…

The \it{Ambient Logic} (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semistructured data. We study some basic questions concerning the…

Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be determined by performing a test, which incurs some cost. The…

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…

Let $u\not\equiv -\infty$ be a subharmonic function on the complex plane $\mathbb C$. In 2016, we obtained a result on the existence of an entire function $f\neq 0$ satisfying the estimate $\log|f|\leq {\sf B}_u$ on $\mathbb C$, where…

We compare several complexity measures for self-mappings of finite fields. In particular, we show that Carlitz rank and additive index cannot be small simultaneously up to trivial exceptions. That is, these two measures detect cryptographic…

We propose a functional view of matrix decomposition problems on graphs such as geometric matrix completion and graph regularized dimensionality reduction. Our unifying framework is based on the key idea that using a reduced basis to…

It is known that rational approximations of elementary analytic functions (exp, log, trigonometric, and hyperbolic functions, and their inverse functions) are computable in the weak complexity class $\mathrm{TC}^0$. We show how to formalize…