Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Graph theory (6)
- Combinatorics (4)
- Graph (3)
- Line graph (2)
- Probability (2)
-
- $K_n$ (1)
- $j$-invariant (1)
- Algebraic geometry (1)
- Aperiodic tile sets (1)
- Arbitrary dimensional tilings (1)
- Bi-regular graph (1)
- Broadcasts (1)
- Cellular Automata (1)
- Chinese remainder theorem (1)
- Chromatic number (1)
- Connected graphs (1)
- Cycle graphs (1)
- DNA (1)
- DNA nanotubes (1)
- Deficient rectangles (1)
- Diophantine equations (1)
- Directed (1)
- Directed Graph (1)
- Discrete math (1)
- Divisibility (1)
- Domination (1)
- Earth-moon Problem (1)
- Edge coloring (1)
- Elliptic curve (1)
- Enumeration (1)
Articles 31 - 34 of 34
Full-Text Articles in Discrete Mathematics and Combinatorics
Asymptotically Optimal Bounds For (𝑡,2) Broadcast Domination On Finite Grids, Timothy W. Randolph
Asymptotically Optimal Bounds For (𝑡,2) Broadcast Domination On Finite Grids, Timothy W. Randolph
Rose-Hulman Undergraduate Mathematics Journal
Let G = (V,E) be a graph and t,r be positive integers. The signal that a tower vertex T of signal strength t supplies to a vertex v is defined as sig(T, v) = max(t − dist(T,v),0), where dist(T,v) denotes the distance between the vertices v and T. In 2015 Blessing, Insko, Johnson, and Mauretour defined a (t, r) broadcast dominating set, or simply a (t, r) broadcast, on G as a set T ⊆ V such that the sum of all signal received at each vertex v ∈ V from the set of towers T …
A Generalized Newton-Girard Identity, Tanay Wakhare
A Generalized Newton-Girard Identity, Tanay Wakhare
Rose-Hulman Undergraduate Mathematics Journal
We present a generalization of the Newton-Girard identities, along with some applications. As an addendum, we collect many evaluations of symmetric polynomials to which these identities apply.
A Proof Of The "Magicness" Of The Siam Construction Of A Magic Square, Joshua Arroyo
A Proof Of The "Magicness" Of The Siam Construction Of A Magic Square, Joshua Arroyo
Rose-Hulman Undergraduate Mathematics Journal
A magic square is an n x n array filled with n2 distinct positive integers 1, 2, ..., n2 such that the sum of the n integers in each row, column, and each of the main diagonals are the same. A Latin square is an n x n array consisting of n distinct symbols such that each symbol appears exactly once in each row and column of the square. Many articles dealing with the construction of magic squares introduce the Siam method as a "simple'' construction for magic squares. Rarely, however, does the article actually prove that the …
On Orders Of Elliptic Curves Over Finite Fields, Yujin H. Kim, Jackson Bahr, Eric Neyman, Gregory Taylor
On Orders Of Elliptic Curves Over Finite Fields, Yujin H. Kim, Jackson Bahr, Eric Neyman, Gregory Taylor
Rose-Hulman Undergraduate Mathematics Journal
In this work, we completely characterize by $j$-invariant the number of orders of elliptic curves over all finite fields $F_{p^r}$ using combinatorial arguments and elementary number theory. Whenever possible, we state and prove exactly which orders can be taken on.