Related papers: Why Y-c.c

This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…

It was realized early on that topologies can model constructive systems, as the open sets form a Heyting algebra. After the development of forcing, in the form of Boolean-valued models, it became clear that, just as over ZF any…

We introduce a simple but powerful technique to study processes driven by two or more reinforcement mechanisms in competition. We apply our method to two types of models: to non conservative zero range processes on finite graphs, and to…

We provide a new proof of Maurer, Renard, and Pietzak's result that the sum of the nCPA advantages of random permutations $P$ and $Q$ bound the CCA advantage of $P^{-1} \circ Q$. Our proof uses probability directly, as opposed to…

We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…

We construct one Yang-Mills measure on a compact surface for each isomorphism class of principal bundles over this surface. For this, we define a new discrete gauge theory which is essentially a covering of the usual one. We prove that the…

A graph class $\mathcal C$ is monadically dependent if one cannot interpret all graphs in colored graphs from $\mathcal C$ using a fixed first-order interpretation. We prove that monadically dependent classes can be exactly characterized by…

The method of Feynman-Kac perturbation of quantum stochastic processes has a long pedigree, with the theory usually developed within the framework of processes on von Neumann algebras. In this work, the theory of operator spaces is…

In this paper, we define the Mycielskian of a signed graph and discuss the properties of balance and switching in the Mycielskian of a given signed graph. We provide a condition for ensuring the Mycielskian of a balanced signed graph…

We study the discrete version of the $p$-Laplacian. Based on its variational properties we discuss some features of the associated parabolic problem. Our approach allows us in turn to obtain interesting information about positivity and…

Some systematic general features of y-scaling structure functions, which are essentially independent of detailed dynamics, are pointed out. Their physical interpretation in terms of general characteristics, such as a mean field description…

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…

We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…

We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.

Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…

We study a class of 2-dimensional Hamiltonian systems $H(x,y,p_x,p_y)=\frac12(p_x^2+p_y^2) +V(x,y)$ in which the plane $x$=$p_x$=0 is invariant under the Hamiltonian flow, so that straight-line librations along the y axis exist, and we also…

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…

We prove the consistency of a strong polarized relation for a cardinal and its successor, using pcf and forcing

We study the effect of external forcing on the saddle-node bifurcation pattern of interval maps. By replacing fixed points of unperturbed maps by invariant graphs, we obtain direct analogues to the classical result both for random forcing…

There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are…