... numbers and polynomials associated with p-adic q-integral on Zp at q −1,” Journal of Mathematical Analysis and Applications, vol 331, no 2, pp 779–792, 2007 14 T Kim, Anoteon p-adic q-integral on ... order,” Journal of Computational Analysis and Applications, vol 12, pp 695–702, 2010 27 T Kim, Ona q-analogue of the p-adic log gamma functions and related integrals,” Journal of Number Theory, ... D.-W Park, and Y.-S Ro, Anoteon Euler number and polynomials,” Journal of Inequalities and Applications, vol 2006, Article ID 34602, pages, 2006 L.-C Jang and T Kim, On the distribution of the...
... insert an article, andof which article to insert Structure of the Translation Scheme Three dictionaries are envisaged: a stem dictionary, a prefix dictionary, anda suffix dictionary If one were ... suffix, and stem dictionaries, respectively, the results obtained have been encouraging, although not faultless For example, a- li-amkwa means "he was awoken." TRANSLATION OF SWAHILI INTO ENGLISH (A ... there is a good practical reason If a program to translate Swahili into English is to be useful (rather than purely academic research), it must be usable in Tanzania Until recently, the only computers...
... 314–323, Honolulu, Hawaii Association for Computational Linguistics S Ferguson 1973 A Bayesian analysis of some nonparametric problems Annals of Statistics, 1:209–230 J R Finkel, T Grenager, C D Manning ... the case of non-fixed based distributions in a moment.) As an extreme case of the paucity of this approximation consider α1 P1 (w) = and nw = (i.e only one customer has entered the restaurant): ... trailing term leads to the approximation in Antoniak (1974) However, we can obtain an exact formula for the expectation by utilising the relationship between the Digamma function and the harmonic numbers:...
... Optimality conditions Let the Lagrangian function of 1.1 be L x, λ, μ f x λ, h x μ, g x 2.8 Journal of Inequalities and Applications Robinson’s constraint qualification CQ is said to hold at a feasible ... 2 Journal of Inequalities and Applications Comparing with the work by Correa and Ramirez 2004 , in this note, we make some modifications to the convergence analysis, and prove that all results ... Zhang, “The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming,” Mathematical Programming, 2008 D Noll, “Local convergence of an augmented Lagrangian method...
... d (A − A) , Λ (A) = maxA − minA, Λ (A) = Λ (A) /d (A) Furthermore, let κ (A) = Λ (A) − , |A| − θ (A) = max (A) , Λ (A) T (A) = ( |A| − 2)( κ (A) + − κ (A) ) + and hA = {a1 + · · · + ah : a1 , , ah ∈ A} ... ∈ A} For a specified set A, we simply write d, d , Λ, etc Our approach is based ona remarkable result of Lev [7] Using an a ne transformation of variables his theorem can be stated as follows ... of positive integers m ≤ r relatively prime to x and let ϕ(x) abbreviate ϕx (x) For a finite set Aof integers A define: the electronic journal of combinatorics (2000), #R30 d (A) = gcd (A) , d (A) ...
... than k, our recursion does apply, with the same conclusion and proof as the above corollary In conclusion, we raise the question as to whether there is a q-analogue of formula (1), (q) i.e., for ... divide q Acknowledgement Support has been provided by a grant from NSERC References [1] A Frumkin andA Yakir, “Rank of inclusion matrices and modular representation theory”, Israel J Math 71 (1990), ... (0,1)-inclusion matrix Wt,k (v) of t-dimensional subspaces versus k-dimensional (q) subspaces ofa v-dimensional space over GF (q); see [1], where the F -rank of Wt,k (v) is computed when char(F )...
... must have that every w ∈ A appears in at least one ofA or A+ (it may appear in both; in particular, v ∗ appears in both Aand A+ as there are no antiparallel edges) Hence, A ∪ A+ = A Thus, at ... an Eulerian bipartite digraph We may assume that G does not contain antiparallel edges, since otherwise G has a directed cycle of length and we are done the electronic journal of combinatorics ... Thus, at least one of them has cardinality at least m/2 Assume, without loss of generality, that |A+ | ≥ m/2 (otherwise we can reverse the directions of all edges and the result remains intact) Order...
... proof of the Theorem The q-difference operator and the q-shift operator η are defined by Dq {f (a) } = (f (a) − f (aq)) aand η{f (a) } = f (aq), respectively In [2] Chen and Liu construct the operator ... Stanley (Eds.), Mathematical Essays in honor of Gian-Carlo Rota, Birkauser, Basel 1998, pp 111-129 [3] Z G Liu, Some operator identities and q-series transformation formulas, Discrete Math 265(2003), ... Ramanujan’s ”lost” notebook I Partial θ-functions, Adv in Math 41 (1981), 137-172 [2] W Y C Chen - Z G Liu, Parameter augmentation for basic hypergeometric series, I, in: B E Sagan, R P Stanley...
... Bergeron and C Hohlweg, Coloured peak algebras and hopf algebras, arXiv: math.AC/0505612 [3] C Bonnaf´ and C Hohlweg, Generalized descent algebra and construction of irree ducible characters of ... functions, Contemporary Mathematics 34 (1984), 289–317 [6] R Mantaci and C Reutenauer, A generalization of Solomon’s algebra for hyperoctahedral groups and other wreath products, Communications ... a descent ofa permutation π ∈ Sn is a position i such that πi > πi+1 , and that an increasing run ofa permutation π is a maximal subword of consecutive letters πi+1 πi+2 · · · πi+r such that...
... and let HA = P1 vP2 be a hamiltonian path of T [A] , and HB = Q1 vQ2 a hamiltonian path of T [B] We apply Lemma twice, and obtain paths R1 and R2 such that V (Ri ) = V (Pi ) ∪ V (Qi ), and the ... there is a unique hamiltonian path of T that avoids this arc Hence, there are 2n−2 + distinct hamiltonian paths in a nearly transitive tournament of order n Lemma Let T be a strong tournament of order ... sets Aand B such that T [A] and T [B] are strong tournaments with |A| = a ≥ 3, the electronic journal of combinatorics 13 (2006), #N3 |B| = b ≥ 3, A ∪ B = V and |A ∩ B| = Let {v} = A ∩ B, and...
... C4 ) and it contains one of the minimal factorial classes (the class of complements of chain graphs) Conversely, suppose that Y is a factorial class and let G be an arbitrary n-vertex graph in ... Corollary The class of circular interval graphs and the class of linear interval graphs are factorial Proof Corollary follows from the fact that both classes are subclasses of the class of circular ... adjacent if and only if {u, v} is a subset of one of the intervals We call the triple (C, V, I) a circular interval representation of G Any graph that admits a circular interval representation...
... investigation indicated by the issuance of an AAER, may also impact a firm’s costofequity capital Upon announcement of the SEC’s investigation, the company faces a variety of financial and legal ... comments A special thanks to Andy Leone for providing AAER and restatement data anda similar individual thanks to Lance Cole for direction and information related to SEC investigations vii CONTENTS ... issuance of an AAER, again relative to a matched sample of firms that not receive an AAER The results are robust to using individual measures ofcostofequity capital Multivariate testing of...
... In these aspects, CatListGram and GenComp are weakly equivalent 274 CONCLUSIONS None of the additional characteristics for CatListGram affects the weak capacity ofa categorial grammar; i.e.: ... exclusive cancellation of primitives does not affect recognition capacity maintaining more than one argument stack does not affect recognition capacity merging argument stacks of primary and secondary ... fonetiek6.1eidenuniv.nl/hijzlndr/delilah.html) GenComp + Primitive Cancellation Constraint + Directed Stacks + Transparent Primary Category (but nevertheless) Fact Fact 4, Fact and Fact also hold mutatis mutandis for CatListGram...
... numbers and polynomials,” 2006, http://arxiv.org/abs/math/ 0702523 [11] T Kim, “An invariant p-adic q-integral on Z p ,” to appear in Applied Mathematics Letters [12] H M Srivastava, T Kim, and Y ... q-calculus and the limit q → − 1,” Advanced Studies in Contemporary Mathematics, vol 13, no 2, pp 131–141, 2006 [14] T Kim, Ona q-analogue of the p-adic log gamma functions and related integrals,” ... Journal of the Korean Mathematical Society, vol 43, no 1, pp 183–198, 2006 [2] M Cenkci and M Can, “Some results on q-analogue of the Lerch zeta function,” Advanced Studies in Contemporary Mathematics,...
... Japan E-mail address: sreich@tx.technion.ac.il Alexander J Zaslavski: Department of Mathematics, Technion – Israel Institute of Technology, 32000 Haifa, Israel E-mail address: ajzasl@tx.technion.ac.il ... contractions without fixed points], C R Acad Sci Paris S´ r I Math 308 e (1989), no 2, 51–54 (French) A D Ioffe andA J Zaslavski, Variational principles and well-posedness in optimization and calculus ... following assertion ¯ ¯ (A) For each A ∈ M p and each > 0, there are A ∈ M p , δ > 0, x ∈ K, anda neighbor¯ in M p such that hood W ofA ¯ (A, A) ∈ E( ), (3) and if B ∈ W and z ∈ K satisfy Bz...
... distinct labels then there are at least two long edges in C in both directions along the cycle If the short edges of C all have the same label and they make up more than one subpath then the paths of ... length at most g Then whp H is not a cover graph the electronic journal of combinatorics (2000), #R19 Remark 1.5 Part of the results of [10] is based ona detailed analysis of the expansion properties ... creates a directed cycle The relationship between cover graphs and graph parameters has been investigated in several papers B Descartes [5] (as noted in [2]) showed that there are cover graphs...
... fact that the lattice path returns to the main diagonal at (l, l), and is verifiable by an easy calculation the electronic journal of combinatorics (no 2) (1997), #R4 The Bijection We now construct ... chosen and, second, in the fact that Kreweras’ algorithm permutes a subset of the labels of T2 (to obtain the correct number of inversions) and ours does not have to A similar permutation ofa subset ... bar of height s∗ = and sort(S2 ) is n shown above the dotted line to the right of that bar Note also that E1 and E2 are the sets of positions of those elements of S that are used to form S1 and...
... specify a voltage assignment in a pictorial representation ofa graph, we usually fix in advance an orientation of the (undirected) graph G and assign voltages the electronic journal of combinatorics ... assignments, Graph Structure Theory (Contemporary Mathematics AMS Series) 147 (1993) 441454 [19] P R Hafner, Large Cayley graphs and digraphs with small degree and diameter, Computational Algebra and Number ... clearly connected and regular of degree d For each a ∈ Λ, the left multiplication Aa : b → ab is an automorphism of the Cayley graph H = Cay(Λ, X), which explicitly shows that Cayley graphs are...
... introduction One naturally wonders at the relationship of Dist to more familiar classes such as NP and coNP In this direction, applying the machinery of [6], we can argue that it is unlikely that Dist ... Both Arthur and Merlin are supplied with a word x, and the goal of the game is for Arthur to determine if x ∈ L Arthur, based on his coin flips, may ask Merlin a constant number of questions, and, ... [11] Alexander Russell and Ravi Sundaram Symmetric alternation captures BPP Computational Complexity, 6, 1996 [12] Michael Sipser A complexity theoretic approach to randomness In Proceedings of...