Related papers: Some simple theories from a Boolean algebra point …

The Appell-type polynomial family corresponding to the simplest non-commutative derivative operator turns out to be connected with the Boolean probability theory, the simplest of the three universal non-commutative probability theories (the…

The primary objective of this section is to demonstrate that the actual pseudorandom measures of our construction are significantly smaller than the theoretical upper bounds derived from the Weil theorem. Regarding the family of sequences,…

We study the interplay between properties of measures on a Boolean algebra A and forcing names for ultrafilters on A. We show that several well known measure theoretic properties of Boolean algebras (such as supporting a strictly positive…

A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…

Every countable directed graph generates a Fock space Hilbert space and a family of partial isometries. These operators also arise from the left regular representations of free semigroupoids derived from directed graphs. We develop a…

By a result known as Rieger's theorem (1956), there is a one-to-one correspondence, assigning to each cyclically ordered group $H$ a pair $(G,z)$ where $G$ is a totally ordered group and $z$ is an element in the center of $G$, generating a…

Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmic problems become easier on arbitrary classes of bounded…

Color refinement is an important technique that works very well in practice for the graph isomorphism problem. Tinhofer graphs are the class of graphs for which refinement together with individualization correctly tests graph isomorphism…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…

We deal with consistency results for the existence of universal models in natural classes of models (more exactly--a somewhat weaker version). We apply a result on quite general family to T_feq and to the class of triangle-free graphs.

the main theorem gives a sufficient condition for a n elements of SL(2,R) to generate a free group.The idea behind it is to use a nonorientable version of the Dehn-Wolpert-Goldman twist and to sew it with the original representation of a…

Estimating the probability that the Erd\H{o}s-R\'enyi random graph $G(n,m)$ is $H$-free, for a fixed graph $H$, is one of the fundamental problems in random graph theory. If $m$ is such that each edge of $G(n,m)$ belongs to a copy of $H'$…

Let $G = (V,E)$ be a graph and $k \ge 0$ an integer. A $k$-independent set $S \subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\alpha_k(G)$ we denote the maximum cardinality of…

Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze};…

Bilateral agreement based random undirected graphs were introduced and analyzed by La and Kabkab in 2015. The construction of the graph with $n$ vertices in this model uses a (random) preference order on other $n-1$ vertices and each vertex…

In this paper, we develop a quantitative K-theory for filtered C*-algebras. Particularly interesting examples of filtered C*-algebras include group C*-algebras, crossed product C*-algebras and Roe algebras. We prove a quantitative version…

Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

Given a graph $G$ and an integer $k$, a token addition and removal ({\sf TAR} for short) reconfiguration sequence between two dominating sets $D_{\sf s}$ and $D_{\sf t}$ of size at most $k$ is a sequence $S= \langle D_0 = D_{\sf s}, D_1…