arXiv subjects
Publications and source records attributed to Yasuhide Numata.
In this article, we consider the words with cyclic indices. For given $s$, we consider the pair $(\iota,\kappa)$ of indices such that the word of length $s$ from $\iota$ is equal to the word of length $s$ from $\kappa$. We give a characterization of such pairs for a cyclic Fibonacci word, and give the number of them.
In this article, we consider the multiarrangements whose underlying arrangements are the Coxeter arrangement of type $B_2$. For some special multiplicities, we give an explicit description of bases for the derivation modules. As an application, we also describe the lower derivations of bases for the derivation modules of some Coxeter multiarrangements of type $A_2$, which are different from ones given by Wakamiko.
In this article, we consider the weighted generating function of matchings in the complete graph. We define an Artinian Gorenstein algebra as the quotient ring of a polynomial ring by the annihilator of the generating function. We show the strong Lefschetz property of the algebra.
Given a finite quiver (directed graph) without loops and multiedges, the convex hull of the column vector of the incidence matrix is called the directed edge polytope and is an interesting example of lattice polytopes. In this paper, we give a complete characterization of facets of the directed edge polytope of an arbitrary finite quiver without loops and multiedges in terms of the connectivity and the existence of a rank function. Our result can be regarded as an extension of the result of Higashitani et al. on facets of symmetric edge polytopes to directed edge polytopes. When the quiver in question has a rank function, we obtain a characterization of faces of arbitrary dimensions.
In this article, we consider involutions, called togglings, on the set of independent sets of the Dynkin diagram of type A, or a path graph. We are interested in the action of the subgroup of the symmetric group of the set of independent sets generated by togglings. We show that the subgroup coincides with the symmetric group.
In this article, we consider the monomial complete intersection algebra $\mathbb{K}[x,y]/\langle x^d,y^q\rangle$ in two variables. For elements $l_1,\ldots,l_{d+q-2k}$ of degree $1$, we give a formula of the deteminant of linear map from the homogeneous component of degree $k$ to the homogenous component of degree $d+q-k$ defined by the multiplication of $l_1 \cdots l_{d+q-2k}$.
We introduce a new algebra associated with a hyperplane arrangement $\mathcal{A}$, called the Solomon-Terao algebra $\mbox{ST}(\mathcal{A},η)$, where $η$ is a homogeneous polynomial. It is shown by Solomon and Terao that $\mbox{ST}(\mathcal{A},η)$ is Artinian when $η$ is generic. This algebra can be considered as a generalization of coinvariant algebras in the setting of hyperplane arrangements. The class of Solomon-Terao algebras contains cohomology rings of regular nilpotent Hessenberg varieties. We show that $\mbox{ST}(\mathcal{A},η)$ is a complete intersection if and only if $\mathcal{A}$ is free. We also give a factorization formula of the Hilbert polynomials when $\mathcal{A}$ is free, and pose several related questions, problems and conjectures.
We define specific multiplicities on the braid arrangement by using edge-bicolored graphs. To consider their freeness, we introduce the notion of bicolor-eliminable graphs as a generalization of Stanley's classification theory of free graphic arrangements by chordal graphs. This generalization gives us a complete classification of the free multiplicities defined above. As an application, we prove one direction of a conjecture of Athanasiadis on the characterization of the freeness of the deformation of the braid arrangement in terms of directed graphs.
Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which coincides with $f$. We call it the minimal polynomial of $f$. It is in general a non-trivial task to find a concrete expression of the minimal polynomial of a given function, which has only been worked out for limited classes of functions in the literature. In this paper, we study minimal polynomial expressions of several functions that are closely related to some practically important procedures such as auction and voting.
A schemoid is a generalization of association schemes from the point of view of small categories. In this article, we discuss schemoid structures for two kinds of small categories; the canonical small category defined by a poset, and another small category which arises a poset. We also discuss the schemoid algebra, that is an analogue of the Bose--Mesner algebra for an association scheme, for them.
In this paper, we consider categories with colored morphisms and functors such that morphisms assigned to morphisms with a common color have a common color. In this paper, we construct a morphism-colored functor such that any morphism-colored functor from a given small morphism-colored groupoid to any discrete morphism-colored category factors through it. We also apply the main result to a schemoid constructed from a Hamming scheme.
We consider pairs of a set-valued column-strict tableau and a reverse plane partition of the same shape. We introduce algortithms for them, which implies a bijective proof for the finite sum Cauchy identity for Grothendieck polynomials and dual Grothendieck polynomials.
It is known that any $n$-variable function on a finite prime field of characteristic $p$ can be expressed as a polynomial over the same field with at most $p^n$ monomials. However, it is not obvious to determine the polynomial for a given concrete function. In this paper, we study the concrete polynomial expressions of the carries in addition and multiplication of $p$-ary integers. For the case of addition, our result gives a new family of symmetric polynomials, which generalizes the known result for the binary case $p = 2$ where the carries are given by elementary symmetric polynomials. On the other hand, for the case of multiplication of $n$ single-digit integers, we give a simple formula of the polynomial expression for the carry to the next digit using the Bernoulli numbers, and show that it has only $(n+1)(p-1)/2 + 1$ monomials, which is significantly fewer than the worst-case number $p^n$ of monomials for general functions. We also discuss applications of our results to cryptographic computation on encrypted data.
In this paper, we specify a class of mathematical problems, which we refer to as "Function Density Problems" (FDPs, in short), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1), and constructions of provably secure pseudorandom generators (PRGs) with some enhanced security property introduced by Dubrov and Ishai [STOC 2006]. Our argument aims at proposing new theoretical frameworks for these topics (especially for the former) based on FDPs, rather than providing some concrete and practical results on the topics. We also give some examples of mathematical discussions on FDPs, which would be of independent interest from mathematical viewpoints. Finally, we discuss possible directions of future research on other cryptographic applications of FDPs and on mathematical studies on FDPs themselves.
The Baues--Wirsching cohomology is one of the cohomologies of a small category. Our aim is to describe the first Baues--Wirsching cohomology of the small category generated by a finite quiver freely. We consider the case where the coefficient is a natural system obtained by the composition of a functor and the target functor. We give an algorithm to obtain generators of the vector space of inner derivations. It is known that there exists a surjection from the vector space of derivations of the small category to the first Baues--Wirsching cohomology whose kernel is the vector space of inner derivations.
We discuss families of triples of graphs whose Hosoya indices are primitive Pythagorean triples. Hosoya gave a method to construct such families of caterpillars, i.e., trees whose vertices are within distance 1 of a central path. He also pointed out a common structure to the families, and conjectured the uniqueness of the structure. In this paper, we give an answer to his conjecture.
We apply the holonomic gradient method introduced by Nakayama et al.(2011) to the evaluation of the exact distribution function of the largest root of a Wishart matrix, which involves a hypergeometric function 1F1 of a matrix argument. Numerical evaluation of the hypergeometric function has been one of the longstanding problems in multivariate distribution theory. The holonomic gradient method offers a totally new approach, which is complementary to the infinite series expansion around the origin in terms of zonal polynomials. It allows us to move away from the origin by the use of partial differential equations satisfied by the hypergeometric function. From numerical viewpoint we show that the method works well up to dimension 10. From theoretical viewpoint the method offers many challenging problems both to statistics and D-module theory.
We prove the Lefschetz property for a certain class of finite-dimensional Gorenstein algebras associated to matroids. Our result implies the Sperner property of the vector space lattice. More generally, it is shown that the modular geometric lattice has the Sperner property. We also discuss the Gröbner fan of the defining ideal of our Gorenstein algebra.