相关论文: The Conway-Sloane calculus for 2-adic lattices
Multilevel methods are among the most efficient numerical methods for solving large-scale linear systems that arise from discretized partial differential equations. The fundamental module of such methods is a two-level procedure, which…
We present further results on a class of sums which involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle, supplementing those in a previous paper (McPhedran et al,…
The outline of lattice simulations of $(2+1)D$ soliton-propagations in the background of Weyl spinors is presented. Clifford algebra is applied on Luescher's domain decomposition method. The Clifford algebra shows that there are loop parts…
We introduce an algebraic methodology for designing exactly-solvable Lie model Hamiltonians. The idea consists in looking at the algebra generated by bond operators. We illustrate how this method can be applied to solve numerous problems of…
Given two quadratic lattices $M$ and $N$ over a dyadic local field $F$, i.e. a finite extension of ${\mathbb Q}$, we give necessary and sufficient conditions such that $M$ represents $N$. Previous results on this problem were obtained by…
In this paper we give simple proofs for the bounds (some of them sharp) of the difference of the moduli of the second and the first logarithmic coefficient for the general class of univalent functions and for the class of convex univalent…
This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…
This article provides a simple proof of the quadratic formula, which also produces an efficient and natural method for solving general quadratic equations. The derivation is computationally light and conceptually natural, and has the…
This article presents a bidirectional type system for the Calculus of Inductive Constructions (CIC). It introduces a new judgement intermediate between the usual inference and checking, dubbed constrained inference, to handle the presence…
A general method based on the polynomial deformations of the Lie algebra sl(2,R) is proposed in order to exhibit the quasi-exactly solvability of specific Hamiltonians implied by quantum physical models. This method using the…
The objective of this work is to examine the integrability of Hamiltonian systems in $2D$ spaces with variable curvature of certain types. Based on the differential Galois theory, we announce the necessary conditions of the integrability.…
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…
In this paper, we establish some new Hadamard type inequalities for s-logarithmically convex functions in the second sense via fractional integrals by using Lemma 1 which has been proved by Sarikaya et al. in the paper [3].
Gottfried Leibniz embarked on a research program to prove all the Aristotelic categorical syllogisms by diagrammatic and algebraic methods. He succeeded in proving them by means of Euler diagrams, but didn't produce a manuscript with their…
The celebrated Smith-Minkowski-Siegel mass formula expresses the mass of a quadratic lattice (L, Q) as a product of local factors, called the local densities of (L,Q). This mass formula is an essential tool for the classification of…
About 35 years ago Dennis Sullivan proved a precompactness property ("complex bounds") for infinitely renormalizable real quadratic polynomials with bounded combinatorics. We present a simple "soft" proof of this remarkable result.
In the seminal book M\'echanique analitique, Lagrange, 1788, the notion of a Lagrange multiplier was first introduced in order to study a smooth minimization problem subject to equality constraints. The idea is that, under some regularity…
One of the oldest methods for computing invariants of ordinary differential equations is tested using the full Toda lattice model. We show that the standard method of undetermined coefficients and modern symbolic algebra tools together with…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We have developed the techniques necessary for a numerical simulation of d=3 SU(2) Lattice Gauge theories in the dual formulation as originally developed by Anishetty et al . These include updating techniques that preserve the constrained…