Related papers: Algebraic dependence number and cardinality of gen…
The hard-core model can be used to understand the numbers of independent sets in graphs in extremal graph theory. The occupancy fraction, defined as the logarithmic derivative of the independence polynomial of a graph, is a key quantity in…
In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…
In this paper, we study the question of classifying self-similar sets under bi-Lipschitz mappings and obtain an important bi-Lipschitz invariant, which is an ideal of a ring related to IFS. Roughly speaking, different Lipschitz equivalence…
By an independent set in a simple graph $G$, we mean a set of pairwise non-adjacent vertices in $G$. The independence polynomial of $G$ is defined as $I_G(z)=a_0 + a_1 z + a_2 z^2+\cdots+a_\alpha z^{\alpha}$, where $a_i$ is the number of…
An independent set $I_c$ is a \textit{critical independent set} if $|I_c| - |N(I_c)| \geq |J| - |N(J)|$, for any independent set $J$. The \textit{critical independence number} of a graph is the cardinality of a maximum critical independent…
We construct a new graph on 120 vertices whose quantum and classical independence numbers are different. At the same time, we construct an infinite family of graphs whose quantum chromatic numbers are smaller than the classical chromatic…
The integrability condition called shape invariance is shown to have an underlying algebraic structure and the associated Lie algebras are identified. These shape-invariance algebras transform the parameters of the potentials such as…
We study recursively defined functions associated with directed graphs on the k dimensional nonnegative integral lattice. The existence of certain combinatorial structures associated with these function classes are shown to be independent…
The independence polynomial of a graph $G$ is the generating polynomial corresponding to its independent sets of different sizes. More formally, if $a_k(G)$ denotes the number of independent sets of $G$ of size $k$ then \[I(G,z) \as…
We introduce the concepts of dependence and independence in a very general framework. We use a concept of rank to study dependence and independence. By means of the rank we identify (total) dependence with inability to create more…
We formulate and analyze a graphical model selection method for inferring the conditional independence graph of a high-dimensional nonstationary Gaussian random process (time series) from a finite-length observation. The observed process…
Given finite configurations $P_1, \dots, P_n \subset \mathbb{R}^d$, let us denote by $\mathbf{m}_{\mathbb{R}^d}(P_1, \dots, P_n)$ the maximum density a set $A \subseteq \mathbb{R}^d$ can have without containing congruent copies of any…
Roberts, Freudenburg, and Daigle and Freudenburg have given the smallest counterexamples to Hilbert's fourteenth problem as rings of invariants of algebraic groups. Each is of an action of the additive group on a finite dimensional vector…
We study images of equilibrium (Gibbs) states for a class of non-invertible transformations associated to conformal iterated function systems with overlaps $\mathcal S$. We prove exact dimensionality for these image measures, and find a…
Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…
We introduce and study algebraic dynamical systems generated by triangular systems of rational functions. We obtain several results about the degree growth and linear independence of iterates as well as about possible lengths of…
A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in $S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number…
For countably infinite IFSs on $\mathbb R^2$ consisting of affine contractions with diagonal linear parts, we give conditions under which the affinity dimension is an upper bound for the Hausdorff dimension and a lower bound for the lower…
The independence polynomial of a graph $G$ evaluated at $-1$, denoted here as $I(G;-1)$, has arisen in a variety of different areas of mathematics and theoretical physics as an object of interest. Engstr\"om used discrete Morse theory to…
The problem of measuring conditional dependence between two random phenomena arises when a third one (a confounder) has a potential influence on the amount of information between them. A typical issue in this challenging problem is the…