Searcharxiv⌕ Search

arXiv subjects

Shizuo Kaji

Publications and source records attributed to Shizuo Kaji.

At least 37 records · Page 2Linked to original sources
arXiv2019

Representing a point and the diagonal as zero loci in flag manifolds

The zero locus of a generic section of a vector bundle over a manifold defines a submanifold. A classical problem in geometry asks to realise a specified submanifold in this way. We study two cases; a point in a generalised flag manifold and the diagonal in the direct product of two copies of a generalised flag manifold. These cases are particularly interesting since they are related to ordinary and equivariant Schubert polynomials respectively.

math.AT↗
arXiv2018

Suspension splittings and self-maps of flag manifolds

If $G$ is a compact connected Lie group and $T$ is a maximal torus, we give a wedge decomposition of $ΣG/T$ by identifying families of idempotents in cohomology. This is used to give new information on the self-maps of $G/T$.

math.AT↗
arXiv2017

Products in Equivariant Homology

We refine the intersection product in homology to an equivariant setting, which unifies several known constructions. As an application, we give a common generalisation of the Chas-Sullivan string product on a manifold and the Chataur-Menichi string product on the classifying space by defining a string product on the Borel construction of a manifold. We prove a vanishing result which enables us to define a secondary product. The secondary product is then used to construct secondary versions of the Chataur-Menichi string product, and the equivariant intersection product in the Borel equivariant homology of a manifold with an action of a compact Lie group. The latter reduces to the product in homology of the classifying space defined by Kreck, which coincides with the cup product in negative Tate cohomology if the group is finite.

math.AT↗
arXiv2017

A linear algorithm for Brick Wang tiling

The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand, Wang tiles are used as a tool to generate textures and patterns in computer graphics. In these applications, a set of tiles is normally chosen so that it tiles the plane or its sub-regions easily in many different ways. With computer graphics applications in mind, we introduce a class of such tileset, which we call sequentially permissive tilesets, and consider tiling problems with constrained boundary. We apply our methodology to a special set of Wang tiles, called Brick Wang tiles, introduced by Derouet-Jourdan et al. in 2015 to model wall patterns. We generalise their result by providing a linear algorithm to decide and solve the tiling problem for arbitrary planar regions with holes.

cs.DM↗
arXiv2017

A circuit-preserving mapping from multilevel to Boolean dynamics

Many discrete models of biological networks rely exclusively on Boolean variables and many tools and theorems are available for analysis of strictly Boolean models. However, multilevel variables are often required to account for threshold effects, in which knowledge of the Boolean case does not generalise straightforwardly. This motivated the development of conversion methods for multilevel to Boolean models. In particular, Van Ham's method has been shown to yield a one-to-one, neighbour and regulation preserving dynamics, making it the de facto standard approach to the problem. However, Van Ham's method has several drawbacks: most notably, it introduces vast regions of "non-admissible" states that have no counterpart in the multilevel, original model. This raises special difficulties for the analysis of interaction between variables and circuit functionality, which is believed to be central to the understanding of dynamic properties of logical models. Here, we propose a new multilevel to Boolean conversion method, with software implementation. Contrary to Van Ham's, our method doesn't yield a one-to-one transposition of multilevel trajectories, however, it maps each and every Boolean state to a specific multilevel state, thus getting rid of the non-admissible regions and, at the expense of (apparently) more complicated, "parallel" trajectories. One of the prominent features of our method is that it preserves dynamics and interaction of variables in a certain manner. As a demonstration of the usability of our method, we apply it to construct a new Boolean counter-example to the well-known conjecture that a local negative circuit is necessary to generate sustained oscillations. This result illustrates the general relevance of our method for the study of multilevel logical models.

q-bio.MN↗
arXiv2017

Polynomial expressions of $p$-ary auction functions

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.

math.CO↗
arXiv2017

Dappled tiling

We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds of tiles. We give an efficient algorithm to turn any tiling into one satisfying the condition, and discuss its applications in texturing.

cs.DM↗
arXiv2016

The mod 2 dual Steenrod algebra as a subalgebra of the mod 2 dual Leibniz-Hopf algebra

The mod 2 Steenrod algebra $\mathcal{A}_2$ can be defined as the quotient of the mod 2 Leibniz--Hopf algebra $\mathcal{F}_2$ by the Adem relations. Dually, the mod 2 dual Steenrod algebra $\mathcal{A}_2^*$ can be thought of as a sub-Hopf algebra of the mod 2 dual Leibniz--Hopf algebra $\mathcal{F}_2^*$. We study $\mathcal{A}_2^*$ and $\mathcal{F}_2^*$ from this viewpoint and give generalisations of some classical results in the literature.

