Contributions to Discrete Mathematics (E-Journal, University of Calgary)
Not a member yet
    406 research outputs found

    Pell Coding and Pell Decoding Methods with Some Applications

    Get PDF
    We develop a new coding and decoding method using the generalized Pell (p,i)(p,i)-numbers for p=1p=1. The relations among the code matrix elements, error detection, and correction have been established for coding theory when p=i=1p=i=1. We give two new blocking algorithms using Pell numbers and generalized Pell (p,i)(p,i)-numbers for p=1p=1

    Total colouring of some cartesian and direct product graphs

    No full text
    A graph is kk-total colourable if there is an assignment of kk different colours to the vertices and edges of the graph such that no two adjacent nor incident elements receive the same colour. The total chromatic number of some direct product graphs are determined. In particular, a sufficient condition is given for direct products of bipartite graphs to have total chromatic number equal to its maximum degree plus one. Partial results towards the total chromatic number of Kn×KmK_n\times K_m are also established

    A new mathematical model for tiling finite regions of the plane with polyominoes

    Get PDF
    Note from the editor: On May 11, 2024, an indexing error was found on page 104. This has since been corrected as of June 11, 2024. For more information, please see footnote 3 of page 104. We present a new mathematical model for tiling finite subsets of Z2\mathbb{Z}^2 using an arbitrary, but finite, collection of polyominoes. Unlike previous approaches that employ backtracking and other refinements of `brute-force\u27 techniques, our method is based on a systematic algebraic approach, leading in most cases to an underdetermined system of linear equations to solve. The resulting linear system is a binary linear programming problem, which can be solved via direct solution techniques, or using well-known optimization routines. We illustrate our model with some numerical examples computed in MATLAB. Users can download, edit, and run the codes from https://doi.org/10.5281/zenodo.5975482. For larger problems we solve the resulting binary linear programming problem with an optimization package such as CPLEX, GUROBI, or SCIP, before plotting solutions in MATLAB

    Closed formulas and identities on the Bell polynomials and falling factorials

    Get PDF
    The authors establish a pair of closed-form expressions for special values of the Bell polynomials of the second kind for the falling factorials, derive two pairs of identities involving the falling factorials, find an equivalent expression between two special values for the Bell polynomials of the second kind, and present five closed-form expressions for the (modified) spherical Bessel functions

    On irreversible spread of influence in edge-weighted graphs

    Get PDF
    Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the networks. In most cases, the nature of influence is weighted and the spread of influence depends on the weight of edges. The ordinary formulation and results for dynamic monopolies do not work for such models. In this paper we present a graph theoretical analysis for spread of weighted influence and mention a real world example realizing the activation model with weighted influence. Then we obtain some extremal bounds and algorithmic results for activation process and dynamic monopolies in directed and undirected graphs with weighted edges

    Q4Q_4-Factorization of λKn\lambda K_n and λKx(m)\lambda K_x(m)

    No full text
    In this study, we show that necessary conditions for Q4Q_4-factorization of λKn\lambda{K_n} and λKx(m)\lambda{K_{x(m)}} (complete xx partite graph with parts of size mm) are sufficient. We proved that there exists a Q4Q_4-factorization of λKx(m)\lambda{K_{x(m)}} if and only if mx0(mod16)mx\equiv{0} \pmod{16} and λm(x1)0(mod4)\lambda{m(x-1)}\equiv{0}\pmod{4}. This result immediately gives that λKn\lambda K_n has a Q4Q_4-factorization if and only if n0(mod16)n\equiv 0 \pmod{16} and λ0(mod4)\lambda \equiv 0 \pmod{4}

    Diameter 3

    Get PDF
    Let M\mathcal{M} be the class of finite metric spaces with nonzero distances in the set {1,2,3}\{1,2,3\} omitting triangles of the form (2,3,3)(2,3,3) and (3,3,3)(3,3,3). We prove that the class of linearly ordered structures from M\mathcal{M} satisfies the Ramsey property

    Corrigendum to ``"On the enumeration of a class of toroidal graphs" [Contrib. Discrete Math. 13 (2018), no. 1, 79-119]

    Get PDF
    Corrigendum to ``On the enumeration of a class of toroidal graphs [Contrib. Discrete Math. 13 (2018), no. 1, 79-119

    Alternating series of Apéry-type for the Riemann zeta function

    Get PDF
    By making use of a transformation formula for the nonterminating well-poised 5F4_5F_4-series, we investigate a class of alternating series of Apéry-type and establish several identities for the Riemann zeta function, including three identities conjectured by Sun (2015)

    The polar of convex lattice sets

    Get PDF
    Let KK be a convex lattice set in Zn\mathbb{Z}^n containing the origin as the interior of its convex hull. In this paper, the definition of the polar of a convex lattice set KK is given both in Qn\mathbb{Q}^n and Zn\mathbb{Z}^n. Some properties and inequalities about the convex lattice sets and their polar are established

    333

    full texts

    406

    metadata records
    Updated in last 30 days.
    Contributions to Discrete Mathematics (E-Journal, University of Calgary)
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