Skip to main content
Gerhard Paseman's user avatar
Gerhard Paseman's user avatar
Gerhard Paseman's user avatar
Gerhard Paseman
  • Member for 14 years, 11 months
  • Last seen more than 9 years ago
comment
Making integer multisets graphic
Here is another idea which may get $k$ down to around $(b\log b)/m$. Start by picking $k = \lceil b/m \rceil$ and create a graphical fragment using $k$ columns. Hook up as many of these as you can to reduce the maximal number of unconnected edges at any vertex. Now double the fragment and hook up remaining edges between fragments. Iterate the doubling process until done. This may end up terminating quickly. Gerhard "Leaves The Analysis To You" Paseman, 2015.10.30.
comment
Making integer multisets graphic
Another obvious observation is that $km \gt b$. This really hinges on the maximal degree. It may be worth expressing $k$ as a function of $b/m$. Gerhard "Happy All Hallows Eve Eve" Paseman, 2015.10.30
revised
Making integer multisets graphic
fix arithmetic and notation
Loading…
comment
Recognize this countably generated abelian group?
Uh, if $q=1$, the group is no longer infinitely generated. I think the condition $1 \lt q \lt p$ shows where the interesting part is. I do like that your answer does cover the case $q=1$. Gerhard "For My Idea Of Interesting" Paseman, 2015.10.30
revised
Making integer multisets graphic
added 12 characters in body
Loading…
revised
Loading…
answered
Loading…
comment
Making integer multisets graphic
Is $X$ the set of degree values? If so, and if $b$ is the largest value of $X$, then in general $k \leq b$ (need $b+1$ when $M$ is a singleton). Gerhard "Will Add More With Confirmation" Paseman, 2015.10.30
reviewed
Approve
revised
Loading…
revised
Loading…
comment
Cyclotomic polynomials: $\Phi_n(p)$ is like $p^{\phi(n)}$ for big enough $p$, right?
I did, and it got reverted to Jamseon Thanks for the catch. Gerhard "Still Have Seoul Inside Me" Paseman, 2015.10.23
Loading…
revised
Loading…
Loading…
comment
Cyclotomic polynomials: $\Phi_n(p)$ is like $p^{\phi(n)}$ for big enough $p$, right?
To my surprise, Jameson actually starts the notes using complex conjugate pairs. You might enjoy following the development for the first few pages. Gerhard "Maybe Complex Can Be Simpler" Paseman, 2015.10.21
comment
Cyclotomic polynomials: $\Phi_n(p)$ is like $p^{\phi(n)}$ for big enough $p$, right?
I think students should note the following: I had some of the clues posted above before seeing Jameson's writeup, especially about using inversion and noting the improvement using prime powers. I didn't have 1.19, but might have developed it. The moral is to believe in the clues: I am surprised I got that close to a solution from just quick observations. Gerhard "Off To Observe Some More" Paseman, 2015.10.21
revised
Loading…
comment
Cyclotomic polynomials: $\Phi_n(p)$ is like $p^{\phi(n)}$ for big enough $p$, right?
OK. If you change your mind, let me know by email. I will reference this MathOverflow answer in a write-up, and am willing to include real-life names (and some real beverages) to you and fedja as desired. Gerhard "Prefers An East Bay Visit" Paseman, 2015.10.20
comment
Cyclotomic polynomials: $\Phi_n(p)$ is like $p^{\phi(n)}$ for big enough $p$, right?
@Gerry , some of us would like to know more. In particular, is $\Phi_n(2)/2^{\phi(n)} \gt 3/2$ only for odd primes $n$? Gerhard "Almost Read Gerry's (Almost) Paper" Paseman, 2015.10.20
1
2
3 4 5
55