Related papers: Algebraic dependence number and cardinality of gen…
The independent set problem, ISP for short, asks for the maximal number of vertices in a (large) graph which can be occupied such that none of them are neighbors. We address the question from a statistical mechanics perspective, in the case…
Let $G=(V, E)$ be a graph. A set $S\subseteq V(G)$ is a {\it dominating set} of $G$ if every vertex in $V\setminus S$ is adjacent to a vertex of $S$. The {\it domination number} of $G$, denoted by $\gamma(G)$, is the cardinality of a…
A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called an $s$-distance set if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality $s$. In this paper…
We consider families of geometries of D--dimensional space, described by a finite number of parameters. Starting from the De Witt metric we extract a unique integration measure which turns out to be a geometric invariant, i.e. independent…
We study probabilistic iterated function systems (IFS), consisting of a finite or infinite number of average-contracting bi-Lipschitz maps on R^d. If our strong open set condition is also satisfied, we show that both upper and lower bounds…
Probabilistic independence can dramatically simplify the task of eliciting, representing, and computing with probabilities in large domains. A key technique in achieving these benefits is the idea of graphical modeling. We survey existing…
Consider the zero set of the random power series f(z)=sum a_n z^n with i.i.d. complex Gaussian coefficients a_n. We show that these zeros form a determinantal process: more precisely, their joint intensity can be written as a minor of the…
Nagata's famous counterexample to Hilbert's fourteenth problem shows that the ring of invariants of an algebraic group action on an affine algebraic variety is not always finitely generated. In some sense, however, invariant rings are not…
In this paper, we define inhomogeneous Graph-Directed (GD) separation conditions for a given inhomogeneous GD Iterated Function Systems (IFS), and estimate the upper box dimension of attractors by the dimension of the condensation set and…
We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…
Identifiability of discrete statistical models with latent variables is known to be challenging to study, yet crucial to a model's interpretability and reliability. This work presents a general algebraic technique to investigate…
Measuring conditional independence is one of the important tasks in statistical inference and is fundamental in causal discovery, feature selection, dimensionality reduction, Bayesian network learning, and others. In this work, we explore…
An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching.…
Recently the algebraic structure of gauge-invariant operators in multi-matrix quantum mechanics has been clarified: this space forms a module over a freely generated ring. The ring is generated by a set of primary invariants, while the…
Consider a unimodular random graph, or just a finitely generated Cayley graph. When does its cycle space have an invariant random generating set of cycles such that every edge is contained in finitely many of the cycles? Generating the free…
We investigate the rupture of invariant tubes in a class of nonautonomous dynamical systems arising from time-dependent Ermakov-type equations. Starting from an exactly tube-integrable reference system, we analyze a time-dependent invariant…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
We first extend the Peierls algebra of gauge invariant functions from the space ${\cal S}$ of classical solutions to the space ${\cal H}$ of histories used in path integration and some studies of decoherence. We then show that it may be…
In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics, that if a given algebraic hypergraph is "dense" in a…
The concept of integro-differential algebra has been introduced recently in the study of boundary problems of differential equations. We generalize this concept to that of integro-differential algebra with a weight, in analogy to the…