English
Related papers

Related papers: Solution of a Problem of Barendregt on Sensible la…

200 papers

In 1964, Paul Erd\H{o}s published a paper settling a question about function spaces that he had seen in a problem book. Erd\H{o}s proved that the answer was yes if and only if the continuum hypothesis was false: an innocent-looking question…

Logic in Computer Science · Computer Science 2022-10-14 Lawrence C Paulson

For any truncated path algebra $\Lambda$ of a quiver, we classify, by way of representation-theoretic invariants, the irreducible components of the parametrizing varieties $\mathbf{Rep}_{\mathbf{d}}(\Lambda)$ of the $\Lambda$-modules with…

Representation Theory · Mathematics 2019-12-20 K. R. Goodearl , B. Huisgen-Zimmermann

We consider a certain class of infinitary rules of inference, called here restriction rules, using of which allows us to deduce complete theories of given models. The first instance of such rules was the $\omega$-rule introduced by Hilbert,…

Logic · Mathematics 2023-12-29 Denis I. Saveliev

Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…

Combinatorics · Mathematics 2022-09-13 John Goldwasser , Ryan Hansen

Suppose $G$ is a real reductive group. The determination of the irreducible unitary representations of $G$ is one of the major unsolved problem in representation theory. There is evidence to suggest that every irreducible unitary…

Representation Theory · Mathematics 2019-10-08 Lucas Mason-Brown

We study the problem of extending a complex structure to a given Lie algebra g, which is firstly defined on an ideal h of g. We consider the next situations: h is either complex or it is totally real. The next question is to equip g with an…

Differential Geometry · Mathematics 2014-06-17 Rutwig Campoamor Stursberg , Isolda E. Cardoso , Gabriela P. Ovando

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…

Discrete Mathematics · Computer Science 2025-09-17 Ben Young

Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…

Logic in Computer Science · Computer Science 2023-08-02 Artur Jeż , Anthony W. Lin , Oliver Markgraf , Philipp Rümmer

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the…

Group Theory · Mathematics 2008-08-12 Michael Bate , Benjamin Martin , Gerhard Roehrle , Rudolf Tange

For a fixed finite solvable group $G$ and number field $K$, we prove an upper bound for the number of $G$-extensions $L/K$ with restricted local behavior (at infinitely many places) and ${\rm inv}(L/K)<X$ for a general invariant $"{\rm…

Number Theory · Mathematics 2019-12-13 Brandon Alberts

We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.

Logic · Mathematics 2024-01-04 Alexander Usvyatsov

The union-closed sets conjecture, attributed to P\'eter Frankl from 1979, states that for any non-empty finite union-closed family of finite sets not consisting of only the empty set, there is an element that is in at least half of the sets…

Combinatorics · Mathematics 2023-06-08 Masoud Zargar

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Group Theory · Mathematics 2018-05-16 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

In this note, I propose the following conjecture: a finite group G is nilpotent if and only if its largest quotient B-group \beta(G) is nilpotent. I give a proof of this conjecture under the additional assumption that G be solvable. I also…

Group Theory · Mathematics 2012-02-29 Serge Bouc

We present a conditionally exactly solvable singular potential for the one-dimensional Schr\"odinger equation which involves the exactly solvable inverse square root potential. Each of the two fundamental solutions that compose the general…

Quantum Physics · Physics 2016-10-21 A. M. Ishkhanyan

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

Combinatorics · Mathematics 2023-04-05 Nicolas Nagel

Given a positive integer $h$ and a nonempty finite set of integers $A=\{a_{1},a_{2},\ldots,a_{k}\}$, the restricted $h$-fold signed sumset of $A$, denoted by $h^{\wedge}_{\pm}A$, is defined as $$h^{\wedge}_{\pm}A=\left\lbrace \sum_{i=1}^{k}…

Number Theory · Mathematics 2024-03-07 Mohan , Raj Kumar Mistri , Ram Krishna Pandey

In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…

Artificial Intelligence · Computer Science 2012-07-26 Georg Gottlob

We present some results about the irreducible representations appearing in the exterior algebra $\Lambda \mathfrak{g}$, where $ \mathfrak{g}$ is a simple Lie algebra over $\mathbb{C}$. For Lie algebras of type $B$, $C$ or $D$ we prove that…

Representation Theory · Mathematics 2023-09-12 Sabino Di Trani