English
Related papers

Related papers: Towards a statement of the S-adic conjecture throu…

200 papers

We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…

Group Theory · Mathematics 2017-01-19 Lev Glebsky

Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…

Logic · Mathematics 2025-04-29 Pablo Andújar Guerrero

Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…

Logic · Mathematics 2019-02-20 Vera Koponen

In the context of protomodular categories, several additional conditions have been considered in order to obtain a closer group-like behavior. Among them are locally algebraic cartesian closedness and algebraic coherence. The recent notion…

Category Theory · Mathematics 2023-06-22 Nelson Martins-Ferreira , Andrea Montoli , Manuela Sobral

For a given hyperelliptic curve $C$ over a finite field with Jacobian $J_C$, we consider the hyperelliptic analogue of the congruential generator defined by $W_n=W_{n-1}+D$ for $n\geq 1$ and $D,W_0\in J_C$. We show that curves of genus 2…

Number Theory · Mathematics 2021-02-05 Vishnupriya Anupindi , László Mérai

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…

Information Theory · Computer Science 2019-05-01 Minghui Yang , Lulu Zhang , Keqin Feng

This paper introduces a generalization of the ddc-condition for complex manifolds. Like the dd^c-condition, it admits a diverse collection of characterizations, and is hereditary under various geometric constructions. Most notably, it is an…

Differential Geometry · Mathematics 2022-10-25 Jonas Stelzig , Scott O. Wilson

The Mordell-Lang conjecture describes the intersection of a finitely generated subgroup with a closed subvariety of a semiabelian variety. Equivalently, this conjecture describes the intersection of closed subvarieties with the set of…

Number Theory · Mathematics 2013-10-09 Dragos Ghioca , Thomas J. Tucker , Michael E. Zieve

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Group Theory · Mathematics 2021-09-14 Grechkoseeva Mariya

We conjecture that the word problem of Artin-Tits groups can be solved without introducing trivial factors ss^{-1} or s^{-1}s. Here we make this statement precise and explain how it can be seen as a weak form of hyperbolicity. We prove the…

Group Theory · Mathematics 2011-10-18 Patrick Dehornoy , Eddy Godelle

We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…

Algebraic Topology · Mathematics 2026-05-07 Daisuke Kishimoto , Yuki Minowa

It is shown that under certain stability conditions a complemented subspace of the space $s$ of rapidly decreasing sequences is isomorphic to $s$ and this condition characterizes $s$. This result is used to show that for the classical…

Functional Analysis · Mathematics 2013-06-14 Dietmar Vogt

We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…

Logic in Computer Science · Computer Science 2007-05-23 Barnaby Martin

We study linearly dependent subsets with prescribed cardinality, $s$, of a multiprojective space. If the set $S$ is a circuit, we give an upper bound on the number of factors of the minimal multiprojective space containing $S$, while if $S$…

Algebraic Geometry · Mathematics 2020-02-25 Edoardo Ballico

Explaining decisions of black-box classifiers is both important and computationally challenging. In this paper, we scrutinize explainers that generate feature-based explanations from samples or datasets. We start by presenting a set of…

Artificial Intelligence · Computer Science 2024-08-13 Leila Amgoud , Martin C. Cooper , Salim Debbaoui

We call a set $\mathcal S$ of graphs an "even subdivison-factor" of a cubic graph $G$ if $G$ contains a spanning subgraph $H$ such that every component of $H$ has an even number of vertices and is a subdivision of an element of $\mathcal…

Combinatorics · Mathematics 2012-11-12 Arthur Hoffmann-Ostenhof

The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the…

Logic · Mathematics 2012-04-03 Laurent Bienvenu , Andrej Muchnik , Alexander Shen , Nikolai Vereshchagin

Let G be a semiabelian variety defined over a finite subfield of an algebraically closed field K of prime characteristic. We describe the intersection of a subvariety X of G with a finitely generated subgroup of G(K).

Number Theory · Mathematics 2025-04-30 Dragos Ghioca

A sequence is difference algebraic (or D-algebraic) if finitely many shifts of its general term satisfy a polynomial relationship; that is, they are the coordinates of a generic point on an affine hypersurface. The corresponding equations…

Algebraic Geometry · Mathematics 2025-10-13 Bertrand Teguia Tabuguia

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

Combinatorics · Mathematics 2007-05-23 Robert Brignall , Nik Ruskuc , Vince Vatter
‹ Prev 1 4 5 6 7 8 10 Next ›