• Title/Summary/Keyword: integer-n type

Search Result 34, Processing Time 0.021 seconds

ON SOME L1-FINITE TYPE (HYPER)SURFACES IN ℝn+1

  • Kashani, Seyed Mohammad Bagher
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.1
    • /
    • pp.35-43
    • /
    • 2009
  • We say that an isometric immersed hypersurface x : $M^n\;{\rightarrow}\;{\mathbb{R}}^{n+1}$ is of $L_k$-finite type ($L_k$-f.t.) if $x\;=\;{\sum}^p_{i=0}x_i$ for some positive integer p < $\infty$, $x_i$ : $M{\rightarrow}{\mathbb{R}}^{n+1}$ is smooth and $L_kx_i={\lambda}_ix_i$, ${\lambda}_i\;{\in}\;{\mathbb{R}}$, $0{\leq}i{\leq}p$, $L_kf=trP_k\;{\circ}\;{\nabla}^2f$ for $f\;{\in}\'C^{\infty}(M)$, where $P_k$ is the kth Newton transformation, ${\nabla}^2f$ is the Hessian of f, $L_kx\;=\;(L_kx^1,\;{\ldots},\;L_kx^{n+1})$, $x=(x^1,\;{\ldots},\;x^{n+1})$. In this article we study the following(hyper)surfaces in ${\mathbb{R}}^{n+1}$ from the view point of $L_1$-finiteness type: totally umbilic ones, generalized cylinders $S^m(r){\times}{\mathbb{R}}^{n-m}$, ruled surfaces in ${\mathbb{R}}^{n+1}$ and some revolution surfaces in ${\mathbb{R}}^3$.

GENERALIZED WEIGHTED COMPOSITION OPERATORS FROM AREA NEVANLINNA SPACES TO WEIGHTED-TYPE SPACES

  • Weifeng, Yang;Weiren, Yan
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.6
    • /
    • pp.1195-1205
    • /
    • 2011
  • Let $H(\mathbb{D})$ denote the class of all analytic functions on the open unit disk $\mathbb{D}$ of the complex plane $\mathbb{C}$. Let n be a nonnegative integer, ${\varphi}$ be an analytic self-map of $\mathbb{D}$ and $u{\in}H(\mathbb{D})$. The generalized weighted composition operator is defined by $$D_{{\varphi},u}^nf=uf^{(n)}{\circ}{\varphi},\;f{\in}H(\mathbb{D})$$. The boundedness and compactness of the generalized weighted composition operator from area Nevanlinna spaces to weighted-type spaces and little weighted-type spaces are characterized in this paper.

SHARP ORE-TYPE CONDITIONS FOR THE EXISTENCE OF AN EVEN [4, b]-FACTOR IN A GRAPH

  • Cho, Eun-Kyung;Kwon, Su-Ah;O, Suil
    • Journal of the Korean Mathematical Society
    • /
    • v.59 no.4
    • /
    • pp.757-774
    • /
    • 2022
  • Let a and b be positive even integers. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b. Let κ(G) be the minimum size of a vertex set S such that G - S is disconnected or one vertex, and let σ2(G) = minuv∉E(G) (d(u)+d(v)). In 2005, Matsuda proved an Ore-type condition for an n-vertex graph satisfying certain properties to guarantee the existence of an even [2, b]-factor. In this paper, we prove that for an even positive integer b with b ≥ 6, if G is an n-vertex graph such that n ≥ b + 5, κ(G) ≥ 4, and σ2(G) ≥ ${\frac{8n}{b+4}}$, then G contains an even [4, b]-factor; each condition on n, κ(G), and σ2(G) is sharp.

Integrated Inventory-Distribution Planning in a (1 : N) Supply Chain System with Heterogeneous Vehicles Incorporated

  • Kim, Eun-Seok;Lee, Ik-Sun
    • Management Science and Financial Engineering
    • /
    • v.17 no.2
    • /
    • pp.1-21
    • /
    • 2011
  • This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands. The problem is to determine order planning at the warehouse, and also vehicle schedules and delivery quantities for the retailers with the objective of minimizing the sum of ordering cost at the warehouse, inventory holding cost at both the warehouse and retailers, and transportation cost. For the problem, we give a Mixed Integer Programming formulation and develop a Lagrangean heuristic procedure for computing lower and upper bounds on the optimal solution value. The Lagrangean dual problem of finding the best Lagrangrean lower bound is solved by subgradient optimization. Computational experiments on randomly generated test problems showed that the suggested algorithm gives relatively good solutions in a reasonable amount of computation time.

