output
20012024
most citedHolonomic Gradient Method for Two Way Contingency Tables

5 citations

18 papers

math.CO2024

Regular Flips in mptopcom

Lars Kastner

A triangulation of a point configuration is regular if it can be given by a height function, that is every point gets lifted to a certain height and projecting the lower convex hul…

cs.DM2020★ 2 cited

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems

Kazuya Haraguchi, Hiroshi Nagamochi

In this paper, as a new notion, we define a transitive system to be a set system on a finite set of elements such that every three sets $X,Y,Z\…

cs.DM2020

Polynomial-delay Enumeration Algorithms in Set Systems

Kazuya Haraguchi, Hiroshi Nagamochi

We consider a set system on a finite set of elements, where we call a set a component. We assume that two oracles $\mathrm{…

econ.TH2019★ 1 cited

Contract Design with Costly Convex Self-Control

Yusufcan Masatlioglu, Daisuke Nakajima, Emre Ozdenoren

In this note, we consider the pricing problem of a profit-maximizing monopolist who faces naive consumers with convex self-control preferences.

cs.DS2019

Maximum Weighted Matching with Few Edge Crossings for 2-Layered Bipartite Graph

Kazuya Haraguchi, Kotaro Torii, Motomu Endo

Let c denote a non-negative constant. Suppose that we are given an edge-weighted bipartite graph G=(V,E) with its 2-layered drawing and a family X of intersecting edge pairs. We co…

math.CA2019

Lauricella's with finite irreducible monodromy group

Yoshiaki Goto

We study the conditions under which the monodromy group for Lauricella's hypergeometric function is finite irreducible. We give the conditions in terms of the param…

math.AG2018★ 3 cited

Picard-Vessiot groups of Lauricella's hypergeometric systems and Calabi-Yau varieties arising integral representations

Yoshiaki Goto, Kenji Koike

We study the Zariski closure of the monodromy group of Lauricella's hypergeometric function . If the identity component acts irreducibly, then…

stat.ML2018★ 2 cited

Momentum-Space Renormalization Group Transformation in Bayesian Image Modeling by Gaussian Graphical Model

Kazuyuki Tanaka, Masamichi Nakamura, Shun Kataoka +2

A new Bayesian modeling method is proposed by combining the maximization of the marginal likelihood with a momentum-space renormalization group transformation for Gaussian graphica…

math.CA2018★ 5 cited

Holonomic Gradient Method for Two Way Contingency Tables

Yoshihito Tachibana, Yoshiaki Goto, Tamio Koyama +1

The holonomic gradient method gives an algorithm to efficiently and accurately evaluate normalizing constants and their derivatives. We apply the holonomic gradient method in the c…

stat.ML2017★ 4 cited

Linear-Time Algorithm in Bayesian Image Denoising based on Gaussian Markov Random Field

Muneki Yasuda, Junpei Watanabe, Shun Kataoka +1

In this paper, we consider Bayesian image denoising based on a Gaussian Markov random field (GMRF) model, for which we propose an new algorithm. Our method can solve Bayesian image…

math.AG2017

Irreducibility of the monodromy representation of Lauricella's

Yoshiaki Goto, Keiji Matsumoto

Let be the hypergeometric system of differential equations satisfied by Lauricella's hypergeometric series of variables. We show that the monodromy representation o…

math.NT2016★ 3 cited

Zeros of the first derivative of Dirichlet -functions

Hirotaka Akatsuka, Ade Irma Suriajaya

Yıldırım has classified zeros of the derivatives of Dirichlet -functions into trivial zeros, nontrivial zeros and vagrant zeros. In this paper we remove the possibility of vagra…

stat.AP2015★ 1 cited

Macroeconomic Forecasting and Variable Selection with a Very Large Number of Predictors: A Penalized Regression Approach

Yoshimasa Uematsu, Shinya Tanaka

This paper studies macroeconomic forecasting and variable selection using a folded-concave penalized regression with a very large number of predictors. The penalized regression app…

cs.DM2014★ 1 cited

On A Generalization of "Eight Blocks to Madness"

Kazuya Haraguchi

We consider a puzzle such that a set of colored cubes is given as an instance. Each cube has unit length on each edge and its surface is colored so that what we call the Surface Co…

cs.DS2014★ 1 cited

An Efficient Local Search for Partial Latin Square Extension Problem

Kazuya Haraguchi

A partial Latin square (PLS) is a partial assignment of n symbols to an nxn grid such that, in each row and in each column, each symbol appears at most once. The partial Latin squa…

cs.DM2009★ 1 cited

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono +1

A -total labeling of a graph is an assignment from the vertex set and the edge set to the set of nonnegative integers such that $|f(x)-…

cs.DS2008

A linear time algorithm for L(2,1)-labeling of trees

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono +1

An L(2,1)-labeling of a graph is an assignment from the vertex set to the set of nonnegative integers such that if and are adjacent and $|…

astro-ph2001★ 3 cited

Quasi-self-similar evolution of the two-point correlation function: strongly nonlinear regime in Omega_0 < 1 universes

Tatsushi Suginohara, Atsushi Taruya, Yasushi Suto

The well-known self-similar solution for the two-point correlation function of the density field is valid only in an Einstein-de Sitter universe. We attempt to extend the solution…