The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We consider a natural variant of the Erdős–Rényi random graph process in which vertices are special and are never put into the same connected component. The model is natural and interesting on its own, but is actually inspired by the multiway cut problem that itself is connected to a number of important problems in graph theory. We will show that a phase transition for the appearance of the...
Brown and Schnetz found that the number of points over Fp of a graph hypersurface is often related to the coefficients of a modular form. We set some of the reduction techniques used to discover such relations in a general geometric context. We also prove the relation for two examples of modular forms of weight 3 and two of weight 4, refine the statement and suggest a method of proving it for three...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.