• Kyungpook Mathematical Journal
• /
• v.55 no.4
• /
• pp.753-771
• /
• 2015

A complete invariant defined for (closed connected orientable) 3-manifolds is an invariant defined for the 3-manifolds such that any two 3-manifolds with the same invariant are homeomorphic. Further, if the 3-manifold itself can be reconstructed from the data of the complete invariant, then it is called a characteristic invariant defined for the 3-manifolds. In a previous work, a characteristic lattice point invariant defined for the 3-manifolds was constructed by using an embedding of the prime links into the set of lattice points. In this paper, a characteristic rational invariant defined for the 3-manifolds called the characteristic genus defined for the 3-manifolds is constructed by using an embedding of a set of lattice points called the PDelta set into the set of rational numbers. The characteristic genus defined for the 3-manifolds is also compared with the Heegaard genus, the bridge genus and the braid genus defined for the 3-manifolds. By using this characteristic rational invariant defined for the 3-manifolds, a smooth real function with the definition interval (-1, 1) called the characteristic genus function is constructed as a characteristic invariant defined for the 3-manifolds.

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.2
• /
• pp.469-477
• /
• 2024

For a knot in the 3-sphere, the Upsilon invariant is a piecewise linear function defined on the interval [0, 2]. It is known that this invariant of an L-space knot is the Legendre-Fenchel transform (or, convex conjugate) of a certain gap function derived from the Alexander polynomial. To recover an information lost in the Upsilon invariant, Kim and Livingston introduced the secondary Upsilon invariant. In this note, we prove that the secondary Upsilon invariant of an L-space knot is a concave conjugate of a restricted gap function. Also, a similar argument gives an alternative proof of the above fact that the Upsilon invariant of an L-space knot is a convex conjugate of a gap function.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.1
• /
• pp.76-81
• /
• 1999

The degree of relative similarity between 2D patterns is obtained using Open-Ball Scheme. Open-Ball Scheme employs a method of transforming the geometrical information on 3D objects or 2D patterns into the features to measure the relative similarity for object(patten) recognition, with invariance on scale, rotation, and translation. The feature of an object is used to obtain the relative similarity and mapped into [0, 1] the interval of real line. For decades, Moment-Invariant Method has been used as one of the excellent methods for pattern classification and object recognition. Open-Ball Scheme uses the geometrical structure of patterns while Moment Invariant Method uses the statistical characteristics. Open-Ball Scheme is compared to Moment Invariant Method with respect to the way that it interprets two-dimensional patten classification, especially the paradigms are compared by the degree of closeness to human's intuitive understanding. Finally the effectiveness of the proposed Open-Ball Scheme is illustrated through simulations.

• Journal of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.255-271
• /
• 2023

In this paper, we deal with random attractors for dynamical systems forced by a deterministic noise. These kind of systems are modeled as skew products where the dynamics of the forcing process are described by the base transformation. Here, we consider skew products over the Bernoulli shift with the unit interval fiber. We study the geometric structure of maximal attractors, the orbit stability and stability of mixing of these skew products under random perturbations of the fiber maps. We show that there exists an open set U in the space of such skew products so that any skew product belonging to this set admits an attractor which is either a continuous invariant graph or a bony graph attractor. These skew products have negative fiber Lyapunov exponents and their fiber maps are non-uniformly contracting, hence the non-uniform contraction rates are measured by Lyapnnov exponents. Furthermore, each skew product of U admits an invariant ergodic measure whose support is contained in that attractor. Additionally, we show that the invariant measure for the perturbed system is continuous in the Hutchinson metric.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.749-755
• /
• 2009

In this paper, we investigate the invariant interval, periodic character, semicycle and global attractivity of all positive solutions of the equation $Y_{n+1}\;=\;\frac{p+qy_{n-k}}{1+y_n+ry_{n-k}}$, n = 0, 1, ..., where the parameters p, q, r and the initial conditions $y_{-k}$, ..., $y_{-1}$, $y_0$ are positive real numbers, k $\in$ {1, 2, 3, ...}. It is worth to mention that our results solve the open problem proposed by Kulenvic and Ladas in their monograph [Dynamics of Second Order Rational Difference Equations: with Open Problems and Conjectures, Chapman & Hall/CRC, Boca Raton, 2002]

• Honam Mathematical Journal
• /
• v.32 no.4
• /
• pp.633-642
• /
• 2010

In this note, we introduce the definition of the generalized analogue of Wiener measure on the space C[a, b] of all real-valued continuous functions on the closed interval [a, b], give several examples of it and investigate some important properties of it - the Fernique theorem and the existence theorem of scale-invariant measurable subsets on C[a, b].

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.879-889
• /
• 2011

In this paper, we investigate the local asymptotic stability, the invariant intervals, the global attractivity of the equilibrium points, and the asymptotic behavior of the solutions of the difference equation $x_{n+1}=\frac{a+bx_nx_{n-k}}{A+Bx_n+Cx_{n-k}}$, n = 0, 1,${\ldots}$, where the parameters a, b, A, B, C and the initial conditions $x_{-k}$, ${\ldots}$, $x_{-1}$, $x_0$ are positive real numbers.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.1
• /
• pp.20-27
• /
• 1987

The hierarchical approach method is proposed to sperate each different time scale sub-systems from linear time invariant multi-parameter singular perturbation systems. By means of this proposal, the original multi-parameter singular perturbation systems is completely separated into independent subsystems with each different time scale. It is also investigated that the controllability of the system is invariant. And this paper applies singular perturbation methods to the minimum control effort problem for linear time invariant systems with constrained controls. Also near-optimum control theory, which is based on dividing the total time interval with the time scales respectively, is proposed. As a result, the time scale separation method is show to be particularly useful in a near optimum design which can be otained through a decentralized control structure.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.2
• /
• pp.245-250
• /
• 2009

We consider a code function from the unit interval which has a generalized dyadic expansion into a coding space which has an associated ultra metric. The code function is not a bi-Lipschitz map but a dimension-preserving map in the sense that the Hausdorff and packing dimensions of any subset in the unit interval and its image under the code function coincide respectively.

• The KIPS Transactions:PartD
• /
• v.18D no.1
• /
• pp.9-22
• /
• 2011

In this paper we present an efficient solution to rotation?invariant boundary image matching. Computing the rotation-invariant distance between image time-series is a time-consuming process since it requires a lot of Euclidean distance computations for all possible rotations. In this paper we propose a novel solution that significantly reduces the number of distance computations using the envelope-based lower bound. To this end, we first present how to construct a single envelope from a query sequence and how to obtain a lower bound of the rotation-invariant distance using the envelope. We then show that the single envelope-based lower bound can reduce a number of distance computations. This approach, however, may cause bad performance since it may incur a larger lower bound by considering all possible rotated sequences in a single envelope. To solve this problem, we present a concept of rotation interval, and using the rotation interval we generalize the envelope-based lower bound by exploiting multiple envelopes rather than a single envelope. We also propose equi-width and envelope minimization divisions as the method of determining rotation intervals in the multiple envelope approach. Experimental results show that our envelope-based solutions outperform existing solutions by one or two orders of magnitude.