vqn加速外网-vp免费加速-vqn免费试用下载-外网加速免费软件-vqn加速外网

Is there any polynomials of two variables with rational coefficients, such that the map  is a bijection?  This is a famous 9-years old open question on MathOverflow.  Terry Tao initiated a sort of polymath attempt to solve this problem conditioned on some conjectures from arithmetic algebraic geometry.  This project is based on an plan by Tao for a solution, similar to a 2009 result by Bjorn Poonen who showed that conditioned on the Bombieri-Lang conjecture, there is a polynomial so that the map  is injective. (Poonen’s result  answered a question by Harvey Friedman from the late 20th century, and is related also to a question by Don Zagier.)

The Hadwiger-Nelson problem is that of determining the chromatic number of the plane (), defined as the minimum number of colours that can be assigned to the points of the plane so as to prevent any two points unit distance apart from being the same colour. It was first posed in 1950 and the bounds were rapidly demonstrated, but no further progress has since been made. In a recent preprint, I have now excluded the case by identifying a family of non--colourable finite “unit-distance” graphs, i.e. graphs that can be embedded in the plane with all edges being straight lines of length . However, the smallest such graph that I have so far discovered has [EDIT: after correction] vertices, and its lack of a -colouring requires checking for the nonexistence of a particular category of -colourings of subgraphs of it that have [EDIT: after correction] and vertices, which obviously requires a computer search.

I’m therefore wondering whether a search for “simpler” examples might work as a Polymath project. An example might be defined as simpler if it has fewer vertices, or if it has a smaller largest subgraph whose -colourability must be checked directly, etc. I feel that a number of features make this nice for Polymath:

1. 在中国怎样上instagram:2021-4-22 · 手机上Instagram 1：点击桌面上的“设置” 2：点击“通用” 3：点击“网络” 4：点击“VPN"进入VPN设置 5：点击“添加VPN配置” 6：在协议类型上选择“PPTP”描述，随便写，账号密码就是i7加速器官网注册的账号密码，服务器是找他伔官网索要的，输入好这些，保存，连接就可众了 7：成功连接就可众 ...
2. it entails a rich interaction between theory and computation
3. simpler graphs may lead to insights into what properties such graphs will always/usually have, which might inspire strategies for seeking 6-chromatic examples, improved bounds to the analogous problem in higher dimensions, etc.

I welcome comments!

Aubrey de Grey

This post is to note that the polymath13 project has successfully settled one of the major objective. Reports on it can be found on Gower’s blog especially in this post Intransitive dice IV: first problem more or less solved? and this post Intransitive dice VI: sketch proof of the main conjecture for the balanced-sequences model.

A polymath-style project on non transitive dice (Wikipedea) is now running over Gowers blog. (Here is the link to the first post.)

We haven’t quite hit the 100-comment mark on the second Polymath 12 blog post, but this seems like a good moment to take stock.  The project has lost some of its initial momentum, perhaps because other priorities have intruded into the lives of the main participants (I know that this is true of myself).  However, I don’t want to turn out the lights just yet, because I don’t believe we’re actually stuck.  Let me take this opportunity to describe some of the leads that I think are most promising.

Online Version of Conjecture

For general matroids, the online version of Rota’s Basis Conjecture is false, but it is still interesting to ask how many bases are achievable.  One of the nicest things to come out Polymath 12, in my opinion, has been a partial answer to this question: It is somewhere between n/3 + c and n/2 + c.  There is hope that this gap could be closed.  If the gap can be closed then in my opinion this would be a publishable short paper.  Incidentally, if a paper is published by Polymath 12, what pseudonym should be used?  I know that D. H. J. Polymath was used for the first project, but maybe R. B. C. Polymath would make more sense?

免费翻国外墙的app

It was suggested early on that graphic matroids might be a more tractable special case.  It wasn’t immediately clear to me at first why, but I understand better now.  Specifically, graphic matroids with no K₄ minor are series-parallel and therefore strongly base-orderable and therefore satisfy Rota’s Basis Conjecture.  Thus, in some sense, K₄ is the only obstruction to Rota’s Basis Conjecture for graphic matroids, whereas the analogous claim for matroids in general does not hold.

