arXiv subjects
Publications and source records attributed to Masato Kobayashi.
We show new integral representations for dilogarithm and trilogarithm functions on the unit interval. As a consequence, we also prove (1) new integral representations for Apery, Catalan constants, and Legendre chi functions of order 2, 3, (2) a lower bound for the dilogarithm function on the unit interval, (3) new Euler sums.
Following Aguiló-Suñer-Torrens (2008), Kolesárová-Mesiar-Mordelová-Sempi (2006) and Mayor-Suñer-Torrens (2005), we continue to develop a theory of matrix representation for discrete copulas. To be more precise, we give characterizations of meet-irreducible discrete copulas from an order-theoretical aspect: we show that the set of all irreducible discrete copulas is a lattice in analogy with Nelsen and Úbeda-Flores (2005). Moreover, we clarify its lattice structure related to Kendall's $τ$ and Spearman's $ρ$ borrowing ideas from Coxeter groups.
We prove new relations on zeta function at even arguments and Dirichlet $L$ function at odd. The key idea is to make use of the Taylor series and partial fraction decomposition of cotangent and secant functions as we discuss in calculus and complex analysis.
We introduce Möbius functions of higher rank, a new class of arithmetic functions so that the classical Möbius function is of rank 2. With this idea, we evaluate Dirichlet series on the sum of the reciprocal square of all $r$-free numbers. For the proof, the Riemann zeta function and cyclotomic polynomials play a key role.
We show four new integral representations for $ζ(3)$ as a reformulation of Ewell (1990) and Yue-Williams (1993) with the inverse sine function and Wallis integral. As a consequence, we also show a local integral representation for the trilogarithm function.
At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer the combinatorial question on some particular relation of Euler numbers proved by Heneghan-Petersen, Power series for up-down min-max permutations, College Math. Journal, Vol. 45, No. 2 (2014), 83-91.
We extend the author's formula (2011) of weighted counting of inversions on permutations to the one on alternating sign matrices. The proof is based on the sequential construction of alternating sign matrices from the unit matrix recently shown by Brualdi-Schroeder and the author (both 2017) independently.
We develop combinatorics of parabolic double cosets in finite Coxeter groups as a follow-up of recent articles by Billey-Konvalinka-Petersen-Slofstra-Tenner and Petersen. (1) We construct a double coset system as a generalization of a two-sided analogue of a Coxeter complex and present its order structure with its local dimension function on certain connected components. As applications of double cosets to Bruhat graphs, we also prove: (2) every parabolic double coset is regular, (3) invariance of degree on Bruhat graph on lower intervals as an analogy of the one for Kazhdan-Lusztig polynomials, (4) every noncritical Bruhat interval satisfies out-Eulerian property.
We revisit $R$-polynomials with introducing the new idea ``shifted $R$-polynomials" (or Bruhat weight) for all Bruhat intervals in finite Coxeter groups. Then, we apply these polynomials to weighted counting of Bruhat paths. Further, we prove a new criterion of irregularity of lower intervals as analogy of Carrell-Peterson's and Dyer's results. Also, we present the upper bound of shifted $R$-polynomials for Bruhat intervals of fixed length by Jacobsthal numbers.
We introduce a new directed graph structure into the set of alternating sign matrices. This includes Bruhat graph (Bruhat order) of the symmetric groups as a subgraph (subposet). Drake-Gerrish-Skandera (2004, 2006) gave characterizations of Bruhat order in terms of total nonnegativity (TNN) and subtraction-free Laurent (SFL) expressions for permutation monomials. With our directed graph, we extend their idea in two ways: first, from permutations to alternating sign matrices; second, $q$-analogs (which we name $q$TNN and $q$SFL properties). %In our discussion, essential sets, introduced by Fulton in a rather different context, play a key role. As a by-product, we obtain a new kind of permutation statistic, the signed bigrassmannian statistics, using Dodgson's condensation on determinants.
As an application of linear algebra for enumerative combinatorics, we introduce two new ideas, signed bigrassmannian polynomials and bigrassmannian determinant. First, a signed bigrassmannian polynomial is a variant of the statistic given by the number of bigrassmannian permutations below a permutation in Bruhat order as Reading suggested (2002) and afterward the author developed (2011). Second, bigrassmannian determinant is a $q$-analog of the determinant with respect to our statistic. It plays a key role for a determinantal expression of those polynomials. We further show that bigrassmannian determinant satisfies weighted condensation as a generalization of Dodgson, Jacobi-Desnanot and Robbins-Rumsey (1986).
We show that any lower Bruhat interval in a Coxeter group is a disjoint union of certain two-sided cosets as a consequence of Lifting Property and Subword Property. Furthermore, we describe these details in terms of Bruhat graphs, graded posets, and two-sided quotients altogether. For this purpose, we introduce some new ideas, quotient lower intervals and quotient Bruhat graphs.
From a combinatorial perspective, we establish three inequalities on coefficients of $R$- and Kazhdan-Lusztig polynomials for crystallographic Coxeter groups: (1) Nonnegativity of $(q-1)$-coefficients of $R$-polynomials, (2) a new criterion of rational singularities of Bruhat intervals by sum of quadratic coefficients of $R$-polynomials, (3) existence of a certain strict inequality (coefficientwise) of Kazhdan-Lusztig polynomials. Our main idea is to understand Deodhar's inequality in a connection with a sum of $R$-polynomials and edges of Bruhat graphs.
In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly below a permutation in Bruhat order in the symmetric groups. For the proof, we use equivalent characterizations of bigrassmannian permutations by Lascoux-Schutzenberger and Reading.