TWO DIMENSIONAL ARRAYS FOR ALEXANDER POLYNOMIALS OF TORUS KNOTS

  • Song, Hyun-Jong
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.193-200
    • /
    • 2017
  • Given a pair p, q of relative prime positive integers, we have uniquely determined positive integers x, y, u and v such that vx-uy = 1, p = x + y and q = u + v. Using this property, we show that$${\sum\limits_{1{\leq}i{\leq}x,1{\leq}j{\leq}v}}\;{t^{(i-1)q+(j-1)p}\;-\;{\sum\limits_{1{\leq}k{\leq}y,1{\leq}l{\leq}u}}\;t^{1+(k-1)q+(l-1)p}$$ is the Alexander polynomial ${\Delta}_{p,q}(t)$ of a torus knot t(p, q). Hence the number $N_{p,q}$ of non-zero terms of ${\Delta}_{p,q}(t)$ is equal to vx + uy = 2vx - 1. Owing to well known results in knot Floer homology theory, our expanding formula of the Alexander polynomial of a torus knot provides a method of algorithmically determining the total rank of its knot Floer homology or equivalently the complexity of its (1,1)-diagram. In particular we prove (see Corollary 2.8); Let q be a positive integer> 1 and let k be a positive integer. Then we have $$\begin{array}{rccl}(1)&N_{kq}+1,q&=&2k(q-1)+1\\(2)&N_{kq}+q-1,q&=&2(k+1)(q-1)-1\\(3)&N_{kq}+2,q&=&{\frac{1}{2}}k(q^2-1)+q\\(4)&N_{kq}+q-2,q&=&{\frac{1}{2}}(k+1)(q^2-1)-q\end{array}$$ where we further assume q is odd in formula (3) and (4). Consequently we confirm that the complexities of (1,1)-diagrams of torus knots of type t(kq + 2, q) and t(kq + q - 2, q) in [5] agree with $N_{kq+2,q}$ and $N_{kq+q-2,q}$ respectively.

HOMOGENEOUS CONDITIONS FOR STOCHASTIC TENSORS

  • Im, Bokhee;Smith, Jonathan D.H.
    • Communications of the Korean Mathematical Society
    • /
    • v.37 no.2
    • /
    • pp.371-384
    • /
    • 2022
  • Fix an integer n ≥ 1. Then the simplex Πn, Birkhoff polytope Ωn, and Latin square polytope Λn each yield projective geometries obtained by identifying antipodal points on a sphere bounding a ball centered at the barycenter of the polytope. We investigate conditions for homogeneous coordinates of points in the projective geometries to locate exact vertices of the respective polytopes, namely crisp distributions, permutation matrices, and quasigroups or Latin squares respectively. In the latter case, the homogeneous conditions form a crucial part of a recent projective-geometrical approach to the study of orthogonality of Latin squares. Coordinates based on the barycenter of Ωn are also suited to the analysis of generalized doubly stochastic matrices, observing that orthogonal matrices of this type form a subgroup of the orthogonal group.

CLASSIFICATION OF GALOIS POLYNOMIALS

  • LEE, KI-SUK;LEE, JI-EUN
    • Honam Mathematical Journal
    • /
    • v.39 no.2
    • /
    • pp.259-265
    • /
    • 2017
  • Galois polynomials are defined as a generalization of the Cyclotomic polynomials. Galois polynomials have integer coefficients as the cyclotomic polynomials. But they are not always irreducible. In this paper, Galois polynomials are partly classified according to the type of subgroups which defines the Galois polynomial.

THE NORM RATIO OF THE POLYNOMIALS WITH COEFFICIENTS AS BINARY SEQUENCE

  • Taghavi, M.
    • Journal of applied mathematics & informatics
    • /
    • v.13 no.1_2
    • /
    • pp.195-200
    • /
    • 2003
  • Given a positive integer q, the ratio of the 2q-norm of a polynomial which its coefficients form a binary sequence and its 2-norm arose from telecommunication engineering consists of finding any type of such polynomials haying the ratio “small” In this paper we consider some special types of these polynomials, discuss the sharpest possible upper bound, and prove a result for the ratio.

A NEW PROOF ABOUT THE DECIMATIONS WITH NIHO TYPE FIVE-VALUED CROSS-CORRELATION FUNCTIONS

  • Kim, Han-Doo;Cho, Sung-Jin
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.5_6
    • /
    • pp.903-911
    • /
    • 2012
  • Let $\{u(t)\}$ and $\{u(dt)\}$ be two maximal length sequences of period $2^n-1$. The cross-correlation is defined by $C_d({\tau})=\sum{_{t=0}^{2^n-2}}(-1)^{u(t+{\tau})+v(t)$ for ${\tau}=0,1,{\cdots},2^n-2$. In this paper, we propose a new proof for finding the values and the number of occurrences of each value of $C_d({\tau})$ when $d=2^{k-2}(2^k+3)$, where $n=2k$, $k$ is a positive integer.

SELF-HOMOTOPY EQUIVALENCES OF MOORE SPACES DEPENDING ON COHOMOTOPY GROUPS

  • Choi, Ho Won;Lee, Kee Young;Oh, Hyung Seok
    • Journal of the Korean Mathematical Society
    • /
    • v.56 no.5
    • /
    • pp.1371-1385
    • /
    • 2019
  • Given a topological space X and a non-negative integer k, ${\varepsilon}^{\sharp}_k(X)$ is the set of all self-homotopy equivalences of X that do not change maps from X to an t-sphere $S^t$ homotopically by the composition for all $t{\geq}k$. This set is a subgroup of the self-homotopy equivalence group ${\varepsilon}(X)$. We find certain homotopic tools for computations of ${\varepsilon}^{\sharp}_k(X)$. Using these results, we determine ${\varepsilon}^{\sharp}_k(M(G,n))$ for $k{\geq}n$, where M(G, n) is a Moore space type of (G, n) for a finitely generated abelian group G.