中文
相关论文

相关论文: On the variety of linear recurrences and numerical…

200 篇论文

Non-linear recurrences which generate integers in a surprising way have been studied by many people. Typically people study recurrences that are linear in the highest order term. In this paper I consider what happens when the recurrence is…

组合数学 · 数学 2009-09-03 Emilie Hogan

The question whether there exists an integral solution to the system of linear equations with non-negative constraints, $A\x = \b, \, \x \ge 0$, where $A \in \Z^{m\times n}$ and ${\mathbf b} \in \Z^m$, finds its applications in many areas,…

组合数学 · 数学 2019-03-01 Florian Kohl , Yanxi Li , Johannes Rauh , Ruriko Yoshida

Let A be a singular matrix of M_n(K), where K is an arbitrary field. Using canonical forms, we give a new proof that the sub-semigroup of (M_n(K),x) generated by the similarity class of A is the set of matrices of M_n(K) with a rank lesser…

环与代数 · 数学 2012-09-03 Clément de Seguins Pazzis

We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.

交换代数 · 数学 2020-03-27 Ranjana Mehta , Joydip Saha , Indranath Sengupta

We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…

环与代数 · 数学 2024-01-25 Mohammed Mouçouf

In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…

计算复杂性 · 计算机科学 2017-01-05 Shunichi Matsubara

We study qualitative properties of the set of recurrent points of finitely generated free semigroups of measurable maps. In the case of a single generator the classical Poincare recurrence theorem shows that these properties are closely…

动力系统 · 数学 2020-08-13 Michael Blank

For sufficiently nice families of semigroups and monoids, the structure theorem for sets of length states that the length set of any sufficiently large element is an arithmetic sequence with some values omitted near the ends. In this paper,…

交换代数 · 数学 2023-11-13 Gilad Moskowitz , Christopher O'Neill

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

交换代数 · 数学 2020-03-27 Ranjana Mehta , Joydip Saha , Indranath Sengupta

In this paper we introduce the notion of m-irreducibility that extends the standard concept of irreducibility of a numerical semigroup when the multiplicity is fixed. We analyze the structure of the set of m-irreducible numerical…

交换代数 · 数学 2010-06-18 V. Blanco , J. C. Rosales

Semi-regular sequences over $\mathbb{F}_2$ are sequences of homogeneous elements of the algebra $ B^{(n)}=\mathbb{F}_2[X_1,...,X_n]/(X_1^2,...,X_n^2) $, which have as few relations between them as possible. They were introduced in order to…

交换代数 · 数学 2014-12-30 T. J. Hodges , S. D. Molina , J. Schlather

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

组合数学 · 数学 2018-09-27 Calvin Leng , Christopher O'Neill

In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…

数论 · 数学 2026-03-18 Caleb McKinley Shor

In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…

数论 · 数学 2025-04-04 Derong Qiu

Let $\{U(m)\}_{m\in \N}$ and $\{V(n)\}_{n\in \N}$ be linear recurrence sequences. It is a well-known Diophantine problem to determine the finiteness of the set of natural numbers $n$ such that the ratio $U(n)/V(n)$ is an integer. We study…

数论 · 数学 2026-05-08 Parvathi S Nair , S. S. Rout

A numerical semigroup is said to be ordinary if it has all its gaps in a row. Indeed, it contains zero and all integers from a given positive one. One can define a simple operation on a non-ordinary semigroup, which we call here the…

数论 · 数学 2012-03-23 Maria Bras-Amorós

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

群论 · 数学 2014-07-18 William M. Kantor , Alexander Lubotzky , Aner Shalev

We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…

群论 · 数学 2007-05-23 E. Breuillard , T. Gelander

For the OEIS sequence A214615, defined by $a(n) = M_{n}(1)$ where $M_{n}$ is the $n$-th Meixner polynomial satisfying $M_{n+1}(x) = x\,M_{n}(x) - n^{2}\,M_{n-1}(x)$, R.~J.~Mathar contributed on 6~March 2013 the conjectured order-2…

组合数学 · 数学 2026-05-07 Tong Niu

Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…

群论 · 数学 2015-10-20 Attila Nagy
‹ 上一页 1 2 3 10 下一页 ›