Related papers: Hybrid Character Sums From Vectorial Dual-Bent Fun…
The semi-classical approximation is an explicit formula of mathematical physics for the sum of Feynman diagrams with a single circuit.In this paper, we study the same problem in the setting of modular operads (see dg-ga/9408003); instead of…
Semisort is a fundamental algorithmic primitive widely used in the design and analysis of efficient parallel algorithms. It takes input as an array of records and a function extracting a \emph{key} per record, and reorders them so that…
In this paper, we discuss characteristic polynomials in (Clifford) geometric algebras ${\mathcal {G}}_{p,q}$ of vector space of dimension $n=p+q$. We present basis-free formulas for all characteristic polynomial coefficients in the cases…
This work introduces the Primitive Vector Cipher (PVC), a novel hybrid encryption scheme integrating matrix-based cryptography with advanced Diffie-Hellman key exchange. PVC's security is grounded on the established hardness of the Vector…
We study the asymptotic behavior of the character sums appearing in the Frobenius formula for three conjugacy classes of symmetric groups. We show that if all three conjugacy classes contain no cycles of lengths $1$, $2$, or $3$, then the…
We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of…
Feynman's diagrammatic series is a common language for a formally exact theoretical description of systems of infinitely-many interacting quantum particles, as well as a foundation for precision computational techniques. Here we introduce a…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
Adaptive coding faces the following problem: given a collection of source classes such that each class in the collection has non-trivial minimax redundancy rate, can we design a single code which is asymptotically minimax over each class in…
Voxels are a geometric representation used for rendering volumes, multi-resolution models, and indirect lighting effects. Since the memory consumption of uncompressed voxel volumes scales cubically with resolution, past works have…
Integrality properties of partial sums over irreducible representations, along columns of character tables of finite groups, were recently derived using combinatorial topological string theories (CTST). These CTST were based on…
This article is an expanded version of the talk given by the first author at the conference "Exponential sums over finite fields and applications" (ETH, Z\"urich, November, 2010). We state some conjectures on archimedian and $p$-adic…
Efficient Matlab codes in 2D and 3D have been proposed recently to assemble finite element matrices. In this paper we present simple, compact and efficient vectorized algorithms, which are variants of these codes, in arbitrary dimension,…
Every character on a graded connected Hopf algebra decomposes uniquely as a product of an even character and an odd character (Aguiar, Bergeron, and Sottile, math.CO/0310016). We obtain explicit formulas for the even and odd parts of the…
We show that a short truncation of the Fourier expansion for a character sum gives a good approximation for the average value of that character sum over an interval. We give a few applications of this result. One is that for any $b$ there…
This paper studies stochastic optimization for a sum of compositional functions, where the inner-level function of each summand is coupled with the corresponding summation index. We refer to this family of problems as finite-sum coupled…
Possible short and semi-short positive energy, unitary representations of the Osp(2N|4) superconformal group in three dimensions are discussed. Corresponding character formulae are obtained, consistent with character formulae for the…
We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…
We show that for any mod $2^m$ characters, $\chi_1, \chi_2,$ the complete exponential sum, $$ \sum_{x=1}^{2^m}\chi_1(x) \chi_2(Ax^k+B), $$ has a simple explicit evaluation.
In this survey article we present difference field algorithms for symbolic summation. Special emphasize is put on new aspects in how the summation problems are rephrased in terms of difference fields, how the problems are solved there, and…