中文
相关论文

相关论文: Enumerating the Saneblidze-Umble diagonal terms

200 篇论文

We geometrically prove that in a d-dimensional cube with edges of length n, the number of particular d-dimensional tetrahedrons are given by Eulerian numbers. These tetrahedrons tassellate the cube, In this way the sum of the cubes are the…

历史与综述 · 数学 2011-03-23 Mario Barra

In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…

计算机科学中的逻辑 · 计算机科学 2019-12-06 Alejandro Díaz-Caro , Mauricio Guillermo , Alexandre Miquel , Benoît Valiron

This article studies canonical forms derived from the finest simultaneous block diagonalization of a set of symmetric matrices via congruence. Our technique relies on Harrison's center theory, which is extended from a single higher degree…

环与代数 · 数学 2025-12-22 Lishan Fang , Hua-Lin Huang , Jiayan Huang

We show how, using different decompositions of E(11), one can calculate the representations under the duality group of the so--called "de-form" potentials. Evidence is presented that these potentials are in one-to-one correspondence to the…

高能物理 - 理论 · 物理学 2009-04-22 E. Bergshoeff , I. De Baetselier , T. Nutma

The analysis of diagonalizable matrices in terms of their so-called isospectral reduction represents a versatile approach to the underlying eigenvalue problem. Starting from a symmetry of the isospectral reduction, we show in the present…

综合数学 · 数学 2021-05-27 Malte Röntgen , Maxim Pyzh , Christian V. Morfonios , Peter Schmelcher

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

形式语言与自动机理论 · 计算机科学 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

We prove a number of basic vanishing results for modified diagonal classes. We also obtain some sharp results for modified diagonals of curves and abelian varieties, and we prove a conjecture of O'Grady about modified diagonals on double…

代数几何 · 数学 2014-05-08 Ben Moonen , Qizheng Yin

In this article we will be dedicated some algorithms of addition, subtraction, multiplication and division of two positive integers using Zeckendorf form. Such results find application in coding theory.

数论 · 数学 2015-01-21 Rachid Chergui

We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…

最优化与控制 · 数学 2021-02-10 Miguel D. Bustamante , Pauline Mellon , M. Victoria Velasco

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…

数论 · 数学 2013-09-02 Kathrin Bringmann , Karl Mahlburg

We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…

代数几何 · 数学 2021-10-13 Madeleine Weinstein

We give a combinatorial formula for the character of a finite-dimensional irreducible representation of the periplectic Lie superalgebra $\mathfrak{p}(n)$. The character of irreducible module $L(\mu)$ is given by a cancellation-free…

表示论 · 数学 2021-08-24 Byung-Hak Hwang , Jae-Hoon Kwon

In this paper, we compute the number of two-term tilting complexes for an arbitrary symmetric algebra with radical cube zero over an algebraically closed field. Firstly, we give a complete list of symmetric algebras with radical cube zero…

表示论 · 数学 2021-10-26 Takahide Adachi , Toshitaka Aoki

This paper presents a saddlepoint approximation of the random-coding union bound of Polyanskiy et al. for i.i.d. random coding over discrete memoryless channels. The approximation is single-letter, and can thus be computed efficiently.…

信息论 · 计算机科学 2014-04-28 Jonathan Scarlett , Alfonso Martinez , Albert Guillén i Fàbregas

We consider computational complexity of problems related to the fundamental group and the first homology group of (embeddable) $2$-complexes. We show, as an extension of an earlier work, that computing first homology of $2$-complexes is…

计算几何 · 计算机科学 2016-04-11 Salman Parsa

The Dunkl--Dirac operator is a deformation of the Dirac operator by means of Dunkl derivatives. We investigate the symmetry algebra generated by the elements supercommuting with the Dunkl--Dirac operator and its dual symbol. This symmetry…

We propose a method for computing upper bounds for the Heilbronn problem for triangles.

计算几何 · 计算机科学 2010-03-09 Francesco De Comite , Jean-Paul Delahaye

In this article, we define a doubling procedure for the bialgebra of specified Feynman graphs introduced in a previous paper \cite {DMB}. This is the vector space generated by the pairs $(\bar \Gamma, \bar \gamma)$ where $\bar \Gamma$ is a…

数学物理 · 物理学 2016-05-17 Mohamed Belhaj Mohamed

In this paper, we prove some uniform estimates between Lebesgue and Hardy spaces for operators closely related to the multilinear paraproducts on R^d. We are looking for uniformity with respect to parameters, which allow us to disturb the…

经典分析与常微分方程 · 数学 2008-12-18 Frederic Bernicot

A formalism for the numerical integration of one- and two-loop integrals is presented. It is based on subtraction terms which remove the soft, collinear and some of the ultraviolet divergences from the integrand. The numerical integral is…

高能物理 - 唯象学 · 物理学 2012-10-08 A. Freitas