English
Related papers

Related papers: The Multiple Equal-Difference Structure of Cycloto…

200 papers

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

Combinatorics · Mathematics 2018-12-07 Latife Genc-Kaya , J. N. Hooker

We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable…

Dynamical Systems · Mathematics 2013-10-03 Ville Salo , Ilkka Törmä

We offer a new proof that a certain q-analogue of multinomial coeffi- cients furnishes a q-counting of the set of permutations of an associated multiset of positive integers, according to the number of inversions in such arrangements. Our…

Combinatorics · Mathematics 2018-08-28 Shashikant Mulay , Carl Wagner

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…

Combinatorics · Mathematics 2018-09-11 Koji Momihara , Qi Wang , Qing Xiang

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

Combinatorics · Mathematics 2026-05-27 Arnau Padrol , Germain Poullot

A method is developed to construct irreducible representations(irreps) of the quantum supergroup $U_q(C(n+1))$ in a systematic fashion. It is shown that every finite dimensional irrep of this quantum supergroup at generic $q$ is a…

High Energy Physics - Theory · Physics 2009-10-22 R. B. Zhang

We discuss a general method by which a higher order difference equation on a group is transformed into an equivalent triangular system of two difference equations of lower orders. This breakdown into lower order equations is based on the…

Exactly Solvable and Integrable Systems · Physics 2012-03-27 H. Sedaghat

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

Symbolic Computation · Computer Science 2008-10-29 Laurent Busé , Bernard Mourrain

Let $\exp[x_0,x_1,\dots,x_n]$ denote the divided difference of the exponential function. (i) We prove that exponential divided differences are log-submodular. (ii) We establish the four-point inequality $…

Classical Analysis and ODEs · Mathematics 2025-10-14 Qiulin Zeng , Nicholas Ezzell , Arman Babakhani , Itay Hen , Lev Barash

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

Algebraic Geometry · Mathematics 2015-12-29 Ada Boralevi , Jan Draisma , Emil Horobet , Elina Robeva

The notion of a reduced expression for a double coset in a Coxeter group was introduced by Williamson, and recent work of Elias and Ko has made this theory more accessible and combinatorial. One result of Elias-Ko is that any coset admits a…

Combinatorics · Mathematics 2024-11-13 Ben Elias , Hankyung Ko , Nicolas Libedinsky , Leonardo Patimo

The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of…

Combinatorics · Mathematics 2017-04-03 Gergely Kovács , Zsolt Tuza , Béla Vizvári , Hajie K. Jabbari

The uninorms with continuous underlying t-norm and t-conorm are characterized via an extended ordinal sum construction. Using the results of [18], where each uninorm with continuous underlying operations was characterized by properties of…

Rings and Algebras · Mathematics 2015-06-26 Andrea Mesiarova-Zemankova

Higher-rank versions of Wold decomposition are shown to hold for doubly commuting isometric representations of product systems of C*-correspondences over N^k, generalising the classical result for a doubly commuting pair of isometries due…

Operator Algebras · Mathematics 2007-05-23 Adam Skalski , Joachim Zacharias

In this article we study the equivariant elliptic cohomology of complex toric varieties. We prove a partial reconstruction theorem showing that equivariant elliptic cohomology encodes considerable non-trivial information on the equivariant…

Algebraic Geometry · Mathematics 2022-10-21 Sarah Scherotzke , Nicolo Sibilla

Let $A_n$ denote the height of cyclotomic polynomial $\Phi_n$, where $n$ is a product of $k$ distinct odd primes. We prove that $A_n \le \epsilon_k\phi(n)^{k^{-1}2^{k-1}-1}$ with $-\log\epsilon_k\sim c2^k$, $c>0$. The same statement is true…

Number Theory · Mathematics 2012-07-04 Bartlomiej Bzdega

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

Logic in Computer Science · Computer Science 2014-09-15 Jiří Adámek

When filtering a topological space by a single parameter, the theory of quiver representations provides a complete framework for decomposing the resulting persistence module to obtain its barcode. This is achieved by interpreting the…

Representation Theory · Mathematics 2025-07-29 Yariana Diaz

Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues of binomial coefficients…

Combinatorics · Mathematics 2021-05-18 Semin Yoo
‹ Prev 1 8 9 10 Next ›