• Honam Mathematical Journal
• /
• v.23 no.1
• /
• pp.71-90
• /
• 2001

In this paper, we introduce the MarKov chain and hyperplane arrangement. we prove some properties determined by a hyperplane arrangement and give an example as an application of them.

• Journal of the Korean Mathematical Society
• /
• v.37 no.3
• /
• pp.455-461
• /
• 2000

The quantum hyperplane section theorem is explained for nonnegative decomposable concavex bundle spaces over generalized flag manifolds.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.375-382
• /
• 2017

We exhibit a one-to-one correspondence between 3-colored graphs and subarrangements of certain hyperplane arrangements denoted ${\mathcal{J}}_n$, $n{\in}{\mathbb{N}}$. We define the notion of centrality of 3-colored graphs, which corresponds to the centrality of hyperplane arrangements. Via the correspondence, the characteristic polynomial ${\chi}{\mathcal{J}}_n$ of ${\mathcal{J}}_n$ can be expressed in terms of the number of central 3-colored graphs, and we compute ${\chi}{\mathcal{J}}_n$ for n = 2, 3.

• Journal of the Korean Mathematical Society
• /
• v.54 no.5
• /
• pp.1595-1604
• /
• 2017

We give a complete formula for the characteristic polynomial of hyperplane arrangements ${\mathcal{J}}_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $1{\leq}i$, j, k, $l{\leq}n$. The formula is obtained by associating hyperplane arrangements with graphs, and then enumerating central graphs via generating functions for the number of bipartite graphs of given order, size and number of connected components.

• Journal of Advanced Marine Engineering and Technology
• /
• v.14 no.3
• /
• pp.42-51
• /
• 1990

A construction method of a switching hyperplane for the Variable Structure Systems, which have robustness for parameter variations and noises in sliding mode is presented. The problem of composing a switching hyperplane is considered as a special case of the pole assignment for a closed-loop system. It is shown that the condition for constructing arbitrarily a switching hyperplane matrix C is equivalent to the controllability of the pair matrix(A, B) for the system, and then an algorithm of obtaining the switching hyperplane is proposed. It is also proved that zeros of the system are invariable in the sliding mode, and the stability for the system dynamic is equivalent to the stability of PA $\textit{ker}$ C. The applicability of the method proposed in the paper is shown by the simulation results for an example system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1623-1628
• /
• 2004

In the 3-dimensional cyclic Lotka-Volterra equations, we show the solution on the invariant hyperplane. In addition, we show the existence of the invariant hyperplane by the center manifold theorem under the some conditions. With this result, we can lead the hyperplane of the n-dimensional cyclic Lotka-Volterra equaions. In other section, we study the 3- or 4-dimensional Hamiltonian Lotka-Volterra equations which satisfy the Jacobi identity. We analyze the solution of the Hamiltonian Lotka- Volterra equations with the functions called the split Liapunov functions by [4], [5] since they provide the Liapunov functions for each region separated by the invariant hyperplane. In the cyclic Lotka-Volterra equations, the role of the Liapunov functions is the same in the odd and even dimension. However, in the Hamiltonian Lotka-Volterra equations, we can show the difference of the role of the Liapunov function between the odd and the even dimension by the numerical calculation. In this paper, we regard the invariant hyperplane as the important item to analyze the motion of Lotka-Volterra equations and occur the chaotic orbit. Furtheremore, an example of the asymptoticaly stable and stable solution of the 3-dimensional cyclic Lotka-Volterra equations, 3- and 4-dimensional Hamiltonian equations are shown.

• Communications of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.759-765
• /
• 2018

We use the finite method developed by C. Athanasiadis based on Crapo-Rota's theorem to give a complete formula for the characteristic polynomial of hyperplane arrangements ${\mathcal{J}}_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $1{\leq}i,j,k,l{\leq}n$.

• Communications of the Korean Mathematical Society
• /
• v.30 no.3
• /
• pp.253-267
• /
• 2015

Given a complex submanifoldM of the projective space $\mathbb{P}$(T), the hyperplane system R on M characterizes the projective embedding of M into $\mathbb{P}$(T) in the following sense: for any two nondegenerate complex submanifolds $M{\subset}\mathbb{P}$(T) and $M^{\prime}{\subset}\mathbb{P}$(T'), there is a projective linear transformation that sends an open subset of M onto an open subset of M' if and only if (M,R) is locally equivalent to (M', R'). Se-ashi developed a theory for the differential invariants of these types of systems of linear differential equations. In particular, the theory applies to systems of linear differential equations that have symbols equivalent to the hyperplane systems on nondegenerate equivariant embeddings of compact Hermitian symmetric spaces. In this paper, we extend this result to hyperplane systems on nondegenerate equivariant embeddings of homogeneous spaces of the first kind.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.21-30
• /
• 2021

In this paper, we prove some rigidity results about embedded minimal hypersurface M ⊂ ℝn+1 with compact ∂M that has one end which is regular at infinity. We first show that if M ⊂ ℝn+1 meets a hyperplane in a constant angle ≥ ��/2, then M is part of an n-dimensional catenoid. We show that if M meets a sphere in a constant angle and ∂M lies in a hemisphere determined by the hyperplane through the center of the sphere and perpendicular to the limit normal vector nM of the end, then M is part of either a hyperplane or an n-dimensional catenoid. We also show that if M is tangent to a C2 convex hypersurface S, which is symmetric about a hyperplane P and nM is parallel to P, then M is also symmetric about P. In special, if S is rotationally symmetric about the xn+1-axis and nM = en+1, then M is also rotationally symmetric about the xn+1-axis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.82-91
• /
• 2005

This paper introduces an efficient affine projection algorithm(APA) using iterative hyperplane projection. Among various fast converging adaptation algorithms, APA has been preferred to be employed for various applications due to its inherent effectiveness against the rank deficient problem. However, the amount of complexity of the conventional APA could not be negligible because of the accomplishment of sample matrix inversion(SMI). Moreover, the 'shifting invariance property' usually exploited in single channel case does not hold for the application of space-time decision-directed equalizer(STDE) deployed in single-input-multi-output(SIMO) systems. Thus, it is impossible to utilize the fast adaptation schemes such as fast transversal filter(FlF) having low-complexity. To accomplish such tasks, this paper introduces the low-complexity APA by employing hyperplane projection algorithm, which shows the excellent tracking capability as well as the fast convergence. In order to confirm th validity of the proposed method, its performance is evaluated under wireless SIMO channel in respect to bit error rate(BER) behavior and computational complexity.