Browsing by Author "Meagher, Karen"

Browsing by Author "Meagher, Karen"

Sort by: Order: Results:

  • C.V. 
    Meagher, Karen (2014-01-21)
  • Meagher, Karen; Spiga, Pablo (SIAM Journal on Discrete Mathematics, 2014)
    Let G = PGL(2, q) be the projective general linear group acting on the projec- tive line P_q. A subset S of G is intersecting if for any pair of permutations \pi and \sigma in S, there is a projective point p in P_q such ...
  • Meagher, Karen; Spiga, Pablo; Tiep, Pham Huu (European Journal of Combinatorics, 2016)
    We prove an analogue of the classical Erdős-Ko-Rado theorem for intersecting sets of permutations in finite \(2\)-transitive groups. Given a finite group \(G\) acting faithfully and \(2\)-transitively on the set ...
  • Purdy, Alison May (Faculty of Graduate Studies and Research, University of Regina, 2010)
    The Erdős-Ko-Rado Theorem is a fundamental result in extremal set theory. It describes the size and structure of the largest collection of subsets of size k from a set of size n having the property that any two subsets ...
  • Meagher, Karen; Spiga, Pablo (SIAM J. Discrete Math. 28, 2014)
    In this paper we prove an Erdős-Ko-Rado-type theorem for intersecting sets of permutations. We show that an intersecting set of maximal size in the projective general linear group \(PGL_3(q)\), in its natural ...
  • Fan, Gaojian (Faculty of Graduate Studies and Research, University of Regina, 2012-07)
    In computational learning theory, concepts are subsets of a set of instances and a concept class is a set of concepts. In many computational learning models, learning algorithms have the goal to identify the target concept ...
  • Borg, Peter; Meagher, Karen (2014-01-21)
  • Ahmadi, Bahman (Faculty of Graduate Studies and Research, University of Regina, 2013-07)
    In extremal set theory, the Erd}os-Ko-Rado (EKR) theorem gives an upper bound on the size of intersecting k-subsets of the set {1; : : : ;n}. Furthemore, it classi es the maximum-sized families of intersecting k-subsets. ...
  • Meagher, Karen; Ihringer, Ferdinand (2016-06)
    In this paper we give a proof of the Mikl´os-Manickam-Singhi (MMS) conjecture for some partial geometries. Specifically, we give a condition on partial geometries which implies that the MMS conjecture holds. Further, ...
  • Ahmadi, Bahman; Alinaghipour, Fatemeh; Cavers, Michael; Fallat, Shaun; Meagher, Karen; Nasserasr, Shahla (International Linear Algebra Society, 2013-09)
    The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph G, is denoted by q(G). Using other parameters related to G, bounds for q(G) are proven and then applied to ...
  • Sadeqi, Mehdi (Faculty of Graduate Studies and Research, University of Regina, 2014-09)
    Problem solving is a very important aspect of arti cial intelligence. This thesis focuses on problems that can be formulated as search problems in a state space. Since blindly searching in a large state space is usually ...
  • Tessier, Ryan Brett (Faculty of Graduate Studies and Research, University of Regina, 2013-08)
    A sample compression scheme of size k for a concept class C is a pair of functions (f; g) called the compression function and the reconstruction function. The functions have the property that for any sample S consistent ...
  • Meagher, Karen; Fallat, Shaun; Yang, Boting (Elsevier, 2015)
    The positive semidefinite zero forcing number of a graph is a graph parameter that arises from a non-traditional type of graph colouring and is related to a more conventional version of zero forcing. We establish a relation ...
  • Alinaghipour, Fatemeh; Fallat, Shaun; Meagher, Karen (2014)
    The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced ...
  • Singh, Gurmail (Faculty of Graduate Studies and Research, University of Regina, 2015-09)
    We study torsion units of algebras over the ring of integers Z with nice bases. These include integral group rings, integral adjacency algebras of association schemes and integral C-algebras. Torsion units of group rings ...
  • Purdy, Alison May (Faculty of Graduate Studies and Research, University of Regina, 2014-09)
    The Erdös-Ko-Rado theorem, a theorem which gives the size and structure of the largest pairwise intersecting collection of k-subsets from a base set of size n, has inspired many variations on the theme of the maximum ...
  • Alinaghipour Taklimi, Fatemeh (Faculty of Graduate Studies and Research, University of Regina, 2013-08)
    For any simple graph G on n vertices, the (positive semi-de nite) minimum rank of G is de ned to be the smallest possible rank among all (positive semi-de nite) real symmetric n × n matrices whose entry in position (i; ...