In one of my papers I showed, roughly speaking, that if one can prove an n × 2 version of Rota’s Basis Conjecture, then this fact can be parlayed into a proof of the full conjecture. Of course the n × 2 version is false in general, but I do believe that a thorough understanding of what can happen in just two columns will give significant insight into the full conjecture.  One question I raised was whether any n × 2 arrangement of edges can yield two columns that are bases if we pull out no more than n/3 edges. This is perhaps a somewhat clumsy question, but it is trying to get at the question of whether there are any n × 2 counterexamples that are not just the disjoint union of copies of K₄ that have been expanded by “uncontracting” some edges. If we can classify all n × 2 counterexamples then I think that this would be a big step towards proving the full conjecture for graphic matroids.

This is of course not the only possible way to tackle graphic matroids. The main point is that I think there is potential for serious progress on this special case.

安卓手机中国怎么上instagram

I mentioned an unpublished manuscript by Michael Cheung that reports that the n = 4 case of Rota’s Basis Conjecture is true for all matroids.  I find this to be an impressive computation and I think it deserves independent verification.

Finding 5 × 2 counterexamples to Rota’s Basis Conjecture would also be illuminating in my opinion. Gordon Royle provided a link to a database of all nine-element matroids that should be helpful. Luke Pebody started down this road but as far as I know has not completed the computation.

facebook

In 1995, Marcel Wild proved the following result (“Lemma 6”): Let be a matroid on an -element set that is a disjoint union of independent sets of size . Assume that there exists another matroid on the same ground set with the following properties:

(1) is strongly base orderable.

(2) for all , where is the rank function of .

(3) All circuits of satisfying remain dependent in .

Then there is an grid whose th row comprises and whose columns are independent in .

Wild obtained several partial results as a corollary of Lemma 6.  How much mileage can we get out of this?  Can we always find a suitable for graphic matroids?

在中国怎么上snapchat

I’m less optimistic that these will lead to progress on Rota’s Basis Conjecture itself, but maybe I’m wrong.  Gil Kalai made several suggestions:

1. Consider d + 1 (affinely independent) subsets of size d + 1 of such that the origin belongs to the interior of the convex hull of each set. Is it possible to find d + 1 sets of size d + 1 such that each set is a rainbow set and the interior of the convex hulls of all these sets have a point in common?
2. The wide partition conjecture or its generalization to arbitrary partitions.
3. If we have sets B₁, …, B_n (not necessarily bases) that cannot be arranged so that all n columns are bases, then can you always find disjoint n + 1 sets C₁, …, C_n+1 such that each set contains at most one member from each B_j and the intersection of all linear spans of the C_i is non trivial?  (I confess I still don’t see why we should expect this to be true.)

Pavel Paták presented a lemma from 免费翻国外墙的app that might be useful. Let M be a matroid of rank r and let S be a sequence of kr elements from M, split into r subsequences, each of length at most k. Then any largest independent rainbow subsequence of S is a basis of M if and only if there does not exist an integer s < r and set of s + 1 color classes, such that the union of these color classes has rank s.

In a different direction, there are graph-theoretic conjectures such as the 中国iphone怎么上ins conjecture: If the complete graph K_2m (for m ≥ 3) is edge-colored in such a way that every color class is a perfect matching, then there is a decomposition of the edges into m edge-disjoint rainbow spanning trees.

中国怎么上instagram

Finally, let me make a few remarks about the directions of research that were suggested in my previous Polymath 12 blog post.  I was initially optimistic about matroids with no small circuits and I still think that they are worth thinking about, but I am now more pessimistic that we can get much mileage out of straightforwardly generalizing the methods of Geelen and Humphries, for reasons that can be found by reading the comments.  Similarly I am more pessimistic now that the algebro-geometric approach will yield anything since being a basis is an open condition rather than a closed condition.

The other leads in that blog post have not been pursued much and I think they are still worth looking at.  In particular, that old standby, the Alon–Tarsi Conjecture, may still admit more partial results. Rebecca Stones’s suggestion that maybe L_n^even – L_n^odd ≢ 0 (mod p) when p = 2n + 1 is prime still looks to me like a good idea and I don’t think many people have seriously thought about this. Also I agree with David Glynn that more people should study Carlos Gamas’s recent paper on the Alon–Tarsi Conjecture.

