English
Related papers

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

200 papers

If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…

Category Theory · Mathematics 2018-07-03 Hans-E. Porst

We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…

Information Theory · Computer Science 2013-12-06 Harald Niederreiter , Chaoping Xing

In this preprint we prove that any finite slope modular form fits into a p-adic family of modular forms which is indexed by the weight. Here, the term p-adic family means that p-adic congruences between weights entail certain p-adic…

Number Theory · Mathematics 2008-12-02 Joachim Mahnkopf

Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well-founded,…

cmp-lg · Computer Science 2008-02-03 Shuly Wintner , Nissim Francez

The reduced C*-algebra of a countable linear group G is shown to be simple if and only if G has no nontrivial normal amenable subgroups. Moreover, these conditions are shown to be equivalent to the uniqueness of tracial state on the…

Group Theory · Mathematics 2009-05-24 Tal Poznansky

Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…

Number Theory · Mathematics 2016-08-31 J. I. García-García , D. Marín-Aragón , A. Vigneron-Tenorio

In this paper, we investigate relationships between $|\seq(A)|$ and $|\Part_{\fin}(A)|$ in the absence of the Axiom of Choice, where $\seq(A)$ is the set of finite sequences of elements in a set $A$ and $\Part_{\fin}(A)$ is the set of…

Logic · Mathematics 2023-12-05 Palagorn Phansamdaeng , Pimpen Vejjajiva

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…

Symbolic Computation · Computer Science 2024-12-12 Alaa Ibrahim , Bruno Salvy

It is known that some theories of class $S$ are actually factorized into multiple decoupled nontrivial four-dimensional $N=2$ theories. We propose a way of constructing examples of this phenomenon using the physics of half-BPS surface…

High Energy Physics - Theory · Physics 2021-12-22 Behzat Ergun , Qianyu Hao , Andrew Neitzke , Fei Yan

In this paper, first, we answer affirmatively an open problem which was presented in 2005 by professor Gudder on the sub-sequential effect algebras. That is, we prove that if $(E,0,1, \oplus, \circ)$ is a sequential effect algebra and $A$…

Mathematical Physics · Physics 2016-09-28 Shen Jun , Wu Junde

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

Combinatorics · Mathematics 2023-06-02 W. T. Gowers , Thomas Karam

In this note we give a numerical criterion that expresses the condition that an abelian variety be simple in terms of an invariant that is closely related to the s-invariant of Ein-Cutkosky-Lazarsfeld. The criterion yields new examples…

Algebraic Geometry · Mathematics 2007-10-19 Thomas Bauer

This paper introduces the notions of atoms and atomicity in $C$-algebras and obtains a characterisation of atoms in the $C$-algebra of transformations. Further, this work presents some necessary conditions and sufficient conditions for the…

Logic in Computer Science · Computer Science 2018-04-03 Gayatri Panicker , K. V. Krishna , Purandar Bhaduri

We prove the relative index conjecture, which in turn implies that the set of embeddable deformations of a strictly pseudoconvex CR-structure on a compact 3-manifold is closed in the C\infty-topology.

Complex Variables · Mathematics 2012-03-27 Charles L. Epstein

A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…

Combinatorics · Mathematics 2018-10-30 Václav Rozhoň

In this paper we study fundamental directional properties of sets under the assumption of condition (SSP) (introduced in a previous paper). We show several transversality theorems in the singular case and an (SSP)-structure preserving…

Algebraic Geometry · Mathematics 2013-09-24 Satoshi Koike , Laurentiu Paunescu

We give a short proof of a conjecture of Lubin concerning certain families of $p$-adic power series that commute under composition. We prove that if the family is full (large enough), there exists a Lubin-Tate formal group such that all the…

Number Theory · Mathematics 2016-10-14 Laurent Berger

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Optimization and Control · Mathematics 2017-01-03 Alexander Weber , Gunther Reissig

Given a set X of finite strings, one interesting question to ask is whether there exists a member of X which is simple conditional to all other members of X. Conditional simplicity is measured by low conditional Kolmogorov complexity. We…

Computational Complexity · Computer Science 2021-02-09 Samuel Epstein