相关论文: Determinant Formulae for some Tiling Problems and …
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
Effective matrix methods for solving standard linear algebra problems in a commutative domains are discussed. Two of them are new. There are a methods for computing adjoined matrices and solving system of linear equations in a commutative…
We derive an exact representation of the massless Schwinger model on the lattice in terms of dual variables which are configurations of loops, dimers and plaquette occupation numbers. When expressed with the dual variables the partition sum…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
The complete reason behind a decision is a Boolean formula that characterizes why the decision was made. This recently introduced notion has a number of applications, which include generating explanations, detecting decision bias and…
Let $\{a_k\}$ be a sequence of real numbers defined by an $m$th order linear homogenous recurrence relation. In this paper we obtain a determinant formula for the circulant matrix $A=circ(a_1, a_2, \cdots, a_n)$, providing a generalization…
We give an expression for the determinant of the twisted Laplacian associated with any linear representation of a finite quiver in terms of traces of the holonomy of its cycles. To establish this expression, we prove a general identity for…
We evaluate four families of determinants of matrices, where the entries are sums or differences of generating functions for paths consisting of up-steps, down-steps and level steps. By specialisation, these determinant evaluations have…
The complexity of several logics, such as Presburger arithmetic, dependence logics and ambient logics, can only be characterised in terms of alternating Turing machines. Despite quite natural, the presence of alternation can sometimes cause…
This paper is intended to give closed formulae for binomial determinants with consecutive or almost consecutive rows or columns, as well as calculating the generator of left nullspaces defined by some binomial matrices. In the meantime, we…
We study the construction of substitution tilings of the plane based on certain simplicial configurations of tangents of the deltoid with evenly distributed orientations. The random tiling ensembles are obtained as a result of tile…
A discrete Fourier analysis associated with translation lattices is developed recently by the authors. It permits two lattices, one determining the integral domain and the other determining the family of exponential functions. Possible…
Using exhaustion method and finite differences a new method to solve system of partial differential equations and is presented. This method allows design algorithm to solve linear and nonlinear systems in irregular domains. Applying this…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
We study multi-variable integrals, that we name Sklyanin-Whittaker integrals, and prove their determinantal formulas. We also discuss a $q$-deformation, a determinantal point process, and associated Mellin--Barnes integrals.
We give an exact formula for the number of distinct square patterns of a given size that occur in the Squiral tiling.
The number of domino tilings of a region with reflective symmetry across a line is combinatorially shown to depend on the number of domino tilings of particular subregions, modulo 4. This expands upon previous congruency results for domino…
This paper presents an algorithm for computing the contraction of two-dimensional tensor networks on a square lattice; and we combine it with solving congruence equations to compute the exact enumeration (including weighted enumeration) of…
Positive and negative quadratic forms are well known and widely used. They are multivariate homogeneous polynomials of degree two taking positive or negative values respectively for any values of their arguments not all zero. In the present…