SearcharxivSearch

arXiv subjects

Kenji Hashimoto

Publications and source records attributed to Kenji Hashimoto.

At least 19 recordsLinked to original sources

Bianchi groups and automorphisms of rank-four $K3$ surfaces

We relate the arithmetic of Bianchi groups to automorphism groups of Picard-rank-four $K3$ surfaces. Let $K$ be an imaginary quadratic field with ring of integers $\mathcal O_K$, and let $S_K=\operatorname{Herm}_2(\mathcal O_K)$ be the rank-four lattice of $2\times2$ Hermitian matrices over $\mathcal O_K$, equipped with the quadratic form $2\det$. For an odd integer $N\geq1$, we consider a very general $S_K(2N)$-polarized $K3$ surface $X_{K,2N}$. We prove that its automorphism group is commensurable with a level-$2N$ congruence subgroup of the Bianchi group. Furthermore, we also obtain exact realizations of congruence subgroups as full automorphism groups. Namely, if $K=\mathbb Q(i)$ or $K=\mathbb Q(\sqrt{-p})$, where $p$ is prime, then \[ \operatorname{Aut}(X_{K,2}) \cong P\Gamma_K(2). \] Thus, for every prime $p$, the projective principal congruence subgroup of level $2$ over $\mathcal O_{\mathbb Q(\sqrt{-p})}$ occurs as the full automorphism group of a Picard-rank-four $K3$ surface. At higher levels, the full automorphism group may be either the projective principal congruence subgroup or the strictly larger projective level subgroup $\operatorname{Bi}_K(2N)$, depending on the arithmetic of the primes dividing the level. We further explain these arithmetic groups geometrically. The surfaces $X_{K,2}$ arise as deformations of the Kummer surfaces $\operatorname{Km}(E_K\times E_K)$, yielding explicit double-cover models and genus-one fibrations. For $K=\mathbb Q(\sqrt{-2})$ and $K=\mathbb Q(\sqrt{-7})$, the automorphism group is generated by Mordell--Weil translations associated with genus-one fibrations coming from cusps, together with the covering involution. For $K=\mathbb Q(i)$ and $K=\mathbb Q(\sqrt{-3})$, we construct complete-intersection models in products of projective spaces and show that their automorphism groups are generated by deck involutions.

math.AG

Unboundedness of fixed point multiplicities on a K3 surface

We exhibit automorphisms of a certain K3 surface in $\mathbb{P}^1\times \mathbb{P}^1 \times \mathbb{P}^1$ with an isolated fixed point at which the induced action on the stalk of the structure sheaf is arbitrarily close to the identity. This implies that the multiplicities of these automorphisms at the fixed point can be arbitrarily large. As another application, we show that the intersection multiplicity of two isomorphic curves at a point can be arbitrarily large on this K3 surface.

math.AG

Semidirect Product Decompositions for Periodic Regular Languages

The definition of period in finite-state Markov chains can be extended to regular languages by considering the transitions of DFAs accepting them. For example, the language $(\Sigma\Sigma)^*$ has period two because the length of a recursion (cycle) in its DFA must be even. This paper shows that the period of a regular language appears as a cyclic group within its syntactic monoid. Specifically, we show that a regular language has period $P$ if and only if its syntactic monoid is isomorphic to a submonoid of a semidirect product between a specific finite monoid and the cyclic group of order $P$. Moreover, we explore the relation between the structure of Markov chains and our result, and apply this relation to the theory of probabilities of languages. We also discuss the Krohn-Rhodes decomposition of finite semigroups, which is strongly linked to our methods.

cs.FL

Free automorphism groups of K3 surfaces with Picard number 3

It is known that the automorphism group of any projective K3 surface is finitely generated [24]. In this paper, we consider a certain kind of K3 surfaces with Picard number 3 whose automorphism groups are isomorphic to congruence subgroups of the modular group $PSL_2(\mathbb{Z})$. In particular, we show that a free group of arbitrarily large rank appears as the automorphism group of such a K3 surface.

math.AG

Characterizing Attributed Tree Translations in Terms of Macro Tree Transducers

It is well known that attributed tree transducers can be equipped with "regular look-around" in order to obtain a more robust class of translations. We present two characterizations of this class in terms of macro tree transducers (MTTs): the first one is a static restriction on the rules of the MTTs, where the MTTs need to be equipped with regular look-around. The second characterization is a dynamic one, where the MTTs only need regular look-ahead.

cs.FL

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions

A rep-tile is a polygon that can be dissected into smaller copies (of the same size) of the original polygon. A polyomino is a polygon that is formed by joining one or more unit squares edge to edge. These two notions were first introduced and investigated by Solomon W. Golomb in the 1950s and popularized by Martin Gardner in the 1960s. Since then, dozens of studies have been made in communities of recreational mathematics and puzzles. In this study, we first focus on the specific rep-tiles that have been investigated in these communities. Since the notion of rep-tiles is so simple that can be formulated mathematically in a natural way, we can apply a representative puzzle solver, a MIP solver, and SAT-based solvers for solving the rep-tile problem in common. In comparing their performance, we can conclude that the puzzle solver is the weakest while the SAT-based solvers are the strongest in the context of simple puzzle solving. We then turn to analyses of the specific rep-tiles. Using some properties of the rep-tile patterns found by a solver, we can complete analyses of specific rep-tiles up to certain sizes. That is, up to certain sizes, we can determine the existence of solutions, clarify the number of the solutions, or we can enumerate all the solutions for each size. In the last case, we find new series of solutions for the rep-tiles which have never been found in the communities.

cs.DM

Extensions of maximal symplectic actions on K3 surfaces

We classify pairs $(X,G)$ consisting of a complex K3 surface $X$ and a finite group $G \leq Aut(X)$ such that the subgroup $G_s \lneq G$ consisting of symplectic automorphisms is among the $11$ maximal symplectic ones as classified by Mukai.

math.AG

On the Compositionality of Dynamic Leakage and Its Application to the Quantification Problem

Quantitative information flow (QIF) is traditionally defined as the expected value of information leakage over all feasible program runs and it fails to identify vulnerable programs where only limited number of runs leak large amount of information. As discussed in Bielova (2016), a good notion for dynamic leakage and an efficient way of computing the leakage are needed. To address this problem, the authors have already proposed two notions for dynamic leakage and a method of quantifying dynamic leakage based on model counting. Inspired by the work of Kawamoto et. al. (2017), this paper proposes two efficient methods for computing dynamic leakage, a compositional method along with the sequential structure of a program and a parallel computation based on the value domain decomposition. For the former, we also investigate both exact and approximated calculations. From the perspective of implementation, we utilize binary decision diagrams (BDDs) and deterministic decomposable negation normal forms (d-DNNFs) to represent Boolean formulas in model counting. Finally, we show experimental results on several examples.

cs.CR

Quantifying Dynamic Leakage: Complexity Analysis and Model Counting-based Calculation

A program is non-interferent if it leaks no secret information to an observable output. However, non-interference is too strict in many practical cases and quantitative information flow (QIF) has been proposed and studied in depth. Originally, QIF is defined as the average of leakage amount of secret information over all executions of a program. However, a vulnerable program that has executions leaking the whole secret but has the small average leakage could be considered as secure. This counter-intuition raises a need for a new definition of information leakage of a particular run, i.e., dynamic leakage. As discussed in [5], entropy-based definitions do not work well for quantifying information leakage dynamically; Belief-based definition on the other hand is appropriate for deterministic programs, however, it is not appropriate for probabilistic ones. In this paper, we propose new simple notions of dynamic leakage based on entropy which are compatible with existing QIF definitions for deterministic programs, and yet reasonable for probabilistic programs in the sense of [5]. We also investigated the complexity of computing the proposed dynamic leakage for three classes of Boolean programs. We also implemented a tool for QIF calculation using model counting tools for Boolean formulae. Experimental results on popular benchmarks of QIF research show the flexibility of our framework. Finally, we discuss the improvement of performance and scalability of the proposed method as well as an extension to more general cases.

cs.CR

K3 surfaces with Picard number 2, Salem polynomials and Pell equation

If an automorphism of a projective K3 surface with Picard number 2 is of infinite order, then the automorphism corresponds to a solution of Pell equation. In this paper, by solving this equation, we determine all Salem polynomials of symplectic and anti-symplectic automorphisms of projective K3 surfaces with Picard number 2.

math.AG

SGD for robot motion? The effectiveness of stochastic optimization on a new benchmark for biped locomotion tasks

Trajectory optimization and posture generation are hard problems in robot locomotion, which can be non-convex and have multiple local optima. Progress on these problems is further hindered by a lack of open benchmarks, since comparisons of different solutions are difficult to make. In this paper we introduce a new benchmark for trajectory optimization and posture generation of legged robots, using a pre-defined scenario, robot and constraints, as well as evaluation criteria. We evaluate state-of-the-art trajectory optimization algorithms based on sequential quadratic programming (SQP) on the benchmark, as well as new stochastic and incremental optimization methods borrowed from the large-scale machine learning literature. Interestingly we show that some of these stochastic and incremental methods, which are based on stochastic gradient descent (SGD), achieve higher success rates than SQP on tough initializations. Inspired by this observation we also propose a new incremental variant of SQP which updates only a random subset of the costs and constraints at each iteration. The algorithm is the best performing in both success rate and convergence speed, improving over SQP by up to 30% in both criteria. The benchmark's resources and a solution evaluation script are made openly available.

