Results 51 to 60 of about 6,291 (145)
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem, 19 Years Later [PDF]
The purpose of this paper is to describe and analyze the Cayley-Purser algorithm, which is a public-key cryptosystem proposed by Flannery in 1999. I will present two attacks on it, one of which is apparently new.
Stinson, Douglas R.
core +1 more source
Chaos and unpredictability with time inconsistent policy makers
We analyze the existence of equilibria with complex dynamics in a policy framework with time inconsistency. We consider an economy where, in each period, the policy maker in power determines the level of a durable public good (or bad) that creates strategic linkages across policy periods. When the decision‐making process is time consistent—such as when
Marco Battaglini
wiley +1 more source
Base sizes for simple groups and a conjecture of Cameron
Let G be a permutation group on a finite set ?. A base for G is a subset B C_ ? whose pointwise stabilizer in G is trivial; we write b(G) for the smallest size of a base for G. In this paper we prove that b(G) ?
Burness, Timothy C. +2 more
core +2 more sources
ABSTRACT A finite group G$$ G $$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on G$$ G $$. We present conditions and obstructions to mixability. We show that 2‐groups, the symmetric groups, the simple alternating groups, several matrix and sporadic simple groups, and most finite ...
Gideon Amir +3 more
wiley +1 more source
Some examples of rigid representations [PDF]
Consider the Deligne-Simpson problem: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ (resp.
Kostov, Vladimir
core +1 more source
Markov's conjecture on integral necklaces
Abstract We use the geometric reformulation of Markov's uniqueness conjecture in terms of the simple length spectrum of the modular torus to rewrite the conjecture in combinatorial terms by explicitly describing this set of lengths.
David Fisac
wiley +1 more source
How to compute the Frobenius-Schur indicator of a unipotent character of a finite Coxeter system
For each finite, irreducible Coxeter system $(W,S)$, Lusztig has associated a set of "unipotent characters" $\Uch(W)$. There is also a notion of a "Fourier transform" on the space of functions $\Uch(W) \to \RR$, due to Lusztig for Weyl groups and to Brou\
Adin +36 more
core +2 more sources
A note on the cohomology of moduli spaces of local shtukas
Abstract We study localized versions of spectral action of Fargues–Scholze, using methods from higher algebra. As our main motivation and application, we deduce a formula for the cohomology of moduli spaces of local shtukas under certain genericity assumptions, and discuss its relation with the Kottwitz conjecture.
David Hansen, Christian Johansson
wiley +1 more source
Arctangent Zubair‐G Family of Distributions: Properties and Applications to Biomedical Data
The Zubair‐G family provides a simple yet effective approach to introduce an extra parameter to extend current distributions. In this study, we proposed a modified version, termed the AZ‐G family of distributions. We examined its fundamental statistical properties and estimated the model parameters using various estimation techniques.
Mohammed Elgarhy +5 more
wiley +1 more source
Normal covering numbers for Sn$S_n$ and An$A_n$ and additive combinatorics
Abstract The normal covering number γ(G)$\gamma (G)$ of a noncyclic group G$G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for γ(Sn)$\gamma (S_n)$ and γ(An)$\gamma (A_n)$ depending on the arithmetic structure of n$n$. In particular we determine the limsups over γ(Sn)/n$\gamma (S_n) / n$ and γ(An)
Sean Eberhard, Connor Mellon
wiley +1 more source

