相关论文: Fully Packed Loops in a triangle: matchings, paths…
We study canard solutions of the forced van der Pol (fvdP) equation in the relaxation limit for low-, intermediate-, and high-frequency periodic forcing. A central numerical observation is that there are two branches of canards in parameter…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
An extended formulation of a polytope is a linear description of this polytope using extra variables besides the variables in which the polytope is defined. The interest of extended formulations is due to the fact that many interesting…
We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…
Non-deterministic constraint logic (NCL) is a simple model of computation based on orientations of a constraint graph with edge weights and vertex demands. NCL captures \PSPACE\xspace and has been a useful tool for proving algorithmic…
Two conjectures of Zuber [``On the counting of fully packed loops configurations. Some new conjectures,'' preprint] on the enumeration of configurations in the fully packed loop model on the square grid with periodic boundary conditions,…
Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…
A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…
This paper provides the first finite-dimensional characterization for the complete set of full-block, circle criterion multipliers. We consider the interconnection of a discrete-time, linear time-invariant system in feedback with a…
We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…
Triangular numbers that are multiple of other triangular numbers are investigated. It is known that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers which are triangular numbers. If the…
In arXiv:1106.4305 extended superpolynomials were introduced for the torus links T[m,mk+r], which are functions on the entire space of time variables and, at expense of reducing the topological invariance, possess additional algebraic…
In this paper, we prove that explicit FRS codes and multiplicity codes achieve relaxed generalized Singleton bounds for list size $L\ge1.$ Specifically, we show the following: (1) FRS code of length $n$ and rate $R$ over the alphabet…
Despite the popularity of low-rank matrix completion, the majority of its theory has been developed under the assumption of random observation patterns, whereas very little is known about the practically relevant case of non-random…
This paper serves as an introduction to banded totally positive matrices, exploring various characterizations and associated properties. A significant result within is the demonstration that the collection of such matrices forms a…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)induction. Under the Curry-Howard correspondence, a cyclic proof can…
We extend the theory of Littlewood-Richardson fillings (defined over the non-negative integers) to include diagrams with rows and boxes of real-valued length. We realize such fillings as invariants of matrix pairs over rings with a…