English
Related papers

Related papers: members of thin $\Pi_1^0$ classes and generic degr…

200 papers

We study $\mathbb{Z}_2$-graded identities of simple Lie superalgebras over a field of characteristic zero. We prove the existence of the graded PI-exponent for such algebras.

Rings and Algebras · Mathematics 2019-09-25 Dušan D. Repovš , Mikhail V. Zaicev

We answer an open question in the theory of transducer degrees initially posed in [3], on the structure of polynomial transducer degrees, in particular the question of what degrees, if any, lie below the degree of $n^3$. Transducer degrees…

Formal Languages and Automata Theory · Computer Science 2021-11-15 Noah Kaufmann

An important result of Koml\'os [Tiling Tur\'an theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for…

Combinatorics · Mathematics 2019-09-13 Joseph Hyde , Hong Liu , Andrew Treglown

If $G$ be a finite $p$-group and $\chi$ is a non-linear irreducible character of $G$, then $\chi(1)\leq |G/Z(G)|^{\frac{1}{2}}$. In \cite{fernandez2001groups}, Fern\'{a}ndez-Alcober and Moret\'{o} obtained the relation between the character…

Group Theory · Mathematics 2024-03-25 Nabajit Talukdar , Kukil Kalpa Rajkhowa

We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…

Logic · Mathematics 2024-01-24 Arno Pauly , Giovanni Soldà

We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…

Logic · Mathematics 2022-06-24 Uri Andrews , Daniel Belin , Luca San Mauro

A class of graphs is structurally nowhere dense if it can be constructed from a nowhere dense class by a first-order transduction. Structurally nowhere dense classes vastly generalize nowhere dense classes and constitute important examples…

Logic in Computer Science · Computer Science 2023-02-08 Jan Dreier , Nikolas Mählmann , Sebastian Siebertz

We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…

Combinatorics · Mathematics 2007-05-23 Jaroslav Nesetril , Patrice Ossona De Mendez

We show that a minimal counter example to the Cherlin-Zilber Algebraicity Conjecture for simple groups of finite Morley rank has normal 2-rank at most two, which is a tameness free version of Borovik's original trichotomy theorem. This…

Group Theory · Mathematics 2007-11-28 Alexandre Borovik , Jeffrey Burdges

In this paper we consider genus one equations of degree n, namely a (generalised) binary quartic when n = 2, a ternary cubic when n = 3, and a pair of quaternary quadrics when n = 4. A new definition for the minimality of genus one…

Number Theory · Mathematics 2012-04-03 Mohammad Sadek

Classes SSGP(n)(n < \omega) of topological groups are defined, and the class-theoretic inclusions SSGP(n) \subseteq SSGP(n+1) \subseteq m.a.p. are established and shown proper. These classes are investigated with respect to the properties…

General Topology · Mathematics 2014-10-14 W. W. Comfort , Franklin R. Gould

We prove several negative results about first-order transducibility for classes of sparse graphs: - for every $t \in \mathbb{N}$, the class of graphs of treewidth at most $t+1$ is not transducible from the class of graphs of treewidth at…

Logic in Computer Science · Computer Science 2025-05-22 Jakub Gajarský , Jeremi Gładkowski , Jan Jedelský , Michał Pilipczuk , Szymon Toruńczyk

We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…

Logic · Mathematics 2026-03-31 Patrizio Cintioli

For a generic degree d smooth map f: N^n -> M^n we introduce its "transverse fundamental group" \pi(f), which reduces to \pi_1(M) in the case where f is a covering, and in general admits a monodromy homomorphism \pi(f) -> S_{|d|};…

Geometric Topology · Mathematics 2016-02-02 Sergey A. Melikhov

Given a cover $\mathbb{U}$ of a family of smooth complex algebraic varieties, we associate with it a class $\mathcal{U},$ containing $\mathbb{U}$, of structures locally definable in an o-minimal expansion of the reals. We prove that the…

Logic · Mathematics 2024-05-01 Boris Zilber

We discuss a category of graphs, recursive clique trees, which have small-world and scale-free properties and allow a fine tuning of the clustering and the power-law exponent of their discrete degree distribution. We determine relevant…

Statistical Mechanics · Physics 2007-05-23 Francesc Comellas , Guillaume Fertin , André Raspaud

We prove a generic flatness result for the cohomology of thickenings of a projective scheme that is smooth over a Noetherian domain containing a field of characteristic zero. Our study is motivated, in part, by a classical question in…

Algebraic Geometry · Mathematics 2026-03-06 Edoardo Ballico , Yairon Cid-Ruiz , Anurag K. Singh

We study degree-theoretic properties of reals that are not random with respect to any continuous probability measure (NCR). To this end, we introduce a family of generalized Hausdorff measures based on the iterates of the "dissipation"…

Logic · Mathematics 2023-06-09 Mingyang Li , Jan Reimann

We construct an increasing $\omega$-sequence $(a_n)$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each~$a_{n+1}$ is diagonally noncomputable relative to $a_n$. It follows that the~$\mathsf{DNR}$…

Logic · Mathematics 2015-04-14 Mingzhong Cai , Noam Greenberg , Michael McInerney

If $P(z)=\sum_{j=0}^{n}a_jz^j$ is a polynomial of degree $n$ having no zero in $|z|<1,$ then it was recently proved that for every $p\in[0,+\infty]$ and $s=0,1,\ldots,n-1,$ \begin{align*} \left\|a_nz+\frac{a_s}{\binom{n}{s}}\right\|_{p}\leq…

Complex Variables · Mathematics 2024-12-02 Suhail Gulzar , N. A. Rather , M. S Wani
‹ Prev 1 3 4 5 6 7 10 Next ›