Відео

Is hadamard determinant problem proved for powers of 2?

Especially the point about density, imitating prime numbers and generating a sequence without consecutive points. Σε ευχαριστώ πολύ να είσαι πάντα ευλογημένη και πεφωτισμένη....

You deserve my gratitude. Presentation serves as a fruitful springboard to continue my research paper on independence proofs... you deserve praise and respect.

Proud of my tutor, Dr. Shirazi. From UoM

That's Downey bro, not you. Okay?

Can we get the PPT?

Where can I read more about association scheme?

You can't focus??????

Hi folks. For physics application and motivation, the thing to consider is that the kinds of numbers (multiple zeta values, special values of L functions, etc) appearing in the Feynman period roughly provides a bound on how complex the numbers can be for the same graph topology for any qft -- sometimes the extra structure of another qft could cause cancellations but it can't make the numbers more complex. This isn't anywhere near a rigorous theorem for a number of reasons (first proving much of anything about transcendentality of zeta values etc. is out of reach, second the underlying algebraic variety could have other periods and the physical one isn't proven generic in the right kind of way, and so on) but the physics reasoning should be that working with scalar field theory isn't about working with a toy qft, but is about separating out the part that comes just from the graph topology, and which is generic for that graph topology no matter the qft. As to the formal power series and rigour, the things we do in the paper are fully mathematically rigorous (unlike the paragraph above); you don't need a nonzero radius of convergence for these results. That's what the theory of formal power series is all about (of course when they do converge you get a bunch of extra analytic tools, yielding the field of analytic combinatorics). If you want to read more about that check out a text on enumerative combinatorics.

physics person here. i had to look up the paper; i was pretty instantly lost lol. i guess i would still appreciate more of a physics/computational perspective here. for physics, this looks to be some result for phi^4 theory. can it be extended to do useful things in a non-toy model quantum field theory? how difficult are these period computations without using this martin invariant? no offense, i think it's probably much nicer to mathematically to pretend phi^4 is physics, but i can almost guarantee that there are still more interesting math questions to be asked and answered in an actual (standard model) qft. combinatorics is also not often all that challenging for computers, so again even without the physics perspective, it would be nice to know what this does for people as a new computational tool/set of tools. congratulations on the result.

Grateful for the enlightening online discourse delivered by the esteemed Professor George Andrews. Thank you by Manish Kumar at BITS Hyderabad, India

You are the best

thanks for this great lesson

love it

Give an example for better understanding.

This is awesome.

Pls send me books to read more proximal method

Prof. Molloy did a great job explaining entropy compression in simple and concrete examples, comprehensible at undergrad and master's level. The talk really helps people understand the key ideas without worrying much about the details.

Kindly send me this webirPPT

Kindly send me this webirPPT

Proud to be Indian . Genius Sirinivasa Ramanujan.

Shouldn’t the Rogers-Ramanujan identities be named the “Rogers identities”? Considering LJ Rogers proved them independently in 1894 20 years before Ramanujan did?

Goated with the sauce

𝐩яⓞ𝓂𝓞Ş𝐦

Sir does matching polynomail exist for graphs with self loops ?

omg faffe

can you create one vidoe about quantum sort algorithms

Awesome!

nice tino 👍

Thank you for sharing!

Does anybody know about the billion size problems in finance? Any references? Mentioned at 49:33

Sir caan you please explain the theorem called All zeroes of the matching polynomial of all graphs are real valued.

Can we get this pdf file of presentation ? it is a humble request :)

omg,cool video, excellent speaker

Those videos are really helpful! Could you guys please post more related videos, tysm!

Sounds like my microphone cut out at the beginning - sorry, Abhinav! Luckily everything I said is on the first slide :)

GO August!!!!

WOW! the introduction was incredible!

Nattan der ehren mann

Hi mate! Liked the video, good job. Have you thought about using SMZeus . c o m to promote your videos!?

RIP graham :( :(

Thank you.

赞！ Great job!

Very cool :)

Yo this is dope Rutger!!!