Related papers: Applying Generic Coding with Help to Uniformizatio…

The general $d$-position number ${\rm gp}_d(G)$ of a graph $G$ is the cardinality of a largest set $S$ for which no three distinct vertices from $S$ lie on a common geodesic of length at most $d$. This new graph parameter generalizes the…

We investigate the algebraic genericity of various families of continuous functions exhibiting extreme irregularity, focusing on fractal dimensions, H\"older regularity, and fractional differentiability. Our first main result shows that for…

In this paper we focus on functions of the form $A^n\rightarrow \mathcal{P}(B)$, for possibly different arbitrary non-empty sets $A$ and $B$, and where $\mathcal{P}(B)$ denotes the set of all subsets of $B$. These mappings are called…

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…

We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…

We say that a first order formula A distinguishes a graph G from another graph G' if A is true on G and false on G'. Provided G and G' are non-isomorphic, let D(G,G') denote the minimal quantifier rank of a such formula. We prove that, if G…

The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…

This paper is the first from a series of papers that establish a common analogue of the strong component and basilica decompositions for bidirected graphs. A bidirected graph is a graph in which a sign $+$ or $-$ is assigned to each end of…

We investigate the \textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$, there exists a function $f:E(G)\rightarrow \gr$ such that the sums of edge…

This article is centered around generalizing a previous implicit function theorem of the author to be applicable for maps f:E sqcap F to F which can be lifted to Keller C^k_pi maps f_i:E sqcap F_i to F_i with F_i Banach and F=projlim F_i .…

Let $G$ be a finite group. We study the generalized character defined by $\Xi(g)=|G|o(g)$, for $g\in G$, which is closely related to a function that has been very studied recently from a group theoretical point of view.

Let ${\rm Z}(G)$ and ${\rm gp}(G)$ be the zero forcing number and the general position number of a graph $G$, respectively. Known results imply that ${\rm gp}(T)\ge {\rm Z}(T) + 1$ holds for every nontrivial tree $T$. It is proved that the…

Let ${\mathcal A}\subset {\mathcal P}(X)$, $\emptyset, X\in {\mathcal A}$, ${\mathcal A}$ being closed under finite intersections. If $\psi={o},\omega,\gamma$, then $\Psi({\mathcal A})$ is the family of those $\psi$-covers ${\mathcal U}$…

In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

For a graph class $\mathcal G$ and a graph $H$, the four $\mathcal G$-covering numbers of $H$, namely global ${\rm cn}_{g}^{\mathcal{G}}(H)$, union ${\rm cn}_{u}^{\mathcal{G}}(H)$, local ${\rm cn}_{l}^{\mathcal{G}}(H)$, and folded ${\rm…

Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…

Assume $G$ is a connected reductive algebraic group defined over $\bar{\mathbb{F}_p}$ such that $p$ is good prime for $G$. Furthermore we assume that $Z(G)$ is connected and $G/Z(G)$ is simple of classical type. Let $F$ be a Frobenius…

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…