scholarly journals On the Frobenius’ Problem of three numbers

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Francesc Aguiló ◽  
Alícia Miralles
Keyword(s):  
Upper Bound ◽  
Frobenius Number ◽  
Explicit Computation ◽  
Natural Numbers ◽  
Frobenius Problem ◽  
Geometrical Proof ◽  
International Audience ◽  
Alpha Beta

International audience Given $k$ natural numbers $\{a_1, \ldots ,a_k\} \subset \mathbb{N}$ with $1 \leq a_1 < a_2 < \ldots < a_k$ and $\mathrm{gcd} (a_1, \ldots ,a_k)=1$, let be $R(a_1, \ldots ,a_k) = \{ \lambda_1 a_1+ \cdots + \lambda_k a_k | \space \lambda_i \in \mathbb{N}, i=1 \div k\}$ and $\overline{R}(a_1, \ldots ,a_k) = \mathbb{N} \backslash R (a_1, \ldots ,a_k)$. It is easy to see that $| \overline{R}(a_1, \ldots ,a_k)| < \infty$. The $\textit{Frobenius Problem}$ related to the set $\{a_1, \ldots ,a_k\}$ consists on the computation of $f(a_1, \ldots ,a_k)=\max \overline{R} (a_1, \ldots ,a_k)$, also called the $\textit{Frobenius number}$, and the cardinal $| \overline{R}(a_1, \ldots ,a_k)|$. The solution of the Frobenius Problem is the explicit computation of the set $\overline{R} (a_1,\ldots ,a_k)$. In some cases it is known a sharp upper bound for the Frobenius number. When $k=3$ this bound is known to be $$F(N)=\max\limits_{\substack{0 \lt a \lt b \lt N \\ \mathrm{gcd}(a,b,N)=1}} f(a,b,N)= \begin{cases} 2(\lfloor N/2 \rfloor -1)^2-1 & \textrm{if } N \equiv 0 (\mod 2),\\ 2 \lfloor N/2 \rfloor (\lfloor N/2 \rfloor -1) -1 & \textrm{if } N \equiv 1 (\mod 2).\\ \end{cases}$$ This bound is given in [Dixmier1990]. In this work we give a geometrical proof of this bound which allows us to give the solution of the Frobenius problem for all the sets $\{\alpha ,\beta ,N\}$ such that $f(\alpha ,\beta ,N)=F(N)$.

scholarly journals Stochastic Flips on Dimer Tilings

2010 ◽  
Vol DMTCS Proceedings vol. AM,... (Proceedings) ◽  
Author(s):  
Thomas Fernique ◽  
Damien Regnault
Keyword(s):  
Fixed Point ◽  
Markov Process ◽  
Upper Bound ◽  
Numerical Experiments ◽  
Triangular Grid ◽  
Expected Number ◽  
Worst Case ◽  
Average Case ◽  
International Audience

International audience This paper introduces a Markov process inspired by the problem of quasicrystal growth. It acts over dimer tilings of the triangular grid by randomly performing local transformations, called $\textit{flips}$, which do not increase the number of identical adjacent tiles (this number can be thought as the tiling energy). Fixed-points of such a process play the role of quasicrystals. We are here interested in the worst-case expected number of flips to converge towards a fixed-point. Numerical experiments suggest a $\Theta (n^2)$ bound, where $n$ is the number of tiles of the tiling. We prove a $O(n^{2.5})$ upper bound and discuss the gap between this bound and the previous one. We also briefly discuss the average-case.

scholarly journals Graphs with many vertex-disjoint cycles

2012 ◽  
Vol Vol. 14 no. 2 (Graph Theory) ◽  
Author(s):  
Dieter Rautenbach ◽  
Friedrich Regen
Keyword(s):  
Graph Theory ◽  
Upper Bound ◽  
Linear Time ◽  
Simple Extension ◽  
Disjoint Cycles ◽  
Cyclomatic Number ◽  
Finite Set ◽  
Extension Rule ◽  
International Audience ◽  
Vertex Disjoint

Graph Theory International audience We study graphs G in which the maximum number of vertex-disjoint cycles nu(G) is close to the cyclomatic number mu(G), which is a natural upper bound for nu(G). Our main result is the existence of a finite set P(k) of graphs for all k is an element of N-0 such that every 2-connected graph G with mu(G)-nu(G) = k arises by applying a simple extension rule to a graph in P(k). As an algorithmic consequence we describe algorithms calculating minmu(G)-nu(G), k + 1 in linear time for fixed k.

scholarly journals ON THE MAIN INVARIANT OF ELEMENTS ALGEBRAIC OVER A HENSELIAN VALUED FIELD

2002 ◽  
Vol 45 (1) ◽  
pp. 219-227 ◽  
Author(s):  
Kamal Aghigh ◽  
Sudesh K. Khanduja
Keyword(s):  
Upper Bound ◽  
Algebraic Closure ◽  
Subject Classification ◽  
Unique Extension ◽  
Valued Fields ◽  
Valued Field ◽  
Henselian Valued Fields ◽  
Alpha Beta ◽  
Henselian Valuation

AbstractLet $v$ be a henselian valuation of a field $K$ with value group $G$, let $\bar{v}$ be the (unique) extension of $v$ to a fixed algebraic closure $\bar{K}$ of $K$ and let $(\tilde{K},\tilde{v})$ be a completion of $(K,v)$. For $\alpha\in\bar{K}\setminus K$, let $M(\alpha,K)$ denote the set $\{\bar{v}(\alpha-\beta):\beta\in\bar{K},\ [K(\beta):K] \lt [K(\alpha):K]\}$. It is known that $M(\alpha,K)$ has an upper bound in $\bar{G}$ if and only if $[K(\alpha):K]=[\tilde{K}(\alpha):\tilde{K}]$, and that the supremum of $M(\alpha,K)$, which is denoted by $\delta_{K}(\alpha)$ (usually referred to as the main invariant of $\alpha$), satisfies a principle similar to the Krasner principle. Moreover, each complete discrete rank 1 valued field $(K,v)$ has the property that $\delta_{K}(\alpha)\in M(\alpha,K)$ for every $\alpha\in\bar{K}\setminus K$. In this paper the authors give a characterization of all those henselian valued fields $(K,v)$ which have the property mentioned above.AMS 2000 Mathematics subject classification: Primary 12J10; 12J25; 13A18

scholarly journals The Frobenius Complex

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Eric Clark ◽  
Richard Ehrenborg
Keyword(s):  
Homotopy Equivalent ◽  
Order Complex ◽  
Frobenius Problem ◽  
Nous Montrons ◽  
International Audience ◽  
Frobenius Complex

International audience Motivated by the classical Frobenius problem, we introduce the Frobenius poset on the integers $\mathbb{Z}$, that is, for a sub-semigroup $\Lambda$ of the non-negative integers $(\mathbb{N},+)$, we define the order by $n \leq_{\Lambda} m$ if $m-n \in \Lambda$. When $\Lambda$ is generated by two relatively prime integers $a$ and $b$, we show that the order complex of an interval in the Frobenius poset is either contractible or homotopy equivalent to a sphere. We also show that when $\Lambda$ is generated by the integers $\{a,a+d,a+2d,\ldots,a+(a-1)d\}$, the order complex is homotopy equivalent to a wedge of spheres. Motivé par le problème de Frobenius classique, nous introduisons l'ensemble partiellement ordonné de Frobenius sur les entiers $\mathbb{Z}$, c.à.d. que pour un sous-semigroupe $\Lambda$ de les entiers non-négatifs $(\mathbb{N},+)$ nous définissons l'ordre par $n \leq_{\Lambda} m$ si $m-n \in \Lambda$. Quand le $\Lambda$ est engendré par deux nombres $a$ et $b$, relativement premiers entre eux, nous montrons que le complexe des chaînes d'un intervalle quelconque dans l'ensemble partiellement ordonné de Frobenius est soit contractible soit homotopiquement équivalent à une sphère. Nous montrons aussi que dans le cas où $\Lambda$ est engendré par les entiers $\{a,a+d,a+2d,\ldots,a+(a-1)d\}$, le complexe des chaînes a le type de homotopie d'un bouquet de sphères.

scholarly journals On Compact Encoding of Pagenumber $k$ Graphs

2008 ◽  
Vol Vol. 10 no. 3 ◽  
Author(s):  
Cyril Gavoille ◽  
Nicolas Hanusse
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Constant Time ◽  
Worst Case ◽  
Encoding Scheme ◽  
Information Theoretic ◽  
Auxiliary Table ◽  
Minimum Number ◽  
International Audience

International audience In this paper we show an information-theoretic lower bound of kn - o(kn) on the minimum number of bits to represent an unlabeled simple connected n-node graph of pagenumber k. This has to be compared with the efficient encoding scheme of Munro and Raman of 2kn + 2m + o(kn+m) bits (m the number of edges), that is 4kn + 2n + o(kn) bits in the worst-case. For m-edge graphs of pagenumber k (with multi-edges and loops), we propose a 2mlog2k + O(m) bits encoding improving the best previous upper bound of Munro and Raman whenever m ≤ 1 / 2kn/log2 k. Actually our scheme applies to k-page embedding containing multi-edge and loops. Moreover, with an auxiliary table of o(m log k) bits, our coding supports (1) the computation of the degree of a node in constant time, (2) adjacency queries with O(logk) queries of type rank, select and match, that is in O(logk *minlogk / loglogm, loglogk) time and (3) the access to δ neighbors in O(δ) runs of select, rank or match;.

scholarly journals On the density and the structure of the Peirce-like formulae

2008 ◽  
Vol DMTCS Proceedings vol. AI,... (Proceedings) ◽  
Author(s):  
Antoine Genitrini ◽  
Jakub Kozik ◽  
Grzegorz Matecki
Keyword(s):  
Finite Number ◽  
Upper Bound ◽  
Large Family ◽  
Partial Answer ◽  
International Audience ◽  
Almost All

International audience Within the language of propositional formulae built on implication and a finite number of variables $k$, we analyze the set of formulae which are classical tautologies but not intuitionistic (we call such formulae - Peirce's formulae). We construct the large family of so called simple Peirce's formulae, whose sequence of densities for different $k$ is asymptotically equivalent to the sequence $\frac{1}{ 2 k^2}$. We prove that the densities of the sets of remaining Peirce's formulae are asymptotically bounded from above by $\frac{c}{ k^3}$ for some constant $c \in \mathbb{R}$. The result justifies the statement that in the considered language almost all Peirce's formulae are simple. The result gives a partial answer to the question stated in the recent paper by H. Fournier, D. Gardy, A. Genitrini and M. Zaionc - although we have not proved the existence of the densities for Peirce's formulae, our result gives lower and upper bound for it (if it exists) and both bounds are asymptotically equivalent to $\frac{1}{ 2 k^2}$.

scholarly journals On congruences for certain sums of E. Lehmer's type

2014 ◽  
Vol Volume 38 ◽  
Author(s):  
Shigeru Kanemitsu ◽  
Takako Kuzumaki ◽  
Jerzy Urbanowicz
Keyword(s):  
Natural Number ◽  
Natural Numbers ◽  
Principal Character ◽  
International Audience

International audience Let n > 1 be an odd natural number and let r (1 < r < n) be a natural number relatively prime to n. Denote by χn the principal character modulo n. In Section 3 we prove some new congruences for the sums T r,k (n) = n r ] i=1 (χn(i) i k) (mod n s+1) for s ∈ {0, 1, 2}, for all divisors r of 24 and for some natural numbers k.We obtain 82 new congruences for T r,k (n), which generalize those obtained in [Ler05], [Leh38] and [Sun08] if n = p is an odd prime. Section 4 is an appendix by the second and third named authors. It contains some new congruences for the sums Ur(n) = n

scholarly journals An $\Omega$-result related to $r_4(n)$.

1989 ◽  
Vol Volume 12 ◽  
Author(s):  
Sukumar Das Adhikari ◽  
R Balasubramanian ◽  
A Sankaranarayanan
Keyword(s):  
Upper Bound ◽  
Error Term ◽  
Elementary Proof ◽  
Arithmetical Function ◽  
Average Order ◽  
Elementary Method ◽  
International Audience

International audience Let $r_4(n)$ be the number of ways of writing $n$ as the sum of four squares. Set $P_4(x)= \sum \limits_{n\le x} r_4(n)-\frac {1}{2}\pi^2 x^2$, the error term for the average order of this arithmetical function. In this paper, following the ideas of Erd\"os and Shapiro, a new elementary method is developed which yields the slightly stronger result $P_4(x)= \Omega_{+}(x \log \log x)$. We also apply our method to give an upper bound for a quantity involving the Euler $\varphi$-function. This second result gives an elementary proof of a theorem of H. L. Montgomery

scholarly journals The game of arboricity

2005 ◽  
Vol DMTCS Proceedings vol. AE,... (Proceedings) ◽  
Author(s):  
Tomasz Bartnicki ◽  
Jaroslaw Grytczuk ◽  
Hal Kierstead
Keyword(s):  
Upper Bound ◽  
Winning Strategy ◽  
Minimum Size ◽  
Vertex Coloring ◽  
Fixed Set ◽  
International Audience

International audience Using a fixed set of colors $C$, Ann and Ben color the edges of a graph $G$ so that no monochromatic cycle may appear. Ann wins if all edges of $G$ have been colored, while Ben wins if completing a coloring is not possible. The minimum size of $C$ for which Ann has a winning strategy is called the $\textit{game arboricity}$ of $G$, denoted by $A_g(G)$. We prove that $A_g(G) \leq 3k$ for any graph $G$ of arboricity $k$, and that there are graphs such that $A_g(G) \geq 2k-2$. The upper bound is achieved by a suitable version of the activation strategy, used earlier for the vertex coloring game. We also provide other strategie based on induction.

scholarly journals Explicit generating series for connection coefficients

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Ekaterina A. Vassilieva
Keyword(s):  
Symmetric Functions ◽  
Double Coset ◽  
Type A ◽  
Explicit Computation ◽  
Zonal Polynomials ◽  
Connection Coefficients ◽  
Generating Series ◽  
International Audience ◽  
Commutative Subalgebras ◽  
Orientable Surfaces

International audience This paper is devoted to the explicit computation of generating series for the connection coefficients of two commutative subalgebras of the group algebra of the symmetric group, the class algebra and the double coset algebra. As shown by Hanlon, Stanley and Stembridge (1992), these series gives the spectral distribution of some random matrices that are of interest to statisticians. Morales and Vassilieva (2009, 2011) found explicit formulas for these generating series in terms of monomial symmetric functions by introducing a bijection between partitioned hypermaps on (locally) orientable surfaces and some decorated forests and trees. Thanks to purely algebraic means, we recover the formula for the class algebra and provide a new simpler formula for the double coset algebra. As a salient ingredient, we compute an explicit formulation for zonal polynomials indexed by partitions of type $[a,b,1^{n-a-b}]$. Cet article est dédié au calcul explicite des séries génératrices des constantes de structure de deux sous-algèbres commutatives de l'algèbre de groupe du groupe symétrique, l'algèbre de classes et l'algèbre de double classe latérale. Tel que montrè par Hanlon, Stanley and Stembridge (1992), ces séries déterminent la distribution spectrale de certaines matrices aléatoires importantes en statistique. Morales et Vassilieva (2009, 2011) ont trouvè des formules explicites pour ces séries génératrices en termes des monômes symétriques en introduisant une bijection entre les hypercartes partitionnées sur des surfaces (localement) orientables et certains arbres et forêts décorées. Grâce à des moyens purement algébriques, nous retrouvons la formule pour l'algèbre de classe et déterminons une nouvelle formule plus simple pour l'algèbre de double classe latérale. En tant que point saillant de notre démonstration nous calculons une formulation explicite pour les polynômes zonaux indexés par des partitions de type $[a,b,1^{n-a-b}]$.

Sign in / Sign up

Export Citation Format

Share Document