We use conference matrices to define an action of the complex numbers on the real Euclidean vector space R. In certain cases, the lattice D n becomes a module over a ring of quadratic integers. We can then obtain new unimodular lattices, essentially by multiplying the lattice D n by a non-principal ideal in this ring. We show that lattices constructed via quadratic residue codes, including the ...

The asymptotic lattices and their transformations are studied within the line geometry approach. It is shown that the discrete asymptotic nets are represented by isotropic congruences in the Plücker quadric. On the basis of the Lelieuvre-type representation of asymptotic lattices and of the discrete analog of the Moutard transformation, it is constructed the discrete analog of the W–congruences...

The paper is devoted to the study of the weight distribution of irreducible cyclic codes. We start from the interpretation due to McEliece of these weights by means of Gauss sums. Firstly, a p-adic analysis using Stickelberger congruences and Gross-Koblitz formula enable us to improve the divisibility theorem of McEliece by giving results on the multiplicity of the weights. Secondly, in connect...

In this paper we show that several classes of languages from computational complexity theory, such as EXPTIME, can be characterized in a continuous manner by using only polynomial differential equations. This characterization applies not to languages, but also functions, the defining Grzegorczyk hierarchy, which implies an analog class elementary computable functions and primitive recursive fun...

In current study, the effects of Iranian rice cooking method (Kateh) on residue levels of 41 pesticides were investigated. The pesticides were selected according to Iranian National Standards Organization (INSO) regulations and covered 18 permitted and 23 banned pesticides belonging to different chemical classes such as organophosphate, triazole, and carbamate. A 250 g portion of rice sample wa...

We describe some results inspired to Lafont’s Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and complete for polynomial time computations. SLL is the basis for the design of type assignment systems for lambda-calculus, characterizing the complexity classes PTIME, PSPACE and NPTIME. PTIME is characterized by a type assig...

We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of ...