• Title/Summary/Keyword: hyperplane arrangement

Search Result 7, Processing Time 0.018 seconds

MARKOV CHAINS AND THEIR APPLICATION TO HYPERPLANE ARRANGEMENT

  • AHN, SEUNG-HO;HAN, BOONG-BI
    • 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.

  • PDF

FREE ARRANGEMENTS AND NICE PARTITIONS

  • Choi, Hyun-Hee;Lee, Ki-Suk
    • Communications of the Korean Mathematical Society
    • /
    • v.17 no.3
    • /
    • pp.439-449
    • /
    • 2002
  • If an arrangement admits a nice partition, or an arrangement is free, then the characteristic polynomial of the arrangement can be factored. It is known that a free arrangement does not always admit a nice partition. We show that even an inductively free arrangement does not always admit a nice partition.

COMBINATORIAL ENUMERATION OF THE REGIONS OF SOME LINEAR ARRANGEMENTS

  • Seo, Seunghyun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.5
    • /
    • pp.1281-1289
    • /
    • 2016
  • Richard Stanley suggested the problem of finding combinatorial proofs of formulas for counting regions of certain hyperplane arrangements defined by hyperplanes of the form $x_i=0$, $x_i=x_j$, and $x_i=2x_j$ that were found using the finite field method. We give such proofs, using embroidered permutations and linear extensions of posets.

ALMOST FREE ARRANGEMENTS AND TAME ARRANGEMENTS

  • Lee, Ki-Suk
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.1
    • /
    • pp.279-284
    • /
    • 1997
  • The purpose of this paper is to show that if A is a tame arrangement and a hyperplane H is ageneric then $A^{H}$ is also tame. Since free arrangements are tame we can say tame we can say that almost free arrangements are tame.

Variable length Chromosomes in Genetic Algorithms for Modeling the Class Boundaries

  • Bandyopadhyay, Sanghamitra;Pal, Sankar K.;Murthy, C.A.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.634-639
    • /
    • 1998
  • A methodology based on the concept of variable string length GA(VGA) is developed for determining automatically the number of hyperplanes and their appropriate arrangement for modeling the class boundaries of a given training data set in RN. The genetic operators and fitness functionare newly defined to take care of the variability in chromosome length. Experimental results on different artificial and real life data sets are provided.

  • PDF

𝜖-PERTURBATION METHOD FOR VOLUME OF HYPERCUBES CLIPPED BY TWO OR THREE HYPERPLANES

  • Cho, Eungchun;Cho, Yunhi
    • Honam Mathematical Journal
    • /
    • v.43 no.4
    • /
    • pp.679-689
    • /
    • 2021
  • The first author suggested an exact volume formula of the hypercubes [0, 1]n clipped by several hyperplanes expressed directly in terms of linear coefficients of the hyperplanes. However, it requires awkward assumptions to apply the formula to various situations. We suggest a concrete method to overcome those restrictions for two or three hyperplanes using 𝜖-perturbation, which gives an exact value applicable for any kind of arrangement of hyperplanes with no consideration.