English
Related papers

Related papers: A note on non-generators in partially ordered sets

200 papers

Value semigroups of non irreducible singular algebraic curves and their fractional ideals are submonoids of $\mathbb Z^n$ that are closed under infimums, have a conductor and fulfill a special compatibility property on their elements.…

Commutative Algebra · Mathematics 2017-09-11 Marco D'Anna , Pedro A. García-Sánchez , Vincenzo Micale , Laura Tozzo

ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…

Logic · Mathematics 2019-06-14 Paul Blain Levy

We classify all irreducible generic $\mathrm{VI}$-modules in non-describing characteristic. Our result degenerates to yield a classification of irreducible generic $\mathrm{FI}$-modules in arbitrary characteristic. Our result can also be…

Representation Theory · Mathematics 2018-10-11 Rohit Nagpal

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

Group Theory · Mathematics 2019-06-12 Benjamin Blanchette , Christian Choffrut , Christophe Reutenauer

We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…

Logic · Mathematics 2014-10-02 Gregory McKay

Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…

q-alg · Mathematics 2008-02-03 Elisa Ercolessi , Giovanni Landi , Paulo Teotonio-Sobrinho

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

Discrete Mathematics · Computer Science 2013-11-05 Ming-Deh Huang , Anand Kumar Narayanan

In this paper, we generalize results on Zhang's semipositive model metrics from the algebraic setting to strictly analytic spaces over a non-trivially valued non-Archimedean field. We prove stability under pointwise limits and under forming…

Algebraic Geometry · Mathematics 2025-03-10 Walter Gubler , Joseph Rabinoff

We construct recursion categories from categories of coalgebras. Let $F$ be a nontrivial endofunctor on the category of sets that weakly preserves pullbacks and such that the category $\textbf{Set}_F$ of $F$-coalgebras is complete. The…

Category Theory · Mathematics 2007-05-23 Florian Lengyel

Let $G$ be a finite group acting linearly on $\mathbb{R}^n$. A celebrated Theorem of Procesi and Schwarz gives an explicit description of the orbit space $\mathbb{R}^n /\!/G$ as a basic closed semi-algebraic set. We give a new proof of this…

Algebraic Geometry · Mathematics 2024-07-12 Philippe Moustrou , Cordian Riener , Robin Schabert

We present a family of finite-volume criteria which cover the regime of exponential decay for the fractional moments of Green functions of operators with random potentials. Such decay is a technically convenient characterization of…

Mathematical Physics · Physics 2009-10-31 M. Aizenman , J. H. Schenker , R. M. Friedrich , D. Hundertmark

Chiron is a derivative of von-Neumann-Bernays-G\"odel (NBG) set theory that is intended to be a practical, general-purpose logic for mechanizing mathematics. Unlike traditional set theories such as Zermelo-Fraenkel (ZF) and NBG, Chiron is…

Logic · Mathematics 2013-05-28 William M. Farmer

We initiate the study of a class of noncommutative domains of n-tuples of bounded linear operators on a Hilbert space, which is generated by certain positivity conditions on polynomials in n noncommutative indeterminates. We obtain Fatou…

Functional Analysis · Mathematics 2007-05-23 Gelu Popescu

In this article, we prove some subsets of the set of natural numbers $\mathbb{N}$ and any non-zero ideals of an order of imaginary quadratic fields are fractionally dense in $\mathbb{R}_{>0}$ and $\mathbb{C}$ respectively.

Number Theory · Mathematics 2018-10-02 Jaitra Chattopadhyay , Bidisha Roy , Subha Sarkar

In the algebra $\Cal A=\Cal L(PSL(2,\Bbb Z)\otimes B(H)=\Cal L(F_N)\otimes B(H)$, $N$ finite, there exists a bounded subnormal operator $Z$, such that $\Cal A$ is the weak closure of linear span of the set ${(Z^*)^n Z^m| n,m=0,1,2...}$.

Operator Algebras · Mathematics 2007-05-23 Florin G. Radulescu

Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…

Logic · Mathematics 2025-11-04 Frank Quinn

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

Number Theory · Mathematics 2015-06-26 P. Kurlberg , C. Pomerance

The paper discusses the characteristic properties of fractional derivatives of non-integer order. It is known that derivatives of integer orders are determined by properties of differentiable functions only in an infinitely small…

Classical Analysis and ODEs · Mathematics 2018-03-05 Vasily E. Tarasov

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim
‹ Prev 1 4 5 6 7 8 10 Next ›