English
Related papers

Related papers: An algorithmic criterion for basicness in dimensio…

200 papers

We introduce normal cores, as well as the more general action cores, in the context of a semi-abelian category, and further generalise those to split extension cores in the context of a homological category. We prove that, if the category…

Category Theory · Mathematics 2023-07-26 D. Bourn , A. S. Cigoli , J. R. A. Gray , T. Van der Linden

We present a new notion of decomposition of semialgebraic sets by introducing a mode of irreducibility based on arc-analytic functions. The result is a refinement of the decomposition of such sets with respect to the Zariski topology as…

Algebraic Geometry · Mathematics 2018-07-04 Hadi Seyedinejad

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

Algebraic Geometry · Mathematics 2015-01-20 Vladimir L. Popov

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Logic · Mathematics 2016-02-25 Artem Chernikov , Sergei Starchenko

We present two algorithms determining all the complete and simplicial fans admitting a fixed non-degenerate set of vectors $V$ as generators of their 1-skeleton. The interplay of the two algorithms allows us to discerning if the associated…

Algebraic Geometry · Mathematics 2022-05-24 Michele Rossi , Lea Terracini

We consider the construction of the fundamental function and Abelian differentials of the third kind on a plane algebraic curve over the field of complex numbers that has no singular points. The algorithm for constructing differentials of…

Algebraic Geometry · Mathematics 2025-02-21 Yu Ying , E. A. Ayryan , M. D. Malykh , L. A. Sevastianov

A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…

Symbolic Computation · Computer Science 2025-03-18 Cordian. Riener , Robin Schabert , Thi Xuan Vu

In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the algebraic sets as well as the…

Algebraic Geometry · Mathematics 2011-11-10 Michael Kettner

We provide a complete classification of matrix semirings $\mathbf{M}_n(S)$ over two-element additively idempotent semirings $S$ with respect to the finite basis property.Our main theorem shows that for every integer $n \geq 2$,the semiring…

Rings and Algebras · Mathematics 2026-02-10 Jun Jiao , Miaomiao Ren

In this paper, we introduce the notion of an admissible partition of a simplicial polyhedral fan and define the category of a partitioned fan as a generalisation of the $\tau$-cluster morphism category of a finite-dimensional algebra. This…

Representation Theory · Mathematics 2025-02-26 Maximilian Kaipel

Let $T$ be a bounded quaternionic normal operator on a right quaternionic Hilbert space $\mathcal{H}$. We show that $T$ can be factorized in a strongly irreducible sense, that is, for any $\delta >0$ there exist a compact operator $K$ with…

Functional Analysis · Mathematics 2020-10-15 P. Santhosh Kumar

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Symbolic Computation · Computer Science 2020-03-19 Deepak Kapur , Yiming Yang

We consider the problem of representing the fraction $5/P$ as a sum of three distinct unit fractions $1/A+1/B+1/C$ with $A<B<C$ and $A,B,C\in\mathbb{N}$. The case of primes $P\equiv 1 \pmod{5}$ is analyzed, where two constructive types of…

Number Theory · Mathematics 2025-11-26 E. Dyachenko

For a set $S$ of (positive definite and integral) quadratic forms with bounded rank, a quadratic form $f$ is called $S$-universal if it represents all quadratic forms in $S$. A subset $S_0$ of $S$ is called an $S$-universality criterion set…

Number Theory · Mathematics 2020-09-10 Kyoungmin Kim , Jeongwon Lee , Byeong-Kweon Oh

Let X be a real or complex Hilbert space of finite but large dimension d, let S(X) denote the unit sphere of X, and let u denote the normalized uniform measure on S(X). For a finite subset B of S(X), we may test whether it is approximately…

Probability · Mathematics 2019-08-01 Sheldon Goldstein , Joel L. Lebowitz , Roderich Tumulka , Nino Zanghi

This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp

We give an algorithm to decide whether an algebraic plane foliation F has a rational first integral and to compute it in the affirmative case. The algorithm runs whenever we assume the polyhedrality of the cone of curves of the surface…

Dynamical Systems · Mathematics 2007-05-23 C. Galindo , F. Monserrat

We analyze the probability that, for a fixed finite set of primes S, a random, monic, degree n polynomial f(x) with integer coefficients in a box of side B around 0 satisfies: (i) f(x) is irreducible over the rationals, with splitting field…

Number Theory · Mathematics 2015-08-12 Jeffrey C. Lagarias , Benjamin L. Weiss

Let ${\mathfrak M}=({\mathcal M},\rho)$ be a metric space and let $X$ be a Banach space. Let $F$ be a set-valued mapping from ${\mathcal M}$ into the family ${\mathcal K}_m(X)$ of all compact convex subsets of $X$ of dimension at most $m$.…

Functional Analysis · Mathematics 2021-02-19 Pavel Shvartsman

Verifying graph algorithms has long been considered challenging in separation logic, mainly due to structural sharing between graph subcomponents. We show that these challenges can be effectively addressed by representing graphs as a…

Logic in Computer Science · Computer Science 2025-07-10 Marcos Grandury , Aleksandar Nanevski , Alexander Gryzlov