cs.RO

Material Recognition CNNs and Hierarchical Planning for Biped Robot Locomotion on Slippery Terrain

In this paper we tackle the problem of visually predicting surface friction for environments with diverse surfaces, and integrating this knowledge into biped robot locomotion planning. The problem is essential for autonomous robot locomotion since diverse surfaces with varying friction abound in the real world, from wood to ceramic tiles, grass or ice, which may cause difficulties or huge energy costs for robot locomotion if not considered. We propose to estimate friction and its uncertainty from visual estimation of material classes using convolutional neural networks, together with probability distribution functions of friction associated with each material. We then robustly integrate the friction predictions into a hierarchical (footstep and full-body) planning method using chance constraints, and optimize the same trajectory costs at both levels of the planning method for consistency. Our solution achieves fully autonomous perception and locomotion on slippery terrain, which considers not only friction and its uncertainty, but also collision, stability and trajectory cost. We show promising friction prediction results in real pictures of outdoor scenarios, and planning experiments on a real robot facing surfaces with different friction.

cs.RO

Competing states for the fractional quantum Hall effect in the 1/3-filled second Landau level

In this work, we investigate the nature of the fractional quantum Hall state in the 1/3-filled second Landau level (SLL) at filling factor $\nu=7/3$ (and 8/3 in the presence of the particle-hole symmetry) via exact diagonalization in both torus and spherical geometries. Specifically, we compute the overlap between the exact 7/3 ground state and various competing states including (i) the Laughlin state, (ii) the fermionic Haffnian state, (iii) the antisymmetrized product state of two composite fermion seas at 1/6 filling, and (iv) the particle-hole (PH) conjugate of the $Z_4$ parafermion state. All these trial states are constructed according to a guiding principle called the bilayer mapping approach, where a trial state is obtained as the antisymmetrized projection of a bilayer quantum Hall state with interlayer distance $d$ as a variational parameter. Under the proper understanding of the ground-state degeneracy in the torus geometry, the $Z_4$ parafermion state can be obtained as the antisymmetrized projection of the Halperin (330) state. Similarly, it is proved in this work that the fermionic Haffnian state can be obtained as the antisymmetrized projection of the Halperin (551) state. It is shown that, while extremely accurate at sufficiently large positive Haldane pseudopotential variation $\delta V_1^{(1)}$, the Laughlin state loses its overlap with the exact 7/3 ground state significantly at $\delta V_1^{(1)} \simeq 0$. At slightly negative $\delta V_1^{(1)}$, it is shown that the PH-conjugated $Z_4$ parafermion state has a substantial overlap with the exact 7/3 ground state, which is the highest among the above four trial states.

cond-mat.str-el

Calabi-Yau threefolds of type K (II): Mirror symmetry

A Calabi-Yau threefold is called of type K if it admits an \'etale Galois covering by the product of a K3 surface and an elliptic curve. In our previous paper, based on Oguiso-Sakurai's fundamental work, we provide the full classification of Calabi-Yau threefolds of type K and study some basic properties thereof. In the present paper, we continue the study, investigating them from the viewpoint of mirror symmetry. It is shown that mirror symmetry relies on a duality of certain sublattices in the second cohomology of the K3 surface appearing in the minimal splitting covering. The duality may be thought of as a version of the lattice duality of the anti-symplectic involution on K3 surfaces discovered by Nikulin. Based on the duality, we obtain several results parallel to what is known for Borcea-Voisin threefolds. Along the way, we also investigate the Brauer groups of Calabi-Yau threefolds of type K.

math.AG

On a certain generalization of triangle singularities

Triangle singularities are Fuchsian singularities associated with von Dyck groups, which are index two subgroups of Schwarz triangle groups. Hypersurface triangle singularities are classified by Dolgachev, and give 14 exceptional unimodal singularities classified by Arnold. We introduce a generalization of triangle singularities to higher dimensions, show that there are only finitely many hypersurface singularities of this type in each dimension, and give a complete list in dimension 3.

math.AG

Calabi-Yau threefolds of type K (I): Classification

Any Calabi-Yau threefold X with infinite fundamental group admits an \'etale Galois covering either by an abelian threefold or by the product of a K3 surface and an elliptic curve. We call X of type A in the former case and of type K in the latter case. In this paper, we provide the full classification of Calabi-Yau threefolds of type K, based on Oguiso and Sakurai's work. Together with a refinement of Oguiso and Sakurai's result on Calabi-Yau threefolds of type A, we finally complete the classification of Calabi-Yau threefolds with infinite fundamental group.

math.AG