There has been enough interest that I think we can formally declare Rota’s Basis Conjecture to be Polymath 12. I am told that it is standard Polymath practice to start a new blog post whenever the number of comments reaches about 100, and we have reached that point, so that is one reason I am writing a second post at this time. I am also told that sometimes, separate “discussion” and “research” threads are created; I’m not seeing an immediate need for such a separation yet, and so I am not going to state a rule that comments of one type belong under the original post whereas comments of some other type belong under this new post. I will just say that if you are in doubt, I recommend posting new comments under this post rather than the old one, but if common sense clearly says that your comment belongs under the old post then you should use common sense.

The other reason to create a new post is to take stock of where we are and perhaps suggest some ways to go forward. Let me emphasize that the list below is not comprehensive, but is meant only to summarize the comments so far and to throw in a few ideas of my own. Assuming this project continues to gather steam, the plan is to populate the associated Polymath Wiki page with a more comprehensive list of references and statements of partial results. If you have an idea that does not seem to fit into any of the categories below, please consider that to be an invitation to leave a comment about your idea, not an indication that it is not of interest!

Matroids with No Small Circuits

I want to start with an idea that I mentioned in my MathOverflow post but not in my previous Polymath Blog post. I think it is very promising, and I don’t think many people have looked at it. Geelen and Humphries proved that Rota’s Basis Conjecture is true for paving matroids. In the case of vector spaces, what this means is that they proved the conjecture in the case where every (n – 1)-element subset of the given set of n² vectors is linearly independent. It is natural to ask if n – 1 can be reduced to n – 2. I have not digested the Geelen–Humphries paper so I do not know how easy or hard this might be, but it certainly could not hurt to have more people study this paper and make an attempt to extend its results. If an oracle were to tell me that Rota’s Basis Conjecture has a 10-page proof and were to ask me what I thought the method was, then at this point in time I would guess that the proof proceeds by induction on the size of the smallest circuit. Even if I am totally wrong, I think we will definitely learn something by understanding exactly why this approach cannot be extended.

正版中国 | 正版软件限时免费:2021-4-29 · 正版中国成立于2021年7月,众提供正版软件限时免费信息为途径,引导用户养成使用正版软件的习惯,众此促进国内版权氛围的改进。目前已经得到上百家软件开发者的支持！

Let me now review the progress on the three ideas I mentioned in my first blog post. In Idea 1, I asked if the n² vectors could be partitioned into at most 2n – 2 independent partial transversals. A nice proof that the answer is yes was given by domotorp. Eli Berger then made a comment that suggested that the topological methods of Aharoni and Berger could push this bound lower, but there was either an error in his suggestion or we misunderstood it. It would be good to get this point clarified. I should also mention that Aharoni mentioned to me offline that he unfortunately could not participate actively in Polymath but that he did have an answer to my question about their topological methods, which is that the topological concepts they were using were intrinsically not strong enough to bring the bound down to n + 1, let alone n. It might nevertheless be valuable to understand exactly how far we can go by thinking about independent partial transversals. Ron Aharoni and Jonathan Farley both had interesting ideas along these lines; rather than reproduce them here, let me just say that you can find Aharoni’s comment (under the previous blog post) by searching for “Vizing” and Farley’s comment by searching for “Mirsky.”

Local Obstructions

Idea 2 was to look for additional obstructions to natural strengthenings of Rota’s Basis Conjecture, by computationally searching for counterexamples that arise if the number of columns is smaller than the number of rows. Luke Pebody started such a search but reported a bug. I still believe that this computational search is worth doing, because I suspect that any proof that Rota’s Basis Conjecture holds for all matroids is going to have to come to grips with these counterexamples.

Note that if we are interested just in vector spaces, we could do some Gröbner basis calculations. I am not sure that this would be any less computationally intensive than exhausting over all small matroids, but it might reveal additional structure that is peculiar to the vector space case.

Algebraic Geometry

There has been minimal progress in this (admittedly vague) direction. I will quote Ellenberg’s initial thoughts: “If you were going to degenerate, what you would need to do is say: is there any version of this question that makes sense when the basic object is, instead of a basis of an n-dimensional vector space V, a 0-dimensional subscheme of V of degree n which is not contained in any hyperplane? For instance, in 2-space you could have something which was totally supported at the point (0,1) but which was “fat” in the horizontal direction of degree 2. This is the scheme S such that what it means for a curve C to contain S is that S passes through (0,1) and has a horizontal tangent there.”

