English
Related papers

Related papers: Greedy Regular Convolutions

200 papers

A transitive permutation group is said to be semiprimitive if each of its normal subgroups is either semiregular or transitive.The class of semiprimitive groups properly contains primitive groups, quasiprimitive groups and innately…

Group Theory · Mathematics 2025-07-01 Cai Heng Li , Hanyue Yi , Yan Zhou Zhu

We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…

Statistics Theory · Mathematics 2009-09-29 Andrew R. Barron , Albert Cohen , Wolfgang Dahmen , Ronald A. DeVore

Garling sequence spaces admit a renorming with respect to which their standard unit vector basis is 1-greedy. We also discuss some additional properties of these Banach spaces related to uniform convexity and superreflexivity. In…

Functional Analysis · Mathematics 2017-05-12 Fernado Albiac , José L. Ansorena , Ben Wallis

Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…

Computation and Language · Computer Science 2021-11-19 Keyon Vafa , Yuntian Deng , David M. Blei , Alexander M. Rush

We study the ring of arithmetical functions with unitary convolution, giving an isomorphism to a generalized power series ring on infinitely many variables, similar to the isomorphism of Cashwell-Everett between the ring of arithmetical…

Commutative Algebra · Mathematics 2007-05-23 Jan Snellman

Let $\textbf{T}(n,k)$ be the set of strings of length $n$ over the alphabet $\Sigma=\{1,2,\ldots,k\}$. A universal cycle for $\textbf{T}(n,k)$ can be constructed using a greedy algorithm: start with the string $k^n$, and continually append…

Combinatorics · Mathematics 2018-05-31 Joseph DiMuro

A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been…

Kernel based regularized interpolation is a well known technique to approximate a continuous multivariate function using a set of scattered data points and the corresponding function evaluations, or data values. This method has some…

Numerical Analysis · Mathematics 2018-07-26 Gabriele Santin , Dominik Wittwar , Bernard Haasdonk

A transitive group $G$ of permutations of a set $\Omega$ is primitive if the only $G$-invariant equivalence relations on $\Omega$ are the trivial and universal relations. If $\alpha \in \Omega$, then the orbits of the stabiliser $G_\alpha$…

Group Theory · Mathematics 2013-02-19 Simon M. Smith

It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…

Combinatorics · Mathematics 2016-03-18 Roland Bacher

In this paper, we study greedy variants of quasi-Newton methods. They are based on the updating formulas from a certain subclass of the Broyden family. In particular, this subclass includes the well-known DFP, BFGS and SR1 updates. However,…

Optimization and Control · Mathematics 2021-06-02 Anton Rodomanov , Yurii Nesterov

In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that…

Number Theory · Mathematics 2017-08-08 Lajos Hajdu , Márton Szikszai , Volker Ziegler

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

Group Theory · Mathematics 2025-04-03 Murray Elder , Adam Piggott , Florian Stober , Alexander Thumm , Armin Weiß

We consider various classes of Motzkin trees as well as lambda-terms for which we derive asymptotic enumeration results. These classes are defined through various restrictions concerning the unary nodes or abstractions, respectively: We…

Combinatorics · Mathematics 2015-10-06 Olivier Bodini , Danièle Gardy , Bernhard Gittenberger , Zbigniew Gołębiewski

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

Group Theory · Mathematics 2025-09-05 Santiago Radi

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

Number Theory · Mathematics 2025-07-15 Sara Moore , Jonathan P. Sorenson

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

Group Theory · Mathematics 2012-09-18 Jason Fulman , Robert Guralnick

In this work we study three topologies defined over the same set: the hedgehog. As the name suggests, the hedgehog can be described as a set of spines identified at a single point. Among others, we give a proof of the Kowalsky hedgehog…

General Topology · Mathematics 2017-11-27 Igor Arrieta Torres

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

General Mathematics · Mathematics 2026-01-23 Edwige Tolla

In this paper we show that evolution algebras over any given field $\Bbbk$ are universally finite. In other words, given any finite group $G$, there exist infinitely many regular evolution algebras $X$ such that $Aut(X)\cong G$. The proof…

Rings and Algebras · Mathematics 2021-12-15 Cristina Costoya , Panagiote Ligouras , Alicia Tocino , Antonio Viruel