Divisibility of Trinomials by Irreducible Polynomials over F_2

Irreducible trinomials of given degree n over F_2 do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we consider some conditions under which irreducible polynomials divide trinomials over F_2. A condition for divisibility of self-reciprocal trinomials by irreducible polynomials over F_2 is established. And we extend Welch's criterion for testing if an irreducible polynomial divides trinomials x^m + x^s + 1 to the trinomials x^am + x^bs + 1.

Topics of divisibility

The set of integers forms a commutative ring whose elements admit a unique decomposition into primes. In this folder three lecture notes are bound, concerning topics, developed by dropping or replacing special properties of this most natural and most special ring. For short: investigated are groupoids w.r.t the interplay of multiplication - on the one hand - and divisibility, ideal decomposition and residuation, respectively, on the other hand.

The Divisibility Modulo 4 of Kloosterman Sums over Finite Fields of Characteristic 3

Recently Garashuk and Lisonek evaluated Kloosterman sums K (a) modulo 4 over a finite field F3m in the case of even K (a). They posed it as an open problem to characterize elements a in F3m for which K (a) ≡ 1 (mod4) and K (a) ≡ 3 (mod4). In this paper, we will give an answer to this problem. The result allows us to count the number of elements a in F3m belonging to each of these two classes.

Applied batch cryptography

The material presented in this thesis may be viewed as comprising two key parts, the first part concerns batch cryptography specifically, whilst the second deals with how this form of cryptography may be applied to security related applications such as electronic cash for improving efficiency of the protocols. The objective of batch cryptography is to devise more efficient primitive cryptographic protocols. In general, these primitives make use of some property such as homomorphism to perform a computationally expensive operation on a collective input set. The idea is to amortise an expensive operation, such as modular exponentiation, over the input. Most of the research work in this field has concentrated on its employment as a batch verifier of digital signatures. It is shown that several new attacks may be launched against these published schemes as some weaknesses are exposed. Another common use of batch cryptography is the simultaneous generation of digital signatures. There is significantly less previous work on this area, and the present schemes have some limited use in practical applications. Several new batch signatures schemes are introduced that improve upon the existing techniques and some practical uses are illustrated. Electronic cash is a technology that demands complex protocols in order to furnish several security properties. These typically include anonymity, traceability of a double spender, and off-line payment features. Presently, the most efficient schemes make use of coin divisibility to withdraw one large financial amount that may be progressively spent with one or more merchants. Several new cash schemes are introduced here that make use of batch cryptography for improving the withdrawal, payment, and deposit of electronic coins. The devised schemes apply both to the batch signature and verification techniques introduced, demonstrating improved performance over the contemporary divisible based structures. The solutions also provide an alternative paradigm for the construction of electronic cash systems. Whilst electronic cash is used as the vehicle for demonstrating the relevance of batch cryptography to security related applications, the applicability of the techniques introduced extends well beyond this.

Exploring and validating the internal dimensions of occupational stress: Evidence from construction cost estimators in China

A recurring feature of modern practice is occupational stress of project professionals, with both debilitating effects on the people concerned and indirectly affecting project success. Previous research outside the construction industry has involved the use of a psychology perceived stress questionnaire (PSQ) to measure occupational stress, resulting in the identification of one stressor – demand - and three sub-dimensional emotional reactions in terms of worry, tension and joy. The PSQ is translated into Chinese with a back translation technique and used in a survey of young construction cost professionals in China. Principal component analysis and confirmatory factor analysis are used to test the divisibility of occupational stress - little mentioned in previous research on stress in the construction context. In addition, structural equation modelling is used to assess nomological validity by testing the effects of the three dimensions on organizational commitment, the main finding of which is that lack of joy has the sole significant effect. The three-dimensional measurement framework facilitates the standardizing measurement of occupational stress. Further research will establish if the findings are also applicable in other settings and explore the relations between stress dimensions and other managerial concepts.

Mathematical Aspects of Financial Markets with Frictions

