Related papers: Why Y-c.c
We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…
A connection between the Yang-Baxter relation for maps and the multi-dimensional consistency property of integrable equations on quad-graphs is investigated. The approach is based on the symmetry analysis of the corresponding equations. It…
We study the necking of a filament of complex fluid or soft solid subject to uniaxial tensile stretching, under conditions of constant imposed stress and force, by means of linear stability analysis and nonlinear simulations. We demonstrate…
This paper extends the definitions of effective resistance and effective conductance to characterize the overall relation (positive coupling or antagonism) between any two disjoint sets of nodes in a signed graph. It generalizes the…
In this note, we find a new way to prove several properties of 2-alternating capacities.
Can we use machine learning to compress graph data? The absence of ordering in graphs poses a significant challenge to conventional compression algorithms, limiting their attainable gains as well as their ability to discover relevant…
We consider the set of partition functions that result from the insertion of twist operators compatible with conformal invariance in a given 2D Conformal Field Theory (CFT). A consistency equation, which gives a classification of twists, is…
A typical result in graph theory says that a graph $G$, satisfying certain conditions, has some property $\cal P$. Once such a theorem is established, it is natural to ask how strongly $G$ satisfies $\cal P$. Can one strengthen the result…
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
Scrutinizing the scattering of ordinary mesons in the limiting case of the number of colour degrees of freedom $N_{\rm c}$ of quantum chromodynamics approaching infinity, we formulate Feynman-diagram selection criteria and from these deduce…
A computational method is developed for the study of mechanical response and fracture behavior of phase field crystals (PFC), to overcome a limitation of the PFC dynamics which lacks an effective mechanism for describing fast mechanical…
We give a short, self-contained, and easily verifiable proof that determining the outerthickness of a general graph is NP-hard. This resolves a long-standing open problem on the computational complexity of outerthickness. Moreover, our…
The paper presents the author view on spin-rooted properties of graphene supported by numerous experimental and calculation evidences. Dirac fermions of crystalline graphene and local spins of graphene molecules are suggested to meet a…
This paper proposes new quadratic constraints (QCs) to bound a quadratic polynomial. Such QCs can be used in dissipation ineqaulities to analyze the stability and performance of nonlinear systems with quadratic vector fields. The proposed…
Cylindrical Algebraic Decomposition (CAD) by projection and lifting requires many iterated univariate resultants. It has been observed that these often factor, but to date this has not been used to optimise implementations of CAD. We…
Motivated by the analysis of nonnegative data objects, a novel Nested Nonnegative Cone Analysis (NNCA) approach is proposed to overcome some drawbacks of existing methods. The application of traditional PCA/SVD method to nonnegative data…
Graphs possess exotic features like variable size and absence of natural ordering of the nodes that make them difficult to analyze and compare. To circumvent this problem and learn on graphs, graph feature representation is required. A good…
A new method to extract the density of partition function zeroes (a continuous function) from their distribution for finite lattices (a discrete data set) is presented. This allows direct determination of the order and strength of phase…
In this paper, we consider the Johnson's graphs. We study the extremal properties of the Johnson's graphs. Namely, we investigate the number of edges in an arbitrary subgraph of this graph. Namely, in this article we prove analogs of…
The partition function of a factor graph can sometimes be accurately estimated by Monte Carlo methods. In this paper, such methods are extended to factor graphs with negative and complex factors.