English
Related papers

Related papers: Quasi-arithmetic means ad libitum

200 papers

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore…

Logic in Computer Science · Computer Science 2015-07-01 George Metcalfe , Christoph Röthlisberger

We study numerical semigroups with the property "multiplicity= embedding dimension+1", generated by concatenation of arithmetic sequences.

Commutative Algebra · Mathematics 2020-03-27 Ranjana Mehta , Joydip Saha , Indranath Sengupta

We study a more general version of the gluings of hyperbolic orbifolds in the spirit of Gromov and Piatetski-Shapiro, where the gluing pieces, called the building blocks, are no longer assumed to be arithmetic or incommensurable. We prove…

Geometric Topology · Mathematics 2025-07-18 Nikolay Bogachev , Dmitry Guschin , Andrei Vesnin

The completion of a (normed) $C^*$-algebra $A_0[\| \cdot \|_0]$ with respect to a locally convex topology $\tau$ on $A_0$ that makes the multiplication of $A_0$ separately continuous is, in general, a quasi *-algebra, and not a locally…

Mathematical Physics · Physics 2009-04-07 F. Bagarello , M. Fragoulopoulou , A. Inoue , C. Trapani

Our main goal in this paper is to investigate the (q-)exponential $C$-distribution semigroups and (q-)exponential $C$-ultradistribution semigroups in the setting of sequentially complete locally convex spaces. We contribute to previous work…

Functional Analysis · Mathematics 2016-10-11 Marko Kosti\' c , Stevan Pilipovi\' c , Daniel Velinov

Let $S$ be a finitely generated abelian semigroup of invertible linear operators on a finite dimensional real or complex vector space $V$. We show that every coarsely dense orbit of $S$ is actually dense in $V$. More generally, if the orbit…

Functional Analysis · Mathematics 2013-02-20 Herbert Abels , Antonios Manoussos

Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…

Combinatorics · Mathematics 2015-05-13 W. R. G. James , I. Jensen , A. J. Guttmann

We construct a new infinite-dimensional family of homogeneous quasimorphisms on the group of Hamiltonian diffeomorphisms of the two-sphere. Moreover, for any constant $K$ less than the total area of the sphere, we produce unbounded…

Symplectic Geometry · Mathematics 2025-12-01 Yongsheng Jia , Richard Webb

The aim of this paper is to characterize the so-called $\sigma$-balancing property in the class of generalized quasi-arithmetic means. In general, the question is whether those elements of a given family of means that possess this property…

Classical Analysis and ODEs · Mathematics 2024-05-15 Tibor Kiss , Gergő Nagy

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

Logic · Mathematics 2022-11-18 James H. Schmerl

We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…

Optimization and Control · Mathematics 2024-08-30 Marius Costandin

We provide a new quantitative version of Helly's theorem: there exists an absolute constant $\alpha >1$ with the following property: if $\{P_i: i\in I\}$ is a finite family of convex bodies in ${\mathbb R}^n$ with ${\rm int}\left…

Metric Geometry · Mathematics 2015-11-25 Silouanos Brazitikos

Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…

Geometric Topology · Mathematics 2007-05-23 Panos Papazoglu , Kevin Whyte

This paper studies a generalization of hyperinterpolation over the high-dimensional unit cube. Hyperinterpolation of degree \( m \) serves as a discrete approximation of the \( L_2 \)-orthogonal projection of the same degree, using Fourier…

Numerical Analysis · Mathematics 2025-07-08 Congpei An , Mou Cai , Takashi Goda

We introduce a new class of locally convex spaces $E$, under the name quasi-$(DF)$-spaces, containing strictly the class of $(DF)$-spaces. A locally convex space $E$ is called a quasi-$(DF)$-space if (i) $E$ admits a fundamental bounded…

Functional Analysis · Mathematics 2017-11-15 J. C. Ferrando , S. Gabriyelyan , J. Kcakol

Given a semigroup $S$, we introduce relative (with respect to a filter $\tau$ on $S$) versions of large, thick and prethick subsets of $S$, give the ultrafilter characterizations of these subsets and explain how large could be some cell in…

General Topology · Mathematics 2015-06-02 Igor Protasov , Serhii Slobodianiuk

Let $G:= (C^*)^k\times SL_2(C)$ act linearly on a vector space or its projectivisation. We obtain an effective criterion to detect whether a number of orbits in an orbit-closure is finite or not.

Representation Theory · Mathematics 2007-05-23 E. V. Sharoyko

Let $f = (f_1,\ldots,f_m) : \R^n \longrightarrow \R^m$ be a polynomial map; $G^f(r) = \{x\in\R^n : |f_i(x)| \leq r,\ i =1,\ldots, m\}$. We show that if $f$ satisfies the Mikhailov - Gindikin condition then \begin{itemize} \item[(i)]…

Algebraic Geometry · Mathematics 2015-02-24 Ha Huy Vui , Tran Gia Loc

Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…

Optimization and Control · Mathematics 2015-05-13 Didier Henrion , Jean Bernard Lasserre , Carlo Savorgnan

This work is concerned with the fundamental scaling laws of quasi-complementary sequence sets (QCSSs) by understanding how large the set size (denoted by $M$) can grow with the flock size ($K$) and the sequence length ($N$). We first…

Combinatorics · Mathematics 2026-04-16 Huaning Liu , Lirong Guo , Zilong Liu