Related papers: A counterexample to Thiagarajan's conjecture on re…

Settling a first case of a conjecture of M. Kahle on the homology of the clique complex of the random graph $G=G_{n,p}$, we show, roughly speaking, that (with high probability) the triangles of $G$ span its cycle space whenever each of its…

Event structures are fundamental models in concurrency theory, providing a representation of events in computation and of their relations, notably concurrency, conflict and causality. In this paper we present a theory of minimisation for…

Contextuality is one way of capturing the non-classicality of quantum theory. The contextual nature of a theory is often witnessed via the violation of non-contextuality inequalities---certain linear inequalities involving probabilities of…

Let $G$ be a complex connected reductive algebraic group that acts on a smooth complex algebraic variety $X$, and let $E$ be a $G$-equivariant algebraic vector bundle over $X$. A section of $E$ is regular if it is transversal to the zero…

Real-life graphs usually have various kinds of events happening on them, e.g., product purchases in online social networks and intrusion alerts in computer networks. The occurrences of events on the same graph could be correlated,…

We define a class of quantum systems called regular quantum graphs. Although their dynamics is chaotic in the classical limit with positive topological entropy, the spectrum of regular quantum graphs is explicitly computable analytically…

In this series, we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects such as undirected graphs, directed graphs, bidirected graphs, hypergraphs and finitary matroids.…

We study the typical structure of oriented graphs and digraphs that do not contain a blow-up T_{r+1}^t of a transitive tournament. For any integers r >= 2, t >= 1 and any real a in (3/2,2], we prove that almost all T_{r+1}^t-free oriented…

We prove the Gersten conjecture for $p$-adic \'etale Tate twists for a smooth scheme $X$ in mixed characteristic in the Nisnevich topology. Our main observation is that, while $p$-adic \'etale Tate twists are not $\mathbb A^1$-invariant,…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

We prove the filling area conjecture in the hyperelliptic case. In particular, we establish the conjecture for all genus 1 fillings of the circle, extending P. Pu's result in genus 0. We translate the problem into a question about closed…

Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques,…

We introduce cosurfaces with values in the group \(\PC_n(H)\) of \(H\)-valued reciprocal pairwise comparison matrices. The composition law is covariant on upper triangular coefficients and contravariant on lower triangular coefficients,…

Let M_{g,n}^rt be the moduli space of stable n-pointed curves of genus g>1 with rational tails. We also consider the space C_g^n classifying smooth curves of genus g with not necessarily distinct n ordered points. There is a natural proper…

Aperiodic tilings support two classically studied but hitherto separately presented structures: matching rules, which enforce global order via local constraints, and height functions, which encode global geometry through integer-valued…

In this paper it is proved that near a compact, invariant, proper subset of a continuous flow on a compact, connected metric space, at least one, out of twenty eight relevant dynamical phenomena, will necessarily occur. This result shows…

We introduce a new variant of the coarse Baum-Connes conjecture designed to tackle coarsely disconnected metric spaces called the boundary coarse Baum-Connes conjecture. We prove this conjecture for many coarsely disconnected spaces that…

The intersection of numerical analysis and machine learning, particularly in the domain of Neural ODEs and Physics-Informed Neural Networks (PINNs), relies heavily on discrete approximations of continuous flows. However, in stiff systems,…

In this paper, we study a conjecture of Andries E. Brouwer from 1996 regarding the minimum number of vertices of a strongly regular graph whose removal disconnects the graph into non-singleton components. We show that strongly regular…

We prove a few simple cases of a random graph statement that would imply the "second" Kahn--Kalai Conjecture. Even these cases turn out to be reasonably challenging, and it is hoped that the ideas introduced here may lead to further…