Related papers: The weighted hook-length formula II: Complementary…
Boolean functions can be used to construct binary linear codes in many ways, and vice versa. The objective of this short article is to point out a connection between the weight distributions of all projective binary linear codes and the…
We obtain a derivative formula for various notions of capacity. Namely we identify the second order term in the asymptotic expansion of the capacity of a union of two sets, as their distance goes to infinity. Our result applies to the usual…
We consider a one-dimensional simple random walk surviving among a field of static soft traps : each time it meets a trap the walk is killed with probability 1--e --$\beta$ , where $\beta$ is a positive and fixed parameter. The positions of…
In this note, we show how to apply the original $L^2$-extension theorem of Ohsawa and Takegoshi to the standard basis of a multiplier ideal sheaf associated with a plurisubharmonic function. In this way, we are able to reprove the strong…
Loop-weighted walk with parameter $\lambda\geq 0$ is a non-Markovian model of random walks that is related to the loop $O(N)$ model of statistical mechanics. A walk receives weight $\lambda^{k}$ if it contains $k$ loops; whether this is a…
A maximum likelihood method is used to deal with the combined estimation of multi-measurements of a branching ratio, where each result can be presented as an upper limit. The joint likelihood function is constructed using observed spectra…
We present a conjectual hook formula concerning the number of the standard tableaux on "cylindric" skew diagrams. Our formula can be seen as an extension of Naruse's hook formula for skew diagrams. Moreover, we prove our conjecture in some…
In this note we prove a weighted version of the Khintchine inequalities.
In this paper we answer a question posed by R. Stanley in his collection of Bijection Proof Problems (Problem 240). We present a bijective proof for the enumeration of walks of length $k$ a chess rook can move along on an $m\times n$ board…
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
We propose another proof of the high dimensional spectrum convergence of the weighted sample covariance, more concise and self-sufficient but with stronger, but reasonable assumptions. We explain and illustrates this theorem for different…
We consider the minimum of a super-critical branching random walk. Addario-Berry and Reed [Ann. Probab. 37 (2009) 1044-1079] proved the tightness of the minimum centered around its mean value. We show that a convergence in law holds, giving…
The forcing relation of braids has been introduced for a 2-dimensional analogue of the Sharkovskii order on periods for maps of the interval. In this paper, by making use of the Nielsen fixed point theory and a representation of braid…
We establish new results on weighted $L^2$ extension of holomorphic top forms with values in a holomorphic line bundle, from a smooth hypersurface cut out by a holomorphic function. The weights we use are determined by certain functions…
We continue our study of critical branching random walk and branching capacity. In this paper we introduce branching recurrence and branching transience and prove an analogous version of Wiener's Test.
We establish weak and strong law of large numbers for a class of branching symmetric Hunt processes with the branching rate being a smooth measure with respect to the underlying Hunt process, and the branching mechanism being general and…
This work introduces the notion of edge oriented reinforced random walk which proposes in a general framework an alternative understanding of the annealed law of random walks in random environment.
We consider a model for a one-sided limit order book proposed by Lakner et al. We show that it can be coupled with a branching random walk and use this coupling to answer a non-trivial question about the long-term behavior of the price. The…
In this paper, we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the…
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with…