Related papers: $p$-Modulus on radially symmetric trees
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Let $G$ be a simple connected graph on $n$ vertices, and let $\lambda_1(G),\lambda_2(G),\ldots,\lambda_n(G)$ be the eigenvalues of its adjacency matrix $A(G)$. For $p>0$, define the $p$-energy of $G$ by $\mathcal E_p(G)=\sum_{i=1}^n…
We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…
This thesis has three goals related to the automorphism groups of finite $p$-groups. The primary goal is to provide a complete proof of a theorem showing that, in some asymptotic sense, the automorphism group of almost every finite…
We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…
We show some basic facts about dp-minimal ordered structures. The main results are : dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has non-empty interior, and any theory of pure…
We study the problem of finding, in a directed graph, an st-walk of length r mod q which is edge-minimum, i.e., uses the smallest number of distinct edges. Despite the vast literature on paths and cycles with modularity constraints, to the…
In the representation theory of real reductive Lie groups, many objects have finiteness properties. For example, the lengths of Verma modules and principal series representations are finite, and more precisely, they are bounded. In this…
Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition…
Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…
Given a rooted point set $P$, the rooted $y-$Monotone Minimum Spanning Tree (rooted $y-$MMST) of $P$ is the spanning geometric graph of $P$ in which all the vertices are connected to the root by some $y-$monotone path and the sum of the…
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and graphings. These approach have been unified and generalized by authors in a…
For any truncated path algebra $\Lambda$, we give a structural description of the modules in the categories ${\cal P}^{<\infty}(\Lambda\text{-mod})$ and ${\cal P}^{<\infty}(\Lambda\text{-Mod})$, consisting of the finitely generated (resp.…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
Monadic second order logic can be used to express many classical notions of sets of vertices of a graph as for instance: dominating sets, induced matchings, perfect codes, independent sets or irredundant sets. Bounds on the number of sets…
The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions…
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…