English
Related papers

Related papers: Computing the 4D Geode

200 papers

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…

Representation Theory · Mathematics 2012-08-16 Matthew Bennett , Vyjayanthi Chari , R. J. Dolbin , Nathan Manning

Following Benjamin et al., a matrix with entries being sums of two neighbouring Catalan numbers is considered. Its LU-decomposition is given, by guessing the results and later prove it by computer algebra, with lots of human help.…

Combinatorics · Mathematics 2021-06-15 Helmut Prodinger

Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all…

Combinatorics · Mathematics 2009-02-24 Yurii Burman , Dimitri Zvonkine

The semisimple part of d-dimensional Galilean conformal algebra g^(d) is given by h^(d)=O(2,1)+O(d), which after adding via semidirect sum the 3d-dimensional Abelian algebra t^(d) of translations, Galilean boosts and constant accelerations…

Mathematical Physics · Physics 2011-09-29 Sergey Fedoruk , Jerzy Lukierski

We give a new practical method for computing subvarieties of projective hypersurfaces. By computing the periods of a given hypersurface X, we find algebraic cohomology cycles on X. On well picked algebraic cycles, we can then recover the…

Algebraic Geometry · Mathematics 2022-09-23 Hossein Movasati , Emre Can Sertöz

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

Combinatorics · Mathematics 2016-06-15 Andrei K. Svinin

Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…

Complex Variables · Mathematics 2007-05-23 Silviu Olariu

In the study of 2d (the space dimension) topological orders, it is well-known that bulk excitations are classified by unitary modular tensor categories. But these categories only describe the local observables on an open 2-disk in the long…

Quantum Algebra · Mathematics 2018-06-18 Yinghua Ai , Liang Kong , Hao Zheng

Two continuous maps $f, g : \mathbb{C}^2\to\mathbb{C}^2$ are said to be topologically equivalent if there exist homeomorphisms $\varphi,\psi:\mathbb{C}^2\to\mathbb{C}^2$ satisfying $\psi\circ f\circ\varphi = g$. It is known that there are…

Algebraic Geometry · Mathematics 2024-02-15 Boulos El Hilany , Kemal Rose

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Algebraic Geometry · Mathematics 2014-02-19 Grigoriy Blekherman , João Gouveia , James Pfeiffer

It is well-known that every isosceles tetrahedron (disphenoid) admits infinitely many simple closed geodesics on its surface. They can be naturally enumerated by pairs of co-prime integers $n > m > 1$ with two additional cases $(1,0)$ and…

Metric Geometry · Mathematics 2023-12-19 Vladimir Yu. Protasov

Given a symmetric matrix $M\in \{0,1,*\}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that,…

Computational Complexity · Computer Science 2016-06-30 Martin Dyer , Leslie Ann Goldberg , David Richerby

We define new generalized factorials in several variables over an arbitrary subset $\underline{S} \subseteq R^n,$ where $R$ is a Dedekind domain and $n$ is a positive integer. We then study the properties of the fixed divisor…

Rings and Algebras · Mathematics 2018-12-24 Devendra Prasad , Krishnan Rajkumar , A. Satyanarayana Reddy

Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…

Data Structures and Algorithms · Computer Science 2019-02-20 Martin Furer , Shiva Prasad Kasiviswanathan

We study N=1 theories on Hermitian manifolds of the form M^4=S^1xM^3 with M^3 a U(1) fibration over S^2, and their 3d N=2 reductions. These manifolds admit an Heegaard-like decomposition in solid tori D^2xT^2 and D^2xS^1. We prove that when…

High Energy Physics - Theory · Physics 2016-01-20 Fabrizio Nieri , Sara Pasquetti

The long-standing Gaussian product inequality (GPI) conjecture states that $E [\prod_{j=1}^{n}X_j^{2m_j}]\geq\prod_{j=1}^{n}E[X_j^{2m_j}]$ for any centered Gaussian random vector $(X_1,\dots,X_n)$ and $m_1,\dots,m_n\in\mathbb{N}$. In this…

Probability · Mathematics 2022-10-17 Oliver Russell , Wei Sun

Let $G$ be a bridgeless cubic graph. Consider a list of $k$ 1-factors of $G$. Let $E_i$ be the set of edges contained in precisely $i$ members of the $k$ 1-factors. Let $\mu_k(G)$ be the smallest $|E_0|$ over all lists of $k$ 1-factors of…

Combinatorics · Mathematics 2023-06-21 Ligang Jin , Eckhard Steffen

We give a holomorphic quartic polynomial in the overlap variables whose zeros on the torus are precisely the Weyl-Heisenberg SICs (symmetric informationally complete positive operator valued measures). By way of comparison, all the other…

Information Theory · Computer Science 2024-05-24 Len Bos , Shayne Waldron

We describe a framework for counting and enumerating various types of crossing-free geometric graphs on a planar point set. The framework generalizes ideas of Alvarez and Seidel, who used them to count triangulations in time $O(2^nn^2)$…

Computational Geometry · Computer Science 2016-04-20 Manuel Wettstein

In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a…

Combinatorics · Mathematics 2010-06-30 Eliana Zoque