Math & Computer Science

 

Sub-communities within this community

Recent Submissions

  • Fiori, Andrew (World ScientificArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of Lethbridgehttps://doi.org/10.1142/S0219498821500638, 2021)
    We give a concrete characterization of the rational conjugacy classes of maximal tori in groups of type Dn, with specific emphasis on the case of number fields and p-adic fields. This includes the forms associated to ...
  • Baillie, Robert; Fiori, Andrew; Wagstaff, Samuel S. (American Mathematical SocietyArts and ScienceDepartment of Mathematics and Computer ScienceState College (Pa.)University of LethbridgePurdue Universityhttps://doi.org/10.1090/mcom/3616, 2021)
    In 1980, the first and third authors proposed a probabilistic primality test that has become known as the Baillie-PSW primality test. Its power to distinguish between primes and composites comes from combining a Fermat ...
  • Fiori, Andrew; Shallue, Andrew (American Mathematical SocietyArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of LethbridgeIllinois Wesleyan Universityhttps://doi.org/10.1090/mcom/3452, 2020)
    In this paper we obtain lower and upper bounds on the average number of liars for the Quadratic Frobenius Pseudoprime Test of Grantham [Math. Comp. 70 (2001), pp. 873–891], generalizing arguments of Erdős and Pomerance ...
  • Eva, Nicole; Le, M. L.; Sheriff, John (ElsevierArts and ScienceLibraryDepartment of Mathematics & Computer ScienceUniversity of LethbridgeUniversity of Manitobahttps://doi.org/10.1016/j.acalib.2021.102392, 2021)
    Academic librarianship is a heavily feminized profession, with women making up between 72-74% of the workforce based on statistics from Canada and the US (American Library Association, 2012; Canadian Association of University ...
  • Anvik, John; Cote, Vincent; Riehl, Jace (ACMArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of Lethbridgehttps://doi.org/10.1145/3287324.3287496, 2019)
    Although there are many computer science learning games with the goal of teaching programming, such games typically require the person to either learn an existing programming language or the game's own specialized language. ...
  • Szafron, Duane; Lu, Paul; Greiner, Russell; Wishart, David S.; Poulin, Brett; Eisner, Roman; Lu, Zhiyong; Anvik, John; Macdonell, Cam; Fyshe, Alona; Meeuwis, David (Oxford University PressArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of AlbertaUniversity of Lethbridgehttps://doi.org/10.1093/nar/gkh485, 2004)
    Proteome Analyst (PA) (http://www.cs.ualberta.ca/~bioinfo/PA/) is a publicly available, high-throughput, web-based system for predicting various properties of each protein in an entire proteome. Using machine-learned ...
  • Anvik, John (Arts and ScienceDepartment of Mathematics & Computer ScienceUniversity of Lethbridge, 2016)
    Software development projects receive many change requests each day and each report must be examined to decide how the request will be handled by the project. One decision that is frequently made is to which software ...
  • Morris, Joy; Praeger, Cheryl E.; Spiga, Pablo (Drustvo Matematikov, Fizikov in AstronomovArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of LethbridgeUniversity of Western AustraliaUniversity of Padova, 2009)
    In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs,using normal quotient reduction. We show that their reducible graphs in this family have quasi primitive automorphism groups, ...
  • Kutnar, Klavdija; Marusic, Dragan; Morris, Dave Witte; Morris, Joy; Sparl, Primoz (Drustvo Matematikov, Fizikov in AstronomovArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of PrimorskaUniversity of LjubljanaUniversity of Lethbridge, 2012)
    We prove that if Cay(G;S) is a connected Cayley graph with n vertices,and the prime factorization of n is very small, then Cay(G;S) has a hamiltonian cycle. More precisely, if p, q, and r are distinct primes, then n can ...
  • Bhoumik, Soumya; Dobson, Edward; Morris, Joy (Drustvo Matematikov, Fizikov in AstronomovArts and ScienceDepartment of Mathematics and Computer ScienceFort Hays State UniversityMississippi State UniversityUniversity of PrimorskaUniversity of Lethbridge, 2018)
    We attempt to determine the structure of the automorphism group of a generic circulant graph. We first show that almost all circulant graphs have automorphism groups as small as possible. The second author has conjectured ...
  • Hujdurovic, Ademir; Kutnar, Klavdija; Morris, Dave Witte; Morris, Joy (Drustvo Matematikov, Fizikov in AstronomovArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of PrimorskaUniversity of Lethbridge, 2016)
    We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple ...
  • Morris, Joy (University of Calgary, Department of Mathematics & StatisticsArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of Lethbridge, 2016)
    In this paper, we begin by partitioning the edge (or arc) set of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that ...
  • Curran, Stephen J.; Morris, Dave Witte; Morris, Joy (Drustvo Matematikov, Fizikov in AstronomovArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of Pittsburgh at JohnstownUniversity of Lethbridge, 2012)
    Suppose G is a finite group, such that |G| = 16p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).
  • Morgan, Luke; Morris, Joy; Verret, Gabriel (Drustvo Matematikov, Fizikov in AstronomovArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of Western AustraliaUniversity of Lethbridge, 2018)
    A Cayley graph on a group G has a natural edge-colouring. We say that such a graph is CCA if every automorphism of the graph that preserves this edge-colouring is an element of the normaliser of the regular representation ...
  • Dobson, Ted; Hujdurovic, Ademir; Kutnar, Klavdija; Morris, Joy (The University of Queensland, Centre for Discrete Mathematics and ComputingArts and ScienceDepartment of Mathematics and Computer ScienceMississippi State UniversityUniversity of PrimoskaUniversity of Lethbridge, 2017)
    In a Cayley digraph on a group G, if a distinct colour is assigned to each arc-orbit under the left-regular action of G, it is not hard to show that the elements of the left-regular action of G are the only digraph ...
  • Dobson, Edward; Morris, Joy (Electronic Journal of CombinatoricsArts and ScienceDepartment of Mathematics and Computer ScienceMississippi State UniversityUniversity of Lethbridge, 2002)
    Let S be a subset of the units in Zn. Let Γ be a circulant graph of order n (a Cayley graph of Zn) such that if ij ∈ E(Γ), then i − j (mod n) ∈ S. Toida conjectured that if Γ0 is another circulant graph of order n, then Γ ...
  • Dobson, Edward; Morris, Joy (Electronic Journal of CombinatoricsArts and ScienceDepartment of Mathematics and Computer ScienceMississippi State UniversityUniversity of Lethbridge, 2009)
    We generalize a classical result of Sabidussi that was improved by Hemminger, to the case of directed color graphs. The original results give a necessary and sufficient condition on two graphs, C and D, for the automorphsim ...
  • Jordan, Heather; Morris, Joy (The University of Queensland, Centre for Discrete Mathematics and ComputingArts and ScienceDepartment of Mathematics and Computer ScienceAlbion CollegeUniversity of Lethbridge, 2017)
    In this paper, we provide necessary and sufficient conditions for the existence of a cyclic m-cycle system of Kn −I when m and n are even and m | n.
  • Morris, Joy (Electronic Journal of CombinatoricsArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of Lethbridge, 2016)
    A finite group G is a DCI-group if, whenever S and S0 are subsets of G with the Cayley graphs Cay(G,S) and Cay(G,S0) isomorphic, there exists an automorphism ϕ of G with ϕ(S) = S0. It is a CI-group if this condition holds ...
  • Morris, Joy; Spiga, Pablo; Verret, Gabriel (Electronic Journal of CombinatoricsArts and ScienceDepartment of Mathematics and Computer ScienceUniversity of LethbridgeUniversity of Milano-BicoccaThe University of Western Australia, 2015)
    We characterise connected cubic graphs admitting a vertex-transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the ...

View more