math.AT↗
arXiv2016

A concise parametrisation of affine transformation

Good parametrisations of affine transformations are essential to interpolation, deformation, and analysis of shape, motion, and animation. It has been one of the central research topics in computer graphics. However, there is no single perfect method and each one has both advantages and disadvantages. In this paper, we propose a novel parametrisation of affine transformations, which is a generalisation to or an improvement of existing methods. Our method adds yet another choice to the existing toolbox and shows better performance in some applications. A C++ implementation is available to make our framework ready to use in various applications.

cs.GR↗
arXiv2016

Homotopy decomposition of a suspended real toric space

We give $p$-local homotopy decompositions of the suspensions of real toric spaces for odd primes $p$. Our decomposition is compatible with the one given by Bahri, Bendersky, Cohen, and Gitler for the suspension of the corresponding real moment-angle complex, or more generally, the polyhedral product. As an application, we obtain a stable rigidity property for real toric spaces.

math.AT↗
arXiv2016

Polynomial Expressions of Carries in p-ary Arithmetics

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.

math.CO↗
arXiv2016

Tetrisation of triangular meshes and its application in shape blending

The As-Rigid-As-Possible (ARAP) shape deformation framework is a versatile technique for morphing, surface modelling, and mesh editing. We discuss an improvement of the ARAP framework in a few aspects: 1. Given a triangular mesh in 3D space, we introduce a method to associate a tetrahedral structure, which encodes the geometry of the original mesh. 2. We use a Lie algebra based method to interpolate local transformation, which provides better handling of rotation with large angle. 3. We propose a new error function to compile local transformations into a global piecewise linear map, which is rotation invariant and easy to minimise. We implemented a shape blender based on our algorithm and its MIT licensed source code is available online.

cs.GR↗
arXiv2016

Anti-commutative Dual Complex Numbers and 2D Rigid Transformation

We introduce a new presentation of the two dimensional rigid transformation which is more concise and efficient than the standard matrix presentation. By modifying the ordinary dual number construction for the complex numbers, we define the ring of the anti-commutative dual complex numbers, which parametrizes two dimensional rotation and translation all together. With this presentation, one can easily interpolate or blend two or more rigid transformations at a low computational cost. We developed a library for C++ with the MIT-licensed source code and demonstrate its facility by an interactive deformation tool developed for iPad.

cs.GR↗
arXiv2015

Diagonals of flag bundles

We express the diagonals of projective, Grassmann and, more generally, flag bundles of type (A) using the zero schemes of some vector bundle sections, and do the same for their single point subschemes. We discuss diagonal and point properties of these flag bundles. We study when the complex manifolds G/B for other groups have the point and diagonal properties. We discuss explicit formulas for the classes of diagonals of the varieties G/B.

math.AG↗
arXiv2015

Three presentations of torus equivariant cohomology of flag manifolds

Let $G$ be a compact connected Lie group and $T$ be its maximal torus. The homogeneous space $G/T$ is called the (complete) flag manifold. One of the main goals of the {\em equivariant Schubert calculus} is to study the $T$-equivariant cohomology $H^*_T(G/T)$ with regard to the $T$-action on $G/T$ by multiplication. There are three presentations known for $H^*_T(G/T)$; (1) the free $H^*(BT)$-module generated by the Schubert varieties (2) (with the rational coefficients) the {\em double coinvariant ring} of the Weyl group (3) the {\em GKM ring} associated to the Hasse graph of the Weyl group. Each presentation has both advantages and disadvantages. In this paper, we describe how to convert an element in one presentation to another by giving an explicit algorithm, which can then be used to compute the equivariant structure constants for the product of Schubert classes. The algorithm is implemented in Maple.

math.AT↗
arXiv2014

Mod p decompositions of the loop spaces of compact symmetric spaces

We give p-local homotopy decompositions of the loop spaces of compact, simply-connected symmetric spaces for quasi-regular primes. The factors are spheres, sphere bundles over spheres, and their loop spaces. As an application, upper bounds for the homotopy exponents are determined.

math.AT↗
arXiv2014

A mathematical problem for security analysis of hash functions and pseudorandom generators

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.

cs.CR↗