Related papers: Resistance Calculation for an infinite Simple Cubi…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
In Part I of this work we defined a generalization of the concept of effective resistance to directed graphs, and we explored some of the properties of this new definition. Here, we use the theory developed in Part I to compute effective…
Let f, U and C represent, respectively, the free energy, the internal energy and the specific heat of the critical Ising model on the square M x N lattice with periodic boundary conditions. We find that N f and U are well-defined odd…
We investigate the effective resistance $R_n$ and conductance $C_n$ between the root and leaves of a binary tree of height $n$. In this electrical network, the resistance of each edge $e$ at distance $d$ from the root is defined by…
In this paper, we study properties of effective impedance of finite electrical networks and calculate the effective impedance of a finite ladder network over an ordered field. Moreover, we consider two particular examples of infinite ladder…
Let $G$ be a connected graph with $n$ vertices. The resistance distance $\Omega_{G}(i,j)$ between any two vertices $i$ and $j$ of $G$ is defined as the effective resistance between them in the electrical network constructed from $G$ by…
We develop a theory describing neutral atoms scattering at low energies in an optical lattice. We show that for a repulsive interaction, as the microscopic scattering length increases, the effective scattering amplitude approaches a…
We present the exact solution to a one-dimensional multicomponent quantum lattice model interacting by an exchange operator which falls off as the inverse-sinh-square of the distance. This interaction contains a variable range as a…
We attach to each $\langle 0, \vee \rangle$-semilattice a graph $\boldsymbol{G}_{\boldsymbol{S}}$ whose vertices are join-irreducible elements of $\boldsymbol{S}$ and whose edges correspond to the reflexive dependency relation. We study…
We solve for the retarded Greens function for linearized gravity in a background with a negative cosmological constant, anti de Sitter space. In this background, it is possible for a signal to reach spatial infinity in a finite time.…
We model and derive the solution for the problem of a Mode I semi-infinite crack propagating in a discrete triangular lattice with bonds having a contrast in stiffness in the principal lattice directions. The corresponding Green's kernel is…
An algorithm for the calculation of the resistance between two arbitrary nodes in an arbitrary distance-regular resistor network is provided, where the calculation is based on stratification introduced in \cite{js} and Stieltjes transform…
Any graph can be considered as a network of resistors, each of which has a resistance of $1 \Omega.$ The resistance distance $r_{ij}$ between a pair of vertices $i$ and $j$ in a graph is defined as the effective resistance between $i$ and…
Let $\vec{G}=(V,E^+\cup E^-)$ be a bidirected graph whose underlying undirected graph $G=(V,E)$ is $2$-edge-connected. A strongly connected orientation (SCO) is defined as a subset of arcs that contains exactly one of $e^+,e^-$ for every…
We study the linear response to an external electric field of a system of fermions in a lattice at zero temperature. This allows to measure numerically the Euclidean conductivity which turns out to be compatible with an analytical…
We write the Green function of the $d$-dimensional hypercubic lattice in a piecewise form covering the entire real frequency axis. Each piece is a single integral involving modified Bessel functions of the first and second kinds. The…
An inverse problem of finding an obstacle and the boundary condition on its surface from the fixed-energy scattering data is studied. A new method is developed for a proof of the uniqueness results. The method does not use the discreteness…
SU(2) lattice gauge theory is investigated where the traces of the Wilson lines at any lattice point and along each direction is constrained to zero. Hence, each of the lattice configurations possesses a vanishing density of heavy (anti-)…
A graph $G$ is $(a,b)$-choosable if for any color list of size $a$ associated with each vertex, one can choose a subset of $b$ colors such that adjacent vertices are colored with disjoint color sets. This paper proves that for any integer…
The dc conductance through a finite Hubbard chain of size N coupled to two noninteracting leads is studied at T = 0 in an electron-hole symmetric case. Assuming that the perturbation expansion in U is valid for small N (=1,2,3,...) owing to…