English
Related papers

Related papers: Algebraic Obstructions and the Collapse of Element…

200 papers

We present a new explicit formula for the $m$-th Bernoulli number $B_m$, which involves two integer parameters $a$ and $n$ with $0\le a\le m\le n$. If we set $a=0$ and $n=m$, then the formula reduces to the celebrated Kronecker formula for…

Number Theory · Mathematics 2015-05-20 Shinji Fukuhara , Nariya Kawazumi , Yusuke Kuno

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

Combinatorics · Mathematics 2026-01-13 Todd Hildebrant

We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…

Algebraic Geometry · Mathematics 2024-02-27 Larry Guth , Joshua Zahl

Let $A$ be a finite-dimensional algebra over an algebraically closed field. The problem of constructing indecomposable $A$-modules inductively from simple ones by means of exact sequences - called accessibility - is the starting point of…

Representation Theory · Mathematics 2014-01-07 Wolfgang Peternell

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu S. Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

Combinatorics · Mathematics 2025-10-31 Dominique Maldague , Hong Wang , Dmitrii Zakharov

Define a ``truncation'' $r_{t}(p)$ of a polynomial $p$ in $\{x_1,x_2,x_3,...\}$ as the polynomial with all but the first $t$ variables set to zero. In certain good cases, the truncation of a Schubert or Grothendieck polynomial may again be…

Combinatorics · Mathematics 2007-05-23 Allen Knutson , Alexander Yong

In the long paper "Family Blowup formula, Admissible Graphs and the Enumeration of Singular Curves (I)" (appearing in JDG), the author solved the enumeration problem of nodal (or general singular) curve counting on algebraic surfaces by…

Algebraic Geometry · Mathematics 2007-05-23 Ai-Ko Liu

Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…

Combinatorics · Mathematics 2024-09-16 Swee Hong Chan , Igor Pak

The coupling coefficients (3j-symbols) for the symmetric (most degenerate) irreducible representations of the orthogonal groups SO(n) in a canonical basis and different semicanonical (tree) bases [with SO(n) restricted to SO(n')\times…

Mathematical Physics · Physics 2007-05-23 S. Alisauskas

By defining two important terms called basic perturbation vectors and obtaining their linear bounds, we obtain the linear componentwise perturbation bounds for unitary factors and upper triangular factors of the generalized Schur…

Numerical Analysis · Mathematics 2022-04-21 Guihua Zhang , Hanyu Li , Yimin Wei

We develop a general obstruction theory to the formality of algebraic structures over any commutative ground ring. It relies on the construction of Kaledin obstruction classes that faithfully detect the formality of differential graded…

Algebraic Topology · Mathematics 2024-04-29 Coline Emprin

We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…

Combinatorics · Mathematics 2016-04-05 L. Colmenarejo

A number of problems in theoretical physics share a common nucleus of combinatoric nature. It is argued here that Hopf algebraic concepts and techiques can be particularly efficient in dealing with such problems. As a first example, a brief…

High Energy Physics - Theory · Physics 2007-05-23 Chryssomalis Chryssomalakos

The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…

Computational Geometry · Computer Science 2009-08-27 Ioannis Z. Emiris , Elias P. Tsigaridas , Antonios Varvitsiotis

In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let $p$ be an odd prime and let $a$ be a positive integer. We show that if $p\equiv 1\pmod{4}$ or $a>1$ then $$…

Number Theory · Mathematics 2014-08-08 Hao Pan , Zhi-Wei Sun

We study polynomial SL-invariants of tensors, mainly focusing on fundamental invariants which are of smallest degrees. In particular, we prove that certain 3-dimensional analogue of the Alon--Tarsi conjecture on Latin cubes considered…

Combinatorics · Mathematics 2023-01-24 Alimzhan Amanov , Damir Yeliussizov

Consider the moduli space, $\mathcal{M}_{3},$ of cubic polynomials over $\mathbb{C}$, with a marked critical point. Let $\mathscr{S}_{k,n}$ be the set of all points in $\mathcal{M}_{3}$ for which the marked critical point is strictly…

Dynamical Systems · Mathematics 2025-08-18 Niladri Patra

Saxl's conjecture (2012) asserts that for the staircase partition $\rho_k = (k, k-1, \ldots, 1)$, the tensor square of the corresponding irreducible representation of the symmetric group $S_{T_k}$ contains every irreducible representation…

Representation Theory · Mathematics 2026-04-10 Soong Kyum Lee

In 1952, J.H.Braun claimed to have established a formula giving a lower bound for certain partitions of sets of integers into weakly sum-free classes. However, no proof or supporting construction was published at that time. In today's…

Combinatorics · Mathematics 2020-12-08 Fred Rowley
‹ Prev 1 3 4 5 6 7 10 Next ›