相关论文: Frobenius Problem and dead ends in integers

For positive integers N and d, there are only finite number of conical symplectic varieties of dimension 2d with maximal weights N, up to isomorphism. The maximal weight of a conical symplectic variety X is, by definition, the maximal…

Suppose that R is a two-dimensional normal standard-graded domain over a finite field. We prove that there exists a uniform Frobenius test exponent b for the class of homogeneous ideals in R generated by at most n elements. This means that…

We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended amenable unimodular random graph we construct a factor of iid percolation (jointly unimodular subgraph) that is…

Given positive integers $a_1,...,a_n$ with $\gcd(a_1,...,a_n) = 1$, we call an integer t representable if there exist nonnegative integers $m_1,...,m_n$ such that $t = m_1 a_1 + ... + m_n a_n$. In this paper, we discuss the linear…

We study a generalization of the \emph{Frobenius problem}: given $k$ positive relatively prime integers, what is the largest integer $g_0$ that cannot be represented as a nonnegative integral linear combination of these parameters? More…

The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$ and finding the Frobenius number is called the Frobenius problem. In this paper, we introduce the Frobenius problem for numerical…

In this paper, as a main theorem, we prove that the decision version of the Frobenius problem is Sigma_2^P-complete under Karp reductions.Given a finite set A of coprime positive integers, we call the greatest integer that cannot be…

We study parabolic bundles on an algebraic curve in positive characteristic. Our motivation is to properly formulate Frobenius pull-backs of parabolic bundles in a way that extends various previous facts and arguments for the usual…

Let G be a finite non-nilpotent group such that every Sylow subgroup of G is generated by at most d elements, and such that p is the largest prime dividing |G|. We show that G has a non-nilpotent image G/N, such that N is characteristic and…

It is known that a linear two-weight code $C$ over a finite field $\F_q$ corresponds both to a multiset in a projective space over $\F_q$ that meets every hyperplane in either $a$ or $b$ points for some integers $a<b$, and to a strongly…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…

The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…

Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…

Frobenius problem and its many generalizations have been extensively studied in several areas of mathematics. We study semigroups of totally positive algebraic integers in totally real number fields, defining analogues of the Frobenius…

Let $R$ be a standard graded finitely generated algebra over an $F$-finite field of prime characteristic, localized at its maximal homogeneous ideal. In this note, we prove that that Frobenius complexity of $R$ is finite. Moreover, we…

Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…

Let $k\ge 2$ and $a_1, a_2, \cdots, a_k$ be positive integers with \[ \gcd(a_1, a_2, \cdots, a_k)=1. \] It is proved that there exists a positive integer $G_{a_1, a_2, \cdots, a_k}$ such that every integer $n$ strictly greater than it can…

The Frobenius Coin Problem is a classic question in mathematics: given coins of specified denominations, what is the largest amount that cannot be formed using only those coins? This brief work covers a variation of such question, posing a…

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

The study of Frobenius endomorphism provides numerous information about its corresponding Abelian variety. To understand the action of the Frobenius endomorphism, one may be interested in its eigenvalues. According to Weil's third…