English
Related papers

Related papers: Doubly partially conservative sentences

200 papers

This is the fourth paper in a series. We prove a conjecture made independently by Boston et al and Shalev. The conjecture asserts that there is an absolute positive constant delta such that if G is a finite simple group acting transitively…

Group Theory · Mathematics 2015-08-04 Jason Fulman , Robert Guralnick

We proceed with the investigation of the problem $(P_\lambda): $ $-\Delta u = \lambda b(x)|u|^{q-2}u +a(x)|u|^{p-2}u \ \mbox{ in } \Omega, \ \ \frac{\partial u}{\partial \mathbf{n}} = 0 \ \mbox{ on } \partial \Omega$, where $\Omega$ is a…

Analysis of PDEs · Mathematics 2024-01-22 Humberto Ramos Quoirin , Kenichiro Umezu

String theory appears to admit a group of discrete field transformations -- called $S$ dualities -- as exact non-perturbative quantum symmetries. Mathematically, they are rather analogous to the better-known $T$ duality symmetries, which…

High Energy Physics - Theory · Physics 2011-04-15 John H. Schwarz

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

Combinatorics · Mathematics 2021-02-25 Julien Cassaigne , Sébastien Labbé , Julien Leroy

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

Counterfactual Data Augmentation (CDA) is a commonly used technique for improving robustness in natural language classifiers. However, one fundamental challenge is how to discover meaningful counterfactuals and efficiently label them, with…

Computation and Language · Computer Science 2023-05-24 Ananth Balashankar , Xuezhi Wang , Yao Qin , Ben Packer , Nithum Thain , Jilin Chen , Ed H. Chi , Alex Beutel

Dynamics of the delay rational difference equation $\displaystyle{z_{n+1}=\frac{\alpha+\beta z_{n-k}}{\gamma - z_{n}}}$ with complex parameters $\alpha$, $\beta$, $\gamma$ and arbitrary complex initial conditions is investigated. Existence…

Dynamical Systems · Mathematics 2016-06-30 Sk. Sarif Hassan

We propose and prove a trinomial version of the celebrated Bailey's lemma. As an application we obtain new fermionic representations for characters of some unitary as well as nonunitary models of N = 2 superconformal field theory (SCFT). We…

q-alg · Mathematics 2009-10-30 G. E. Andrews , A. Berkovich

The classical homomorphism preservation theorem, due to {\L}o\'s, Lyndon and Tarski, states that a first-order sentence $\phi$ is preserved under homomorphisms between structures if, and only if, it is equivalent to an existential positive…

Logic · Mathematics 2024-01-31 Samson Abramsky , Luca Reggio

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2017-07-28 Jean Néraud , Carla Selmi

Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…

Logic · Mathematics 2026-05-07 Saharon Shelah

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

Logic in Computer Science · Computer Science 2021-09-27 Simon Halfon , Philippe Schnoebelen , Georg Zetzsche

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

Logic · Mathematics 2026-05-14 Mohammad Golshani , Grigorii Stepanov , Reihane Zoghifard

We classify $n\times n$-matrix-valued continuous commutativity and spectrum preservers defined on spaces of (a) normal, (b) semisimple and (c) arbitrary $n\times n$ matrices with spectra contained in sufficiently connected subsets…

Spectral Theory · Mathematics 2026-04-09 Alexandru Chirvasitu

In this paper, we introduce a family of topological spaces that captures the existence of preservation theorems. The structure of those spaces allows us to study the relativisation of preservation theorems under suitable definitions of…

Logic in Computer Science · Computer Science 2024-04-17 Aliaume Lopez

In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…

Computational Complexity · Computer Science 2015-02-16 Albert Atserias

In this paper, we study the linear structure of sets $A \subset \mathbb{F}_2^n$ with doubling constant $\sigma(A)<2$, where $\sigma(A):=\frac{|A+A|}{|A|}$. In particular, we show that $A$ is contained in a small affine subspace. We also…

Combinatorics · Mathematics 2009-11-13 Hansheng Diao

Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…

Logic in Computer Science · Computer Science 2021-12-30 Giulio Fellin , Peter Schuster

We characterize conservative median algebras and semilattices by means of forbidden substructures and by providing their representation as chains. Moreover, using a dual equivalence between median algebras and certain topological…

Rings and Algebras · Mathematics 2016-02-15 Miguel Couceiro , Jean-Luc Marichal , Bruno Teheux
‹ Prev 1 4 5 6 7 8 10 Next ›