English
Related papers

Related papers: A Feiner Look at the Intermediate Degrees

200 papers

We show that for any set $D$ of at least two digits in a given base $b$, there exists a $\delta(D,b)>0$ such that within the set $\mathcal{A}$ of numbers whose digits base $b$ are exclusively from $D$, the number of even integers in…

Number Theory · Mathematics 2024-02-14 James Cumberbatch

We show that an arbitrary algebra ${ A}$, (of arbitrary dimension, over an arbitrary base field and any identity is not suppose for the product), is semisimple if and only if it has zero annihilator and admits a semi-division linear basis.…

Rings and Algebras · Mathematics 2024-10-04 Antonio J. Calderon Martin

Highest weight categories arising in Lie theory are known to be associated with finite dimensional quasi-hereditary algebras such as Schur algebras or blocks of category $\mathcal O$. An analogue of the PBW theorem will be shown to hold for…

Representation Theory · Mathematics 2014-05-01 Steffen Koenig , Julian Külshammer , Sergiy Ovsienko

If $\alpha_1,\ldots,\alpha_r$ are algebraic numbers such that $$N=\sum_{i=1}^r\alpha_i \ne \sum_{i=1}^r\alpha_i^{-1}$$ for some integer $N$, then a theorem of Beukers and Zagier gives the best possible lower bound on $$\sum_{i=1}^r\log…

Number Theory · Mathematics 2015-06-22 Charles L. Samuels

Given a linear ordinary differential operator T with polynomial coefficients, we study the class of closed subsets of the complex plane such that T sends any polynomial (resp. any polynomial of degree exceeding a given positive integer)…

Classical Analysis and ODEs · Mathematics 2024-04-23 Per Alexandersson , Petter Brändén , Boris Shapiro

In this paper we study the partial Brauer $\mathbb{C}$-algebras $\mathfrak{R}_n(\delta,\delta')$, where $n \in \mathbb{N}$ and $\delta,\delta'\in\mathbb{C}$. We show that these algebras are generically semisimple, construct the Specht…

Representation Theory · Mathematics 2017-05-10 Paul Martin , Volodymyr Mazorchuk

Given a grading by an abelian group G on a semisimple Lie algebra L over an algebraically closed field of characteristic 0, we classify up to isomorphism the simple objects in the category of finite-dimensional G-graded L-modules. The…

Representation Theory · Mathematics 2015-07-22 Alberto Elduque , Mikhail Kochetov

Known classification results allow us to find the number of (equivalence classes of) fine gradings on matrix algebras and on classical simple Lie algebras over an algebraically closed field $\mathbb{F}$ (assuming $\mathrm{char}…

Rings and Algebras · Mathematics 2015-06-02 Mikhail Kochetov , Nicholas Parsons , Sergey Sadov

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

Dynamical Systems · Mathematics 2012-09-27 Bernard Host , Bryna Kra

Let ${\bf x}=(x_n)_n$ be a sequence in a Banach space. A set $A\subseteq \mathbb{N}$ is perfectly bounded, if there is $M$ such that $\|\sum_{n\in F}x_n\|\leq M$ for every finite $F\subseteq A$. The collection $B({\bf x})$ of all perfectly…

Logic · Mathematics 2022-11-08 J. Martínez , David Meza-Alcántara , Carlos Uzcátegui

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

Algebraic Geometry · Mathematics 2008-05-06 Gennadiy Averkov

Metabelian algebras are introduced and it is shown that an algebra $A$ is metabelian if and only if $A$ is a nilpotent algebra having the index of nilpotency at most $3$, i.e. $x y z t = 0$, for all $x$, $y$, $z$, $t \in A$. We prove that…

Rings and Algebras · Mathematics 2015-07-10 G. Militaru

A commutative order in a central simple algebra over a number field is said to be selective if it embeds in some, but not all, the maximal orders in the algebra. We completely characterize selective orders in central division algebras, of…

Number Theory · Mathematics 2014-03-25 Luis Arenas-Carmona

A theorem of Glasner says that if $X$ is an infinite subset of the torus $\mathbb{T}$, then for any $\epsilon>0$, there exists an integer $n$ such that the dilation $nX=\{nx: x \in \mathbb{T} \}$ is $\epsilon$-dense (i.e, it intersects any…

Number Theory · Mathematics 2014-04-16 Michael Kelly , Thai Hoang Le

Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-06-03 Alkida Balliu , Sebastian Brandt , Dennis Olivetti

A celebrated theorem of Shoda states that over any field K (of characteristic 0), every matrix with trace 0 can be expressed as a commutator AB-BA, or, equivalently, that the set of values of the polynomial f(x,y)=xy-yx on the nxn-matrix…

Rings and Algebras · Mathematics 2013-11-26 Zachary Mesyan

A Frobenius algebra is a finite-dimensional algebra $A$ which comes equipped with a coassociative, counital comultiplication map $\Delta$ that is an $A$-bimodule map. Here, we examine comultiplication maps for generalizations of Frobenius…

Quantum Algebra · Mathematics 2023-05-09 Amanda Hernandez , Chelsea Walton , Harshit Yadav

We consider homogeneity properties of Boolean algebras that have nonprincipal ultrafilters which are countably generated.It is shown that a Boolean algebra B is homogeneous if it is the union of countably generated nonprincipal ultrafilters…

Logic · Mathematics 2007-05-23 Stefan Geschke , Saharon Shelah

The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…

Combinatorics · Mathematics 2008-09-09 Vida Dujmovic' , Matthew Suderman , David R. Wood

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Logic · Mathematics 2020-11-09 Noam Greenberg , Matthew Harrison-Trainor , Ludovic Patey , Dan Turetsky
‹ Prev 1 4 5 6 7 8 10 Next ›