Related papers: The weighted hook-length formula II: Complementary…
We give four new proofs of the directed version of Brook's Theorem and an NP-completeness result.
An exact closed form solution for the return probability of a random walk on the Bethe lattice is given. The long-time asymptotic form confirms a previously known expression. It is however shown that this exact result reduces to the proper…
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in…
In this paper, we define two kinds of hook length for internal vertices of complete $m$-ary trees, and deduce their corresponding hook length formulas, which generalize the main results obtained by Du and Liu.
We give a probabilistic proof of the orbit-counting lemma.
In [3, Theorem 6.7B], the authors use the Main Theorems of Brauer to give a proof of Burnside's Normal $p$-complement Theorem. Unfortunately, the proof contains an error. We take this opportunity to give a proof along similar lines,…
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete…
In [1], Theorem 3, the authors proved, in one dimension, a generalization of the Hopf Lemma, and the question arose if it could be extended to higher dimensions. In this paper we present two conjectures as possible extensions, and give a…
Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…
The primary purpose of this article is to prove a tightness of skew random walks. The tightness result implies, in particular, that the skew Brownian motion can be constructed as the scaling limit of such random walks. Our proof of…
We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…
In this paper, we study the overlap distribution and Gibbs measure of the Branching Random Walk with Gaussian increments on a binary tree. We first prove that the Branching Random Walk is 1 step Replica Symmetry Breaking and give a precise…
We prove a weighted analogue of the Khintchine-Groshev Theorem, where the distance to the nearest integer is replaced by the absolute value. This is subsequently applied to proving the optimality of several linear independence criteria over…
We consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…
The method of exhaustion is generalized to a simple formula that can be used to integrate functions under very general conditions, provided that the integral exists. Both a geometric proof (following the usual procedure for the method of…
The purpose of this article has two fold. The first is to generalize some recent second main theorems for the mappings and moving hyperplanes of $\P^n(\C)$ to the case where the counting functions are truncated multiplicity (by level $n$)…
We demonstrate that the large-N expansion of Wilson loop expectation values in SO(N) and Sp(N) Yang-Mills theory on orientable and nonorientable surfaces has a natural description as a weighted sum over covers of the given surface. The sum…
For a random walk killed at leaving a cone we suggest two new constructions of a positive harmonic function. These constructions allow one to remove a quite strong extendability assumption, which has been imposed in our previous paper…
We present a short and self-contained proof of the choosability version of Brooks' theorem.
In this paper we investigate enumeration of some classes of $n$-character strings and binary necklaces. Recall that binary necklaces are necklaces in two colors with length $n$. We prove three results (Theorems 1, 1' and 2) concerning the…