English
Related papers

Related papers: A short proof that adding some permutation rules t…

200 papers

Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such as of the lambda-binder of the lambda-calculus…

Logic in Computer Science · Computer Science 2023-12-29 Gilles Dowek , Murdoch J. Gabbay

We consider the voter model dynamics in random networks with an arbitrary distribution of the degree of the nodes. We find that for the usual node-update dynamics the average magnetization is not conserved, while an average magnetization…

Other Condensed Matter · Physics 2007-05-23 Krzysztof Suchecki , Victor M. Eguiluz , Maxi San Miguel

It is shown that a natural notion of congruence permutability for quasivarieties already implies ``being a variety''. The result follows immediately from [3] and the sole aim of this note is to state it explicitly, together with a…

Logic · Mathematics 2025-12-11 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

Unfortunately the proof of the main result of [1], Theorem 1, has a flaw. Namely, Lemma 13 used in the proof of Proposition 11 is correct only under an additional assumption that the operator $A$ is normal (adjoint for the one-sided shift…

Spectral Theory · Mathematics 2020-12-29 Artem Dudko , Rostislav Grigorchuk

We will remark an extension of a linear functional on subalgebra of algebra of continuous functions on subset of $\mathbb{R}^n$ which preserves positivity.

Functional Analysis · Mathematics 2016-08-25 Hoàng Phi Dũng

Temporal expressions in text play a significant role in language understanding and correctly identifying them is fundamental to various retrieval and natural language processing systems. Previous works have slowly shifted from rule-based to…

Computation and Language · Computer Science 2022-01-25 Satya Almasian , Dennis Aumiller , Michael Gertz

We present an explicit deterministic transformation of a fixed number of i.i.d. uniform random variables with exact Beta$(a,1-a)$ law for $0<a<1$, using only elementary operations (an ``extended one-liner'', see \cite{devroye1996oneline}).…

Computation · Statistics 2026-04-14 Dylan Greaves

We derive norm bounds that imply the convergence of perturbation theory in fermionic quantum field theory if the propagator is summable and has a finite Gram constant. These bounds are sufficient for an application in renormalization group…

Mathematical Physics · Physics 2015-06-26 Manfred Salmhofer , Christian Wieczerkowski

The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated by the…

Logic in Computer Science · Computer Science 2016-08-16 Frédéric Blanqui

We prove that continuous spectrum- and commutativity-preserving maps to $\mathcal{M}_n(\mathbb{C})$ from the space of normal (real or complex) $n\times n$, $n\ge 3$ matrices with spectra contained in a given continuous-injection interval…

Spectral Theory · Mathematics 2026-04-07 Alexandru Chirvasitu

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

Probability · Mathematics 2018-01-30 Enes Ozel

Refining and extending previous work by Retor\'e, we develop a systematic approach to intersection types via natural deduction. We show how a step of beta reduction can be seen as performing, at the level of typing derivations, Prawitz…

Logic in Computer Science · Computer Science 2019-04-24 Federico Aschieri

In a functional calculus, the so called \Omega-rule states that if two terms P and Q applied to any closed term <i>N</i> return the same value (i.e. PN = QN), then they are equal (i.e. P = Q holds). As it is well known, in the…

Logic in Computer Science · Computer Science 2019-03-14 Benedetto Intrigila , Richard Statman

This paper contains a small improvement to the explicit bounds on the growth of the function $S(T)$. It is shown how more substantial improvements are possible if one has better explicit bounds on the growth of $|\zeta(\frac{1}{2}+it)|$.

Number Theory · Mathematics 2013-10-10 Timothy Trudgian

A bit-string model for the evolution of a population of haploid organisms, subject to competition, reproduction with mutation and selection is studied, using mean field theory and Monte Carlo simulations. We show that, depending on…

Statistical Mechanics · Physics 2009-11-07 Kathia M. Fehsenfeld , Ronald Dickman , Americo T. Bernardes

In this paper we will obtain some further properties for specializations in a scheme. Using these results, we will take a picture for a scheme and a picture for a morphism of schemes. In particular, we will prove that every morphism of…

Algebraic Geometry · Mathematics 2007-06-13 Feng-Wen An

In this small note we use results derived in Berestycki et al. to correct the celebrated formulae of Hagan et al. We derive explicitly the correct zero order term in the expansion of the implied volatility in time to maturity. The new term…

Computational Finance · Quantitative Finance 2008-12-02 Jan Obloj

An exactly solvable model for a description of the two-neutrino double beta decay transition of the Fermi type is considered. By using perturbation theory an explicit dependence of the two-neutrino double beta decay matrix element on the…

Nuclear Theory · Physics 2015-06-16 Dusan Stefanik , Fedor Simkovic , Kazuo Muto , Amand Faessler

Given a one-dimensional shift $X$, let $|F_X(n)|$ be the number of follower sets of words of length $n$ in $X$, and $|P_X(n)|$ be the number of predecessor sets of words of length $n$ in $X$. We call the sequence $\{|F_X(n)|\}_{n \in…

Dynamical Systems · Mathematics 2017-01-06 Thomas French

After a brief review of existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then…

Number Theory · Mathematics 2022-01-19 Xiang-dong Hou , Vincenzo Pallozzi Lavorante