Related papers: The theories of Baldwin-Shi hypergraphs and their …

Sidorenko's conjecture states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge density. While still open for graphs, the…

We study general representations of the free group on two generators into $SL(2,C)$, and the connection with generalized Markoff maps, following Bowditch. We show that Bowditch's Q-conditions for generalized Markoff maps are sufficient for…

We extend the notion of a Thomas projective connection (a projective equivalence class of linear connections) for supermanifolds. As a by-product, we arrive at a generalisation of the multidimensional Schwarzian derivative for the super…

We initiate a study of cohomological aspects of weakly almost periodic group representations on Banach spaces, in particular, isometric representations on reflexive Banach spaces. Using the Ryll-Nardzewski fixed point Theorem, we prove a…

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…

Let $(G,\theta)$ be a Banach--Lie group with involutive automorphism $\theta$, $\g = \fh \oplus \fq$ be the $\theta$-eigenspaces in the Lie algebra $\g$ of $G$, and $H = (G^\theta)_0$ be the identity component of its group of fixed points.…

In this paper, we countinue our work in \cite{11}. We show that $L^{1}(G,w)$ is $\phi_{0}$-biprojective if and only if $G$ is compact, where $\phi_{0}$ is the augmentation character. We introduce the notions of character Johnson amenability…

In this paper, we introduce and analyze a random graph model $\mathcal{F}_{\chi,n}$, which is a configuration model consisting of interior and boundary vertices. We investigate the asymptotic behavior of eigenvalues for graphs in…

The super-parametric density estimators and its related algorism were suggested by Y. -S. Tsai et al [7]. The number of parameters is unlimited in the super- parametric estimators and it is a general theory in sense of unifying or…

Given a semisimple Lie algebra $\mathfrak{g}$, we can represent invariants of tensor products of fundamental representations of the quantum enveloping algebra $U_q(\mathfrak{g})$ using particular directed graphs called webs. In particular…

Given a Yamaguchi nonrigid parabolic model geometry $(G,P)$ with $G$ simple of real rank at least $3$, we use techniques developed by Erickson to establish the existence of closed, nonflat, essential, regular, normal Cartan geometries…

In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…

We extend the classical notion of standardly stratified $k$-algebra (stated for finite dimensional $k$-algebras) to the more general class of rings, possibly without $1,$ with enough idempotents. We show that many of the fundamental…

We show that for any fixed $\alpha>0$, cherry-quasirandom 3-graphs of positive density and sufficiently large order $n$ with minimum vertex degree $\alpha \binom n2$ have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and…

A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…

We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

A theorem by Ding, Oporowski, Oxley, and Vertigan states that every sufficiently large bipartite graph without twins contains a matching, co-matching, or half-graph of any given size as an induced subgraph. We prove that this Ramsey…