skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 10:00 PM ET on Thursday, March 12 until 2:00 AM ET on Friday, March 13 due to maintenance. We apologize for the inconvenience.


Title: Linear algebra students’ reasoning with compositions of linear transformations
Award ID(s):
1914841
PAR ID:
10570940
Author(s) / Creator(s):
;
Publisher / Repository:
Proceedings of the 26th Annual Conference on Research in Undergraduate Mathematics Education
Date Published:
Journal Name:
Proceedings of the Annual Conference on Research in Undergraduate Mathematics Education
ISSN:
2474-9346
Page Range / eLocation ID:
1229-1235
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
  2. Abstract A classical result of Erdős and, independently, of Bondy and Simonovits [3] says that the maximum number of edges in ann-vertex graph not containingC2k, the cycle of length 2k, isO(n1+1/k). Simonovits established a corresponding supersaturation result forC2k’s, showing that there exist positive constantsC,cdepending only onksuch that everyn-vertex graphGwithe(G)⩾Cn1+1/kcontains at leastc(e(G)/v(G))2kcopies ofC2k, this number of copies tightly achieved by the random graph (up to a multiplicative constant). In this paper we extend Simonovits' result to a supersaturation result ofr-uniform linear cycles of even length inr-uniform linear hypergraphs. Our proof is self-contained and includes ther= 2 case. As an auxiliary tool, we develop a reduction lemma from general host graphs to almost-regular host graphs that can be used for other supersaturation problems, and may therefore be of independent interest. 
    more » « less
  3. null (Ed.)