Let me also mention that Jan Draisma sent me email recently with the following remarks: “A possible idea would be to consider a counterexample as lying in some suitable equivariant Hilbert scheme in which being a counterexample is a closed condition, then degenerate to a counterexample stable under a Borel subgroup of GL_n, and come to a contradiction. ‘Equivariant’ should reflect the action of GL_n × (S_n ⋉ S_nⁿ). However, I have not managed to make this work myself, even in low dimensions. In fact, having a good algebro-geometric argument for the n = 3 case, rather than a case-by-case analysis, would already be very nice!”

免费翻国外墙的app

Now let me move on to other ideas suggested in the comments. There were several thoughts about the Alon–Tarsi Conjecture that the Alon–Tarsi constant L_n^even – L_n^odd ≠ 0 when n is even. Rebecca Stones gave a formula that, as Gil Kalai observed, equated the Alon–Tarsi constant with the top Fourier–Walsh coefficient for the function detⁿ; i.e., up to sign, the Alon–Tarsi constant is

Σ_A (–1)^σ(A) det(A)ⁿ,

where the sum is over all zero-one matrices and σ(A) is the number of zero entries in A. This formula suggests various possibilities. For example one could try to prove that L_n^even – L_n^odd ≢ 0 (mod p) where p = 2n + 1 is prime, because in this case, det(A)ⁿ must be 0, 1, or –1. This would already be a new result for n = 26, and the case n = 6 is small enough to compute explicitly and look for inspiration. Luke Pebody posted the results of some computations in this case.

Another possibility, suggested by Gil Kalai, is to consider a Gaussian analogue. Instead of random zero-one matrices, consider random Gaussian matrices and try to understand the Hermite expansion of detⁿ, in particular showing that the coefficient corresponding to all ones is nonzero. This might be easier and might give some insight.

Note also that in the comments to my MathOverflow post, Abdelmalek Abdesselam proposed an analogue of the Alon–Tarsi conjecture for odd n. I do not think that many people have looked at this.

潘达工具箱 - 史上最全面的外网工具注册&使用教程:2021-4-29 · 超好用的Win10电脑外网连接软件推荐 5款最适合安卓手机上外网的软件 国内苹果手机用户首选加速器 加速推荐 2021年科学上网方法整理-Express科学加速测评 游戏&娱乐 怎么在中国看网飞（Netflix） Pixiv官网如何注册账号 怎么看R-18 Fakku绅士站官网登录

Some generalizations and special cases of the conjecture were mentioned in the comments. Proving the conjecture for graphic matroids or binary matroids would be an enormous advance. There is a generalization due to Jeff Kahn, in which we have n² bases B_ij and we have to pick v_ij ∈ B_ij to form an n × n grid whose rows and columns are all bases. Another generalization was prompted by a remark by David Eppstein: Suppose we are given n bases B₁, …, B_n of a vector space of dimension m ≤ n, and suppose we are given an n × n zero-one matrix with exactly m 1’s in every row and column. Can we replace each 1 in the matrix with a vector in such a way that the m vectors in row i are the elements of B_i and such that the m vectors in every column form a basis?

Juan Sebastian Lozano suggested the following reformulation: Does there exist a group G such that V is a representation of G and there exists g_i ∈ G such that g_i B_i = B_i+1, and for every vector b ∈ B₁,

span{g⁰b, …, g^{n – 1}b} = V

where gⁱ = g_i … g₁ and g⁰ is the identity?

Other Ideas

Fedor Petrov mentioned a theorem by him and Roman Karasev that looks potentially relevant (or at least the method of proof might be useful). Let p be an odd prime, and let V be the F_p-vector space of dimension k. Denote V^* = V \ {0} and put m = |V^*|/2 = (p^k – 1)/2. Suppose we are given m linear bases of the vector space V

(v₁₁, …, v_1k), (v₂₁, …, v_2k), …, (v_m1, …, v_mk).

Then there exist pairwise distinct x₁, …, x_m, y₁, …, y_m ∈ V^* and a map g:[m] → [k] such that for every i ∈ {1, …, m} we have y_i – x_i = v_ig(i).

百度网盘神器Pandownload已倒 替伕者ShengDownload走红:前两天百度网盘不限速神器Pandownload作者被抓，这个软件很快就不能用了，这对非会员来说很难受，因为这个软件真的太好用了。Pandownload刚倒，马上就有了替伕者ShengDownload。

Π {(x_i – λ_ex_j) : i < j, {i,j} = e ∈ E(G)},

where the λ_e are weights associated to the edges e.