Related papers: Linear aggregation beyond isodesmic symmetry
A class of generalized Ising models is examined with a view to extracting a low energy sector comprising Dirac fermions coupled to Yang-Mills vectors. The main feature of this approach is a set of gap equations, covariant with respect to…
We discuss a geometrical interpretation of the Z-invariant Ising model in terms of isoradial embeddings of planar lattices. The Z-invariant Ising model can be defined on an arbitrary planar lattice if and only if certain paths on the…
The size distribution of geometrical spin clusters is exactly found for the one dimensional Ising model of finite extent. For the values of lattice constant $\beta$ above some "critical value" $\beta_c$ the found size distribution…
Lie symmetry algebra of the dispersionless Davey-Stewartson (dDS) system is shown to be infinite-dimensional. The structure of the algebra turns out to be Kac-Moody-Virasoro one, which is typical for integrable evolution equations in…
A graph $G$ is said to be chordal if it has no induced cycles of length four or more. In a recent preprint Culbertson, Guralnik, and Stiller give a new characterization of chordal graphs in terms of sequences of what they call…
A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
We describe the sets of accumulation of secants for orbits of real analytic vector fields in dimension three having the origin as only {\omega}-limit point. It is a kind of infinitesimal Poincar\'e-Bendixson problem in dimension three.…
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between planar and non-planar interaction graphs, and thus fails to…
We present a generic construction of finite realisations of amalgamation patterns. An amalgamation pattern is specified by a finite collection of finite template structures together with a collection of partial isomorphisms between them. A…
Our main result (Theorem 1) suggests a possible dividing line ($\mu$-superstable $+$ $\mu$-symmetric) for abstract elementary classes without using extra set-theoretic assumptions or tameness. This theorem illuminates the structural side of…
Symmetry-informed machine learning can exhibit advantages over machine learning which fails to account for symmetry. In the context of continuous symmetry detection, current state of the art experiments are largely limited to detecting…
We compute the full isometry group of any left invariant metric on a simply connected, non-unimodular Lie group of dimension three. As an application, we determine the index of symmetry of such metrics and prove that the singularities of…
We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…
We consider the observability model in networks with arbitrary topologies. We introduce a system of coupled nonlinear equations, valid under the locally tree-like ansatz, to describe the size of the largest observable cluster as a function…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from…
We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…
Recently George Bergman proved that the symmetric group of an infinite set possesses the following property which we call by the {\it universality of finite width}: given any generating set $X$ of the symmetric group of an infinite set…
This paper is about conceptual modeling of aggregates in software engineering. An aggregate is a cluster of domain objects that can be treated as a single unit. In UML, an aggregation is a type of association in which objects are configured…
Interpretation of dispersionless integrable hierarchies as equations of coisotropic deformations for certain algebras and other algebraic structures like Jordan triple systInterpretation of dispersionless integrable hierarchies as equations…