English
Related papers

Related papers: Reflection factorizations of Singer cycles

200 papers

Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…

Logic in Computer Science · Computer Science 2016-09-27 Olivier Bournez , Walid Gomaa , Emmanuel Hainry

In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length $n$ over a finite field $\mathbb F_q$, in the case which each prime divisor of $n$ is also a divisor of $q-1$.

Information Theory · Computer Science 2014-05-12 F. E. Brochero Martínez , C. R. Giraldo Vergara

We consider the problem of ``algebraic reconstruction'' of linear combinations of shifts of several signals $f_1,\ldots,f_k$ from the Fourier samples. For each $r=1,\ldots,k$ we choose sampling set $S_r$ to be a subset of the common set of…

Classical Analysis and ODEs · Mathematics 2013-05-14 Dmitry Batenkov , Niv Sarig , Yosef Yomdin

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

Combinatorics · Mathematics 2009-11-19 Michael Lugo

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

Let $\Bbb F_q$ be a finite field with $q$ elements and $n$ a positive integer. Mart\'inez, Vergara and Oliveira \cite{MVO} explicitly factorized $x^{n} - 1$ over $\Bbb F_q$ under the condition of $rad(n)|(q-1)$. In this paper, suppose that…

Information Theory · Computer Science 2017-10-24 Yansheng Wu , Qin Yue , Shuqin Fan

This article investigates integer sequences that partition the sequence into blocks of various lengths - irregular arrays. The main result of the article is explicit formulas for numbering of irregular arrays. A generalization of Cantor…

Combinatorics · Mathematics 2023-10-31 Boris Putievskiy

We study a recursion that generates real sequences depending on a parameter $x$. Given a negative $x$ the growth of the sequence is very difficult to estimate due to canceling terms. We reduce the study of the recursion to a problem about a…

Combinatorics · Mathematics 2010-06-08 Magnus Aspenberg , Rodrigo Perez

It is shown that if a function defined on the segment [-1,1] has sufficiently good approximation by partial sums of the Legendre polynomial expansion, then, given the function's Fourier coefficients $c_n$ for some subset of $n\in[n_1,n_2]$,…

Number Theory · Mathematics 2010-08-31 Sergei N. Preobrazhenskii

In this work we investigate the possibility of using the reflection algebra as a source of functional equations. More precisely, we obtain functional relations determining the partition function of the six-vertex model with domain-wall…

Mathematical Physics · Physics 2017-05-17 W. Galleas , J. Lamers

It is shown in [7] by Venkaiah in 2015 that a category of the number of generalized can be computed using the expression \begin{equation*} e(n, q) = \frac{1}{(q-1) ord(\lambda) n} \sum^{ord(\lambda)n}_{\substack{t \in \mathbb{F}_q \setminus…

Combinatorics · Mathematics 2018-08-10 V Ch Venkaiah

Traditional NMF-based signal decomposition relies on the factorization of spectral data, which is typically computed by means of short-time frequency transform. In this paper we propose to relax the choice of a pre-fixed transform and learn…

Machine Learning · Computer Science 2017-12-18 Dylan Fagot , Cédric Févotte , Herwig Wendt

We examine complexity and versatility of five modulo 9 Kanade--Russell identities through their finite (aka polynomial) versions and images under the $q\mapsto1/q$ reflection.

Number Theory · Mathematics 2022-02-22 Ali Uncu , Wadim Zudilin

By means of the mathematical analysis theory, inequality theory, mathematical induction and the dimension reduction method, under the proper hypotheses, we establish the following cyclic inequalities: \[\sum_{i=1}^{n}…

Classical Analysis and ODEs · Mathematics 2021-12-03 JiaJin Wen , TianYong Han , Jun Yuan

There exists a particular subset of algebraic power series over a finite field which, for different reasons, can be compared to the subset of quadratic real numbers. The continued fraction expansion for these elements, called…

Number Theory · Mathematics 2015-05-13 Alain Lasjaunias

We argue that one can factorize the difference equation of hypergeometric type on the nonuniform lattices in general case. It is shown that in the most cases of q-linear spectrum of the eigenvalues this directly leads to the dynamical…

Classical Analysis and ODEs · Mathematics 2010-03-30 R. Álvarez-Nodarse , N. M. Atakishiyev , R. S. Costas-Santos

This note considers a finite algebraic group $G$ acting on an affine variety $X$ by automorphisms. Results of Dufresne on polynomial separating algebras for linear representations of $G$ are extended to this situation. For that purpose, we…

Commutative Algebra · Mathematics 2013-07-30 Fabian Reimers

We investigate Cohen factorizations of local ring homomorphisms from three perspectives. First, we prove a "weak functoriality" result for Cohen factorizations: certain morphisms of local ring homomorphisms induce morphisms of Cohen…

Commutative Algebra · Mathematics 2013-06-03 Saeed Nasseh , Sean Sather-Wagstaff

Hofstadter's Q-sequence remains an enigma fifty years after its introduction. Initially, the terms of the sequence increase monotonically by 0 or 1 at a time. But, Q(12)=8 while Q(11)=6, and monotonicity fails shortly thereafter. In this…

Number Theory · Mathematics 2016-11-28 Nathan Fox

Reconstructing a hypothetical recurrence equation from the first terms of an infinite sequence is a classical and well-known technique in experimental mathematics. We propose a variation of this technique which can succeed with fewer input…

Symbolic Computation · Computer Science 2022-07-11 Manuel Kauers , Christoph Koutschan
‹ Prev 1 8 9 10 Next ›