English
Related papers

Related papers: On Separating Wholeness Axioms

200 papers

Some time ago, conformal data with affine fusion rules were found. Our purpose here is to realize some of these conformal data, using systems of free bosons and parafermions. The so constructed theories have an extended $W$ algebras which…

High Energy Physics - Theory · Physics 2009-10-31 Doron Gepner

This paper investigates the impossibility of certain $({n^2+n+k}_{n+1})$ configurations. Firstly, for $k=2$, the result of \cite{gropp1992non} that $\frac{n^2+n}{2}$ is even and $n+1$ is a perfect square or $\frac{n^2+n}{2}$ is odd and…

Combinatorics · Mathematics 2026-03-18 Jackson Philbrook , Benjamin Peet

We show that Ambro-Kawamata's non-vanishing conjecture holds true for a quasi-smooth WCI X which is Fano or Calabi-Yau, i.e. we prove that, if H is an ample Cartier divisor on X, then |H| is not empty. If X is smooth, we further show that…

Algebraic Geometry · Mathematics 2018-03-16 Marco Pizzato , Taro Sano , Luca Tasin

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…

Computational Complexity · Computer Science 2014-09-10 Albert Atserias , Massimo Lauria , Jakob Nordström

For all nonnegative integers n, the Franel numbers are defined as $$ f_n=\sum_{k=0}^n {n\choose k}^3.$$ We confirm two conjectures of Z.-W. Sun on congruences for Franel numbers: \sum_{k=0}^{n-1}(3k+2)(-1)^k f_k &\equiv 0 \pmod{2n^2},…

Number Theory · Mathematics 2012-07-24 Victor J. W. Guo

We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…

Logic · Mathematics 2022-03-11 Ali Enayat

Let $w_{n+2}=pw_{n+1}+qw_{n}$ for $n\geq0$ with $w_0=a$ and $w_1=b$. In this paper we find an explicit expression, in terms of determinants, for $\sum_{n\geq0} w_n^kx^n$ for any $k\geq1$. As a consequence, we derive all the previously known…

Combinatorics · Mathematics 2007-05-23 Toufik Mansour

Let $L_{>\lambda}(\mathcal{A})$ and $L_{\geq\lambda}(\mathcal{A})$ be the languages recognized by {\em measure many 1-way quantum finite automata (MM-QFA)} (or,{\em enhanced 1-way quantum finite automata(EQFA)}) $\mathcal{A}$ with strict…

Formal Languages and Automata Theory · Computer Science 2023-06-06 Tianrong Lin

We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…

Logic · Mathematics 2021-12-03 Ur Ya'ar

Let $\mathcal S$ denote the class of all functions of the form $f(z)=z+a_2z^2+a_3z^3+\cdots$ which are analytic and univalent in the open unit disk $\ID$ and, for $\lambda >0$, let $\Phi_\lambda (n,f)=\lambda a_n^2-a_{2n-1}$ denote the…

Complex Variables · Mathematics 2016-03-24 Liulan Li , Saminathan Ponnusamy , Jinjing Qiao

We build, for real quadratic fields, infinitely many periodic continuous fractions uniformly bounded, with a seemingly better bound than the known ones. We do that using continuous fraction expansions with the same shape as those of real…

Number Theory · Mathematics 2016-02-01 Paul Mercat

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

Logic · Mathematics 2020-03-12 Lars Kristiansen , Juvenal Murwanashyaka

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. We study the difference between the number of summands in the partition of two consecutive integers. In particular, let…

Number Theory · Mathematics 2020-10-30 Hung Viet Chu

Recently, a new fractional derivative called the conformable fractional derivative is given on based basic limit definition derivative in [4]. Then, the fractional versions of chain rules, exponential functions, Gronwalls inequality,…

Classical Analysis and ODEs · Mathematics 2015-04-09 Ahmet Gökdoğan , Emrah Ünal , Ercan Çelik

Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A…

Computational Complexity · Computer Science 2007-09-27 Ines Klimann , Sylvain Lombardy , Jean Mairesse , Christophe Prieur

Let f be a cuspidal newform with complex multiplication (CM) and let p be an odd prime at which f is non-ordinary. We construct admissible p-adic L-functions for the symmetric powers of f, thus verifying general conjectures of Dabrowski and…

Number Theory · Mathematics 2015-10-23 Robert Harron , Antonio Lei

Almost forty years ago, C.T.C. Wall systematically analyzed the set of "thickenings" of a finite CW complex. Of the results he obtained, probably the most computationally important is the "suspension theorem," which is an exact sequence…

Algebraic Topology · Mathematics 2007-05-23 Mokhtar Aouina , John R. Klein

There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…

Logic · Mathematics 2007-05-23 W. Hugh Woodin

We prove in ZFC that for mu >= aleph_2 there is a sigma --ideal I on mu and a Boolean sigma --subalgebra B of the family of subsets of mu which includes I such that the natural homomorphism from B onto B/I cannot be lifted.

Logic · Mathematics 2016-09-07 Saharon Shelah

Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the…

Formal Languages and Automata Theory · Computer Science 2017-01-18 Laure Daviaud , Ismael Jecker , Pierre-Alain Reynier , Didier Villevalois
‹ Prev 1 8 9 10 Next ›