Related papers: Why Y-c.c
We report on a new method to extract thermodynamic properties from the density of partition function zeroes on finite lattices. This allows direct determination of the order and strength of phase transitions numerically. Furthermore, it…
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…
In this paper we introduce a new $C^r-$perturbation procedure, with respect to the $C^r$-Epstein topology, for $C^r$-foliations by surfaces. Using this perturbation procedure we show how one can use the existence of recurrent leaves of…
We deal with several pcf problems; we characterize another version of exponentiation: number of kappa-branches in a tree with lambda nodes, deal with existence of independent sets in stable theories, possible cardinality of ultraproduct,…
We present some Pfaffian identities, which are completely different from the Pl\"ucker relations. As consequences we obtain a quadratic identity for the number of perfect matchings of plane graphs, which has a simpler form than the formula…
First Order Reversal Curve (FORC) diagrams are a popular tool in geophysics and materials science for the characterization of magnetic particles of natural and synthetic origin. However, there is still a lot of controversy about the…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…
Permeative flows, known for the explanation of the anomalous viscosity (10^5 Poise) in cholesterics at low shear rates, are still under debate due to the difficulty of experiments. Here we use the Surface Force Balance, in which uniform…
We use known finite support iteration techniques to present various examples of models where several cardinal characteristics of Cicho\'n's diagram are pairwise different. We show some simple examples forcing the left-hand side of…
The pseudoinverse of a graph Laplacian is used in many applications and fields, such as for instance in the computation of the effective resistance in electrical networks, in the calculation of the hitting/commuting times for a Markov chain…
The classical theory of attractive central force problem on the standard (flat) Euclidean plane can be generalized to surfaces by reformulating the basic underlying physical principles by means of differential geometry. Attractive central…
We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…
The notion of graph acyclicity has been extended to several different notions of hypergraph acyclicity, in increasing order of generality: gamma acyclicity, beta acyclicity, and alpha acyclicity, that have met a great interest in many…
In this article we propose an extension to the typed natural deduction calculus TNDPQ to model verification of individual fairness and intersectionality in probabilistic classifiers. Their interpretation is obtained by formulating specific…
Based on the Carath\'eodory -Pesin structure theory[11], we introduce three notions of topological pressure of a proper map and provide some properties of these notions. For the proper map of a locally compact separable metric space, we…
Given graphs $X$ and $Y$, we define two conic feasibility programs which we show have a solution over the completely positive cone if and only if there exists a homomorphism from $X$ to $Y$. By varying the cone, we obtain similar…
We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…
We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…
In this work we suggest a new model for generating random satisfiable k-CNF formulas. To generate such formulas -- randomly permute all 2^k\binom{n}{k} possible clauses over the variables x_1, ..., x_n, and starting from the empty formula,…
Throughout this work, the vertex decomposability and shellability of graphs formed from other graphs by various operations are investigated. Also among the other things, by using some graph operations, new classes of Cohen-Macaulay graphs…