Related papers: Eulerian Spaces

Hodograph equations for the Euler equation in curved spaces with constant pressure are discussed. It is shown that the use of known results concerning geodesics and associated integrals allows to construct several types of hodograph…

Kreck and Yang Su recently gave counterexamples to a version of the Torelli theorem for hyperk\"ahlerian manifolds as stated by Verbitsky. The initial purpose of this document (which was prepared for a seminar talk) was to extract the…

The spectrum of the Laplacian of successive Barycentric subdivisions of a graph converges exponentially fast to a limit which only depends on the clique number of the initial graph and not on the graph itself. The proof uses an explicit…

We study a class of graph foliated spaces, or graph matchbox manifolds, initially constructed by Kenyon and Ghys. For graph foliated spaces we introduce a quantifier of dynamical complexity which we call its level. We develop the fusion…

We present a simple generalization of $W$-spaces introduced by G. Gruenhage. We show that this generalization leads to a strictly larger class of topological spaces which we call $\widetilde W$-spaces, and we provide several applications.…

For an affine complex algebraic singular space Y, we define a global Euler obstruction Eu(Y) which extends the Euler-Poincare characteristic of a nonsingular Y. Using Lefschetz pencils, we express Eu(Y) as alternating sum of global polar…

We survey the distributional properties of progressively dilating sets under projection by covering maps, focusing on manifolds of constant sectional curvature. In the Euclidean case, we review previously known results and formulate some…

The notion of topological entropy is originally defined for a single action. Later it was extended by Kieffer for arbitrary discrete amenable groups. Recently Friedland defined topological entropy for any discrete group actions amenable or…

We define the Eulerian ideal of a $k$-uniform hypergraph and study its degree and Castelnuovo--Mumford regularity. The main tool is a Gr\"obner basis of the ideal obtained combinatorially from the hypergraph. We define the notion of parity…

We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

This paper is concerned with the existence of compactly supported admissible solutions to the Cauchy problem for the isentropic compressible Euler equations. In more than one space dimension, convex integration techniques developed by De…

In this paper, we study the geometric configurations of a finite set of points having the Cayley-Bacharach property in the $n$-dimensional projective space $\bbP^n$. Our main contribution is the proof of the Levinson-Ullery conjecture for…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the…

Let $S$ be an orientable surface with negative Euler characteristic. For $k \in \mathbb{N}$, let $\mathcal{C}_{k}(S)$ denote the $\textit{k-curve graph}$, whose vertices are isotopy classes of essential simple closed curves on $S$, and…

We give a topological characterization of the n-dimensional pseudo-boundary of the (2n+1)-dimensional Euclidean space.

We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…

Recall that the Rado graph is the unique countable graph that realizes all one-point extensions of its finite subgraphs. The Rado graph is well-known to be universal and homogeneous in the sense that every isomorphism between finite…

In 1996, Meshulam proved that any sequence generated in Euclidean space by randomly projecting onto affine subspaces drawn from a finite collection stays bounded even if the intersection of the subspaces is empty. His proof, which works…