Frictions are factors that hinder trading of securities in financial markets. Typical frictions include limited market depth, transaction costs, lack of infinite divisibility of securities, and taxes. Conventional models used in mathematical finance often gloss over these issues, which affect almost all financial markets, by arguing that the impact of frictions is negligible and, consequently, the frictionless models are valid approximations. This dissertation consists of three research papers, which are related to the study of the validity of such approximations in two distinct modeling problems. Models of price dynamics that are based on diffusion processes, i.e., continuous strong Markov processes, are widely used in the frictionless scenario. The first paper establishes that diffusion models can indeed be understood as approximations of price dynamics in markets with frictions. This is achieved by introducing an agent-based model of a financial market where finitely many agents trade a financial security, the price of which evolves according to price impacts generated by trades. It is shown that, if the number of agents is large, then under certain assumptions the price process of security, which is a pure-jump process, can be approximated by a one-dimensional diffusion process. In a slightly extended model, in which agents may exhibit herd behavior, the approximating diffusion model turns out to be a stochastic volatility model. Finally, it is shown that when agents' tendency to herd is strong, logarithmic returns in the approximating stochastic volatility model are heavy-tailed. The remaining papers are related to no-arbitrage criteria and superhedging in continuous-time option pricing models under small-transaction-cost asymptotics. Guasoni, Rásonyi, and Schachermayer have recently shown that, in such a setting, any financial security admits no arbitrage opportunities and there exist no feasible superhedging strategies for European call and put options written on it, as long as its price process is continuous and has the so-called conditional full support (CFS) property. Motivated by this result, CFS is established for certain stochastic integrals and a subclass of Brownian semistationary processes in the two papers. As a consequence, a wide range of possibly non-Markovian local and stochastic volatility models have the CFS property.

Prime Rational Functions and Integral Polynomials

Let f(x) be a complex rational function. In this work, we study conditions under which f(x) cannot be written as the composition of two rational functions which are not units under the operation of function composition. In this case, we say that f(x) is prime. We give sufficient conditions for complex rational functions to be prime in terms of their degrees and their critical values, and we derive some conditions for the case of complex polynomials. We consider also the divisibility of integral polynomials, and we present a generalization of a theorem of Nieto. We show that if f(x) and g(x) are integral polynomials such that the content of g divides the content of f and g(n) divides f(n) for an integer n whose absolute value is larger than a certain bound, then g(x) divides f(x) in Z[x]. In addition, given an integral polynomial f(x), we provide a method to determine if f is irreducible over Z, and if not, find one of its divisors in Z[x].

The problem of the graphic artist

'The problem of the graphic artist' is a small example of applying elementary mathematics (divisibility of natural numbers) to a real problem which we ourselves have actually experienced. It deals with the possibilities for partitioning a sheet of paper into strips. In this contribution we report on a teaching unit in grade 6 as well as on informal tests with students in school and university. Finally we analyse this example methodologically, summarise our observations with pupils and students, and draw some didactical conclusions.

Padrões de aleatoriedade na modelação do acaso

A soma de variáveis aleatórias com número de parcelas é aleatório, para além do evidente interesse conceptual e teórico, tem larga ressonância na investigação do processo de risco e em processos de ramificação. Reformulamos a teoria de Panjer (1981), que permite o cálculo iterativo do risco agregado, com o recurso a valores médios de uniformes, descrevendo uma extensão da classe de Panjer, e estudando em detalhe a equação funcional que a caracteriza. Aplicamos essas ideias na caracterização de aleatoriedade discreta, exemplificando com o comportamento das fêmeas de pássaros que investem na promiscuidade de parceiros para garantir a diversidade genética da progénie, tendo no entanto o cuidado de manter as aparências de fidelidade, para garantir a cooperação do parceiro no sucesso da ninhada. Apresentamos as transformadas de Laplace e funções geradoras numa perspectiva que leva a uma introdção natural de transformadas de Pareto, cuja relevância exemplificamos.

O ensino-aprendizagem de matemática através da resolução de problemas no 3º ciclo do ensino fundamental

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Números primos e divisibilidade: estudo de propriedades

Pós-graduação em Matemática em Rede Nacional - IBILCE

Critérios de Divisibilidade e Aplicação em Sala de Aula

Pós-graduação em Matemática - IBILCE

Aritmética por apps

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)