Related papers: Sidorenko property and forcing in regular tourname…

Let $\pi$ be a finitely presented group. If h is a non trivial homology class in Hn($\pi$; Z), a theorem of Gromov (see [Gro83], 6) asserts the existence of regular geometric cycles which represent h, whose relative systolic volume is as…

A result of Simonovits and S\'os states that for any fixed graph $H$ and any $\epsilon > 0$ there exists $\delta > 0$ such that if $G$ is an $n$-vertex graph with the property that every $S \subseteq V(G)$ contains $p^{e(H)} |S|^{v(H)} \pm…

A celebrated conjecture of Sidorenko and Erd\H{o}s-Simonovits 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…

We investigate tournaments with a specified score vector having additional structure: loopy tournaments in which loops are allowed, Hankel tournaments which are tournaments symmetric about the Hankel diagonal (the anti-diagonal), and…

Many fundamental problems in extremal combinatorics are equivalent to proving certain polynomial inequalities in graph homomorphism densities. In 2011, a breakthrough result by Hatami and Norine showed that it is undecidable to verify…

We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…

For a class of closed manifolds N, we construct a family of functions on the Hamiltonian group G of the cotangent bundle T*N. These restrict to homogeneous quasi-morphisms on the subgroup generated by Hamiltonians with support in a given…

This is a survey about certain "almost homomorphisms" and "almost linear" functionals (called quasi-morphisms and quasi-states) in symplectic topology and their applications to Hamiltonian dynamics, functional-theoretic properties of…

Recently, Dragani\'c, Munh\'a Correia, Sudakov and Yuster showed that every tournament on $(2+o(1))k^2$ vertices contains a $1$-subdivision of a transitive tournament on $k$ vertices, which is tight up to a constant factor. We prove a…

Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…

We describe structure of quasihomomorphisms from arbitrary groups to discrete groups. We show that all quasihomomorphisms are 'constructible', i.e., are obtained via certain natural operations from homomorphisms to some groups and…

We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.

Let $U_5$ be the tournament with vertices $v_1$, ..., $v_5$ such that $v_2 \rightarrow v_1$, and $v_i \rightarrow v_j$ if $j-i \equiv 1$, $2 \pmod{5}$ and ${i,j} \neq {1,2}$. In this paper we describe the tournaments which do not have $U_5$…

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then…

We present a comprehensive mechanism for the emergence of rotational horseshoes and strange attractors in a class of two-parameter families of periodically-perturbed differential equations defining a flow on a three-dimensional manifold.…

In this paper we investigate some properties of forcing which can be considered "nice" in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular…

We introduce a new measure to capture fairness of a schedule in a single round robin (SRR) tournament when participants are ranked by strength. To prevent distortion of the outcome of an SRR tournament as well as to guarantee equal…

If $T$ is an $n$-vertex tournament with a given number of $3$-cycles, what can be said about the number of its $4$-cycles? The most interesting range of this problem is where $T$ is assumed to have $c\cdot n^3$ cyclic triples for some $c>0$…

For a set H of tournaments, we say H is heroic if every tournament, not containing any member of H as a subtournament, has bounded chromatic number. Berger et al. explicitly characterized all heroic sets containing one tournament. Motivated…

In an earlier paper the first two authors have shown that self-complementary graphs can always be oriented in such a way that the union of the oriented version and its isomorphically oriented complement gives a transitive